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_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:39:50,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:39:50,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:39:50,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:39:50,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:39:50,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:39:50,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:39:50,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:39:50,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:39:50,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:39:50,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:39:50,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:39:50,649 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:39:50,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:39:50,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:39:50,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:39:50,662 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:39:50,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:39:50,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:39:50,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:39:50,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:39:50,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:39:50,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:39:50,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:39:50,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:39:50,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:39:50,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:39:50,681 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:39:50,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:39:50,686 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:39:50,686 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:39:50,687 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:39:50,687 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:39:50,687 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:39:50,689 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:39:50,691 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:39:50,691 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:39:50,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:39:50,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:39:50,724 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:39:50,724 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:39:50,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:39:50,725 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:39:50,725 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:39:50,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:39:50,726 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:39:50,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:39:50,726 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:39:50,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:39:50,726 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:39:50,727 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:39:50,728 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:39:50,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:39:50,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:39:50,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:39:50,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:39:50,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:39:50,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:39:50,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:39:50,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:39:50,730 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:39:50,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:39:50,731 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:39:50,731 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:39:50,731 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:39:50,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:39:50,732 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:39:50,732 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:39:50,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:39:50,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:39:50,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:39:50,808 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:39:50,808 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:39:50,809 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl [2018-10-01 00:39:50,809 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl' [2018-10-01 00:39:50,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:39:50,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:39:50,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:50,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:39:50,873 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:39:50,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/1) ... [2018-10-01 00:39:50,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/1) ... [2018-10-01 00:39:50,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:39:50,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:39:50,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:39:50,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:39:50,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/1) ... [2018-10-01 00:39:50,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/1) ... [2018-10-01 00:39:50,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/1) ... [2018-10-01 00:39:50,926 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/1) ... [2018-10-01 00:39:50,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/1) ... [2018-10-01 00:39:50,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/1) ... [2018-10-01 00:39:50,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/1) ... [2018-10-01 00:39:50,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:39:50,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:39:50,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:39:50,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:39:50,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (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-10-01 00:39:50,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:39:50,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:39:51,249 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:39:51,249 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:51 BoogieIcfgContainer [2018-10-01 00:39:51,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:39:51,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:39:51,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:39:51,255 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:39:51,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:39:50" (1/2) ... [2018-10-01 00:39:51,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@385e50da and model type count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:39:51, skipping insertion in model container [2018-10-01 00:39:51,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:39:51" (2/2) ... [2018-10-01 00:39:51,260 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i_3.bpl [2018-10-01 00:39:51,272 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:39:51,282 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:39:51,334 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:39:51,335 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:39:51,335 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:39:51,335 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:39:51,335 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:39:51,336 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:39:51,336 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:39:51,336 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:39:51,336 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:39:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-01 00:39:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:39:51,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:51,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:39:51,373 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:51,381 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-01 00:39:51,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:51,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:51,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:51,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:51,536 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:39:51,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:39:51,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:39:51,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:39:51,555 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:51,556 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-01 00:39:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:51,720 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-01 00:39:51,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:39:51,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-01 00:39:51,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:51,735 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:39:51,736 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:39:51,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:39:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:39:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:39:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:39:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 00:39:51,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-01 00:39:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:51,777 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-01 00:39:51,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:39:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 00:39:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:39:51,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:51,778 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-01 00:39:51,778 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:51,778 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:51,779 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-01 00:39:51,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:51,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:51,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:51,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:51,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:51,868 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:51,868 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-10-01 00:39:51,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:51,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:51,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:51,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:39:51,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:39:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:39:51,977 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:51,978 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-01 00:39:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:52,038 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-01 00:39:52,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:39:52,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-01 00:39:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:52,039 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:39:52,040 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:39:52,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:39:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:39:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:39:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:39:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 00:39:52,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-01 00:39:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:52,044 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 00:39:52,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:39:52,044 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 00:39:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:39:52,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:52,045 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-01 00:39:52,046 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:52,046 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-01 00:39:52,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:52,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:52,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:52,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:52,147 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:52,147 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-10-01 00:39:52,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:52,185 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:52,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:52,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:52,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:52,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:39:52,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:39:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:39:52,284 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:52,285 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-01 00:39:52,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:52,528 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-01 00:39:52,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:39:52,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-01 00:39:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:52,529 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:39:52,530 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:39:52,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:39:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:39:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:39:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 00:39:52,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-01 00:39:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:52,535 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 00:39:52,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:39:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 00:39:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:39:52,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:52,536 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-01 00:39:52,536 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:52,536 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:52,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-01 00:39:52,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:52,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:52,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:52,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:52,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:52,670 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:52,670 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-10-01 00:39:52,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:52,722 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:39:52,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:52,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:52,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:52,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:39:52,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:39:52,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:39:52,791 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:52,791 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-01 00:39:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:52,986 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-01 00:39:52,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:39:52,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-01 00:39:52,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:52,988 INFO L225 Difference]: With dead ends: 15 [2018-10-01 00:39:52,989 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:39:52,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:52,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:39:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-01 00:39:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 00:39:52,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-01 00:39:52,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-01 00:39:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:52,994 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-01 00:39:52,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:39:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-01 00:39:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:39:52,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:52,995 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-01 00:39:52,996 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:52,996 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-01 00:39:52,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:52,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:52,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:52,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:53,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:53,164 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-10-01 00:39:53,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:53,205 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:53,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:53,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:53,276 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:53,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:39:53,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:39:53,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:39:53,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:53,278 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-01 00:39:53,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:53,366 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-01 00:39:53,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:39:53,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-01 00:39:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:53,368 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:39:53,368 INFO L226 Difference]: Without dead ends: 15 [2018-10-01 00:39:53,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-01 00:39:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-01 00:39:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-01 00:39:53,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-01 00:39:53,373 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-01 00:39:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:53,373 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-01 00:39:53,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:39:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-01 00:39:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:39:53,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:53,374 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-01 00:39:53,375 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:53,375 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-01 00:39:53,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:53,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:53,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:53,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:53,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:53,528 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:53,528 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-10-01 00:39:53,542 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:53,628 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:39:53,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:53,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:54,061 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:54,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:39:54,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:39:54,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:39:54,062 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:54,062 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-01 00:39:54,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:54,272 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-01 00:39:54,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:39:54,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-01 00:39:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:54,274 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:39:54,274 INFO L226 Difference]: Without dead ends: 17 [2018-10-01 00:39:54,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:39:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-01 00:39:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-01 00:39:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 00:39:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 00:39:54,279 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-01 00:39:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:54,279 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-01 00:39:54,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:39:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 00:39:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:39:54,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:54,280 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-01 00:39:54,281 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:54,281 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:54,281 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-01 00:39:54,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:54,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:54,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:54,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:54,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:54,392 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:54,393 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-10-01 00:39:54,406 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:54,426 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:39:54,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:54,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:54,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:54,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:39:54,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:39:54,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:39:54,530 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:54,530 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-01 00:39:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:54,653 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-01 00:39:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:39:54,654 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-01 00:39:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:54,655 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:39:54,656 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:39:54,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:54,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:39:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 00:39:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:39:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-01 00:39:54,660 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-01 00:39:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:54,661 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-01 00:39:54,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:39:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-01 00:39:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:39:54,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:54,662 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-01 00:39:54,662 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:54,662 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:54,663 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-01 00:39:54,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:54,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:54,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:54,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:54,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:54,828 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:54,828 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-10-01 00:39:54,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:54,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:54,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:54,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:39:54,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:39:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:39:54,957 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:54,957 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-01 00:39:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:55,065 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-01 00:39:55,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:39:55,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-01 00:39:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:55,066 INFO L225 Difference]: With dead ends: 23 [2018-10-01 00:39:55,066 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 00:39:55,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 00:39:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-01 00:39:55,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:39:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 00:39:55,072 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-01 00:39:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:55,072 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-01 00:39:55,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:39:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 00:39:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:39:55,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:55,073 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-01 00:39:55,073 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:55,074 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-01 00:39:55,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:55,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:55,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:55,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:55,265 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:55,265 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-10-01 00:39:55,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:55,308 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:55,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:55,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:55,419 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:55,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:39:55,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:39:55,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:39:55,420 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:55,421 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-01 00:39:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:55,529 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-01 00:39:55,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:39:55,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:39:55,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:55,530 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:39:55,530 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:39:55,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:39:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 00:39:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:39:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-01 00:39:55,536 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-01 00:39:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:55,536 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-01 00:39:55,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:39:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-01 00:39:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:39:55,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:55,537 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-01 00:39:55,538 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:55,538 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-01 00:39:55,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:55,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:55,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:55,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:55,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:55,656 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:55,656 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-10-01 00:39:55,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:55,707 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:39:55,707 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:55,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:55,808 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:55,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:39:55,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:39:55,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:39:55,808 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:55,809 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-10-01 00:39:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:55,903 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-01 00:39:55,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:39:55,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-01 00:39:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:55,906 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:39:55,906 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:39:55,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:39:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-01 00:39:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:39:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-01 00:39:55,911 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-01 00:39:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:55,911 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-01 00:39:55,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:39:55,911 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-01 00:39:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:39:55,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:55,912 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-10-01 00:39:55,912 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:55,913 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:55,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-10-01 00:39:55,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:55,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:55,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:55,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:55,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:56,041 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:56,041 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-10-01 00:39:56,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:39:56,073 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:39:56,073 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:56,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:56,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:56,205 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:39:56,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:39:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:39:56,206 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:56,206 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-10-01 00:39:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:56,299 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-01 00:39:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:39:56,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-01 00:39:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:56,301 INFO L225 Difference]: With dead ends: 29 [2018-10-01 00:39:56,301 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:39:56,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:39:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:39:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 00:39:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:39:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-01 00:39:56,307 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-01 00:39:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:56,307 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-01 00:39:56,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:39:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-01 00:39:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:39:56,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:56,308 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-10-01 00:39:56,309 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:56,309 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-10-01 00:39:56,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:56,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:56,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:56,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:56,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:56,654 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:56,654 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-10-01 00:39:56,663 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:39:56,694 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:39:56,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:56,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:56,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:56,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:39:56,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:39:56,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:39:56,802 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:56,802 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-01 00:39:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:57,076 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-01 00:39:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:39:57,078 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-01 00:39:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:57,079 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:39:57,079 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 00:39:57,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:39:57,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 00:39:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-01 00:39:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:39:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-01 00:39:57,084 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-01 00:39:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:57,084 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-01 00:39:57,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:39:57,085 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-01 00:39:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:39:57,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:57,086 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-10-01 00:39:57,086 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:57,086 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-10-01 00:39:57,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:57,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:57,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:57,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:57,247 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:57,247 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-10-01 00:39:57,258 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:39:57,288 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:39:57,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:57,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:57,453 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:57,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:39:57,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:39:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:39:57,454 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:57,454 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-10-01 00:39:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:57,561 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-01 00:39:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:39:57,564 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-10-01 00:39:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:57,565 INFO L225 Difference]: With dead ends: 33 [2018-10-01 00:39:57,565 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:39:57,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:39:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:39:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-01 00:39:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:39:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-01 00:39:57,571 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-01 00:39:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:57,571 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-01 00:39:57,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:39:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-01 00:39:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:39:57,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:57,573 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-10-01 00:39:57,573 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:57,573 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:57,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-10-01 00:39:57,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:57,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:57,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:57,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:57,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:57,816 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:57,816 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-10-01 00:39:57,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:57,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:58,043 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:58,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:58,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:39:58,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:39:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:39:58,065 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:58,065 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-01 00:39:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:58,257 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-01 00:39:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:39:58,257 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-01 00:39:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:58,258 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:39:58,258 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:39:58,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:39:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:39:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-01 00:39:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:39:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-01 00:39:58,262 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-01 00:39:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:58,263 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-01 00:39:58,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:39:58,263 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-01 00:39:58,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:39:58,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:58,264 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-10-01 00:39:58,264 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:58,264 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-10-01 00:39:58,265 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:58,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:58,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:39:58,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:58,607 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:58,607 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:58,608 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-10-01 00:39:58,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:39:58,661 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:39:58,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:58,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:58,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:58,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:39:58,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:39:58,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:39:58,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:58,795 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-10-01 00:39:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:58,919 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-01 00:39:58,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:39:58,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-01 00:39:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:58,926 INFO L225 Difference]: With dead ends: 37 [2018-10-01 00:39:58,926 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:39:58,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:39:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:39:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:39:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:39:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-01 00:39:58,932 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-01 00:39:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:58,932 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-01 00:39:58,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:39:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-01 00:39:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:39:58,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:58,934 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-10-01 00:39:58,934 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:58,934 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-10-01 00:39:58,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:58,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:58,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:58,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:58,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:39:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:59,303 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:39:59,303 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-10-01 00:39:59,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:39:59,352 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:39:59,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:39:59,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:39:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:39:59,468 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:39:59,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:39:59,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:39:59,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:39:59,469 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:39:59,469 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-10-01 00:39:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:39:59,613 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-01 00:39:59,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:39:59,615 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-10-01 00:39:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:39:59,616 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:39:59,616 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:39:59,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:39:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:39:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-01 00:39:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:39:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 00:39:59,620 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-01 00:39:59,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:39:59,620 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-01 00:39:59,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:39:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 00:39:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:39:59,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:39:59,621 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-10-01 00:39:59,621 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:39:59,621 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:39:59,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-10-01 00:39:59,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:39:59,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:39:59,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:59,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:39:59,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:39:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:00,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:00,221 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-10-01 00:40:00,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:00,272 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:00,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:00,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:00,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:00,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-01 00:40:00,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:40:00,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:40:00,609 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:00,609 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-10-01 00:40:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:00,768 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-01 00:40:00,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:40:00,769 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-10-01 00:40:00,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:00,769 INFO L225 Difference]: With dead ends: 41 [2018-10-01 00:40:00,770 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 00:40:00,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:40:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 00:40:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-01 00:40:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 00:40:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-01 00:40:00,776 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-01 00:40:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:00,777 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-01 00:40:00,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:40:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-01 00:40:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:40:00,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:00,778 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-10-01 00:40:00,778 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:00,778 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:00,779 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-10-01 00:40:00,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:00,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:00,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:00,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:00,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:01,553 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:01,553 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-10-01 00:40:01,561 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:01,597 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-01 00:40:01,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:01,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:01,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:01,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:40:01,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:40:01,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:40:01,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:01,706 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-10-01 00:40:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:01,834 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-01 00:40:01,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:40:01,834 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-10-01 00:40:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:01,835 INFO L225 Difference]: With dead ends: 43 [2018-10-01 00:40:01,835 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 00:40:01,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:40:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 00:40:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-01 00:40:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:40:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-01 00:40:01,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-01 00:40:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:01,842 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-01 00:40:01,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:40:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-01 00:40:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:40:01,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:01,843 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-10-01 00:40:01,844 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:01,844 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-10-01 00:40:01,844 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:01,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:01,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:02,003 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:02,004 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-10-01 00:40:02,011 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:02,050 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:40:02,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:02,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:02,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:02,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-01 00:40:02,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:40:02,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:40:02,684 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:02,684 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-10-01 00:40:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:02,883 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-01 00:40:02,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:40:02,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-10-01 00:40:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:02,884 INFO L225 Difference]: With dead ends: 45 [2018-10-01 00:40:02,885 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:40:02,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:40:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:40:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-01 00:40:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-01 00:40:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-01 00:40:02,888 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-01 00:40:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:02,889 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-01 00:40:02,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:40:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-01 00:40:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 00:40:02,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:02,889 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-10-01 00:40:02,890 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:02,890 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:02,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-10-01 00:40:02,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:02,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:02,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:02,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:02,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:03,635 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:03,635 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-10-01 00:40:03,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:03,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:03,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:03,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-01 00:40:03,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:40:03,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:40:03,920 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:03,920 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-10-01 00:40:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:04,057 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-01 00:40:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:40:04,057 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-10-01 00:40:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:04,058 INFO L225 Difference]: With dead ends: 47 [2018-10-01 00:40:04,059 INFO L226 Difference]: Without dead ends: 45 [2018-10-01 00:40:04,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:40:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-01 00:40:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-01 00:40:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-01 00:40:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-01 00:40:04,065 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-01 00:40:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:04,065 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-01 00:40:04,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:40:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-01 00:40:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 00:40:04,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:04,066 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-10-01 00:40:04,067 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:04,067 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-10-01 00:40:04,067 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:04,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:04,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:04,264 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:04,264 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-10-01 00:40:04,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:04,331 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:04,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:04,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:04,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:04,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-01 00:40:04,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:40:04,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:40:04,458 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:04,458 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-10-01 00:40:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:04,601 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-01 00:40:04,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:40:04,601 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-10-01 00:40:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:04,602 INFO L225 Difference]: With dead ends: 49 [2018-10-01 00:40:04,602 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 00:40:04,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:40:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 00:40:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 00:40:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 00:40:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-01 00:40:04,608 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-01 00:40:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:04,608 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-01 00:40:04,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:40:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-01 00:40:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:40:04,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:04,609 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-10-01 00:40:04,609 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:04,610 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-10-01 00:40:04,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:04,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:04,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:04,951 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:04,951 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-10-01 00:40:04,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:05,011 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-01 00:40:05,011 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:05,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:05,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:05,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-01 00:40:05,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:40:05,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:40:05,193 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:05,194 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-10-01 00:40:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:05,348 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-01 00:40:05,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:40:05,351 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-10-01 00:40:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:05,352 INFO L225 Difference]: With dead ends: 51 [2018-10-01 00:40:05,352 INFO L226 Difference]: Without dead ends: 49 [2018-10-01 00:40:05,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-01 00:40:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-01 00:40:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-01 00:40:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-01 00:40:05,357 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-01 00:40:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:05,357 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-01 00:40:05,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:40:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-01 00:40:05,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 00:40:05,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:05,358 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-10-01 00:40:05,358 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:05,358 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-10-01 00:40:05,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:05,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:05,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:05,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:05,589 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:05,589 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-10-01 00:40:05,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:05,670 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:05,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:05,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:05,842 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:05,842 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-01 00:40:05,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-01 00:40:05,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-01 00:40:05,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:05,843 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-10-01 00:40:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:05,965 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-01 00:40:05,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:40:05,966 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-10-01 00:40:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:05,967 INFO L225 Difference]: With dead ends: 53 [2018-10-01 00:40:05,967 INFO L226 Difference]: Without dead ends: 51 [2018-10-01 00:40:05,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:05,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-01 00:40:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-01 00:40:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 00:40:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-01 00:40:05,971 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-01 00:40:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:05,972 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-01 00:40:05,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-01 00:40:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-01 00:40:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:40:05,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:05,973 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-10-01 00:40:05,973 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:05,973 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:05,973 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-10-01 00:40:05,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:05,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:05,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:05,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:06,178 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:06,178 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-10-01 00:40:06,185 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:06,232 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-01 00:40:06,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:06,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:06,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:06,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-01 00:40:06,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:40:06,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:40:06,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:06,491 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-10-01 00:40:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:06,589 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-01 00:40:06,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:40:06,589 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-10-01 00:40:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:06,590 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:40:06,590 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 00:40:06,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 00:40:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-01 00:40:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:40:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-01 00:40:06,595 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-01 00:40:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:06,595 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-01 00:40:06,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:40:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-01 00:40:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:40:06,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:06,596 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-10-01 00:40:06,596 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:06,596 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-10-01 00:40:06,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:06,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:06,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:06,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:06,886 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:06,886 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-10-01 00:40:06,892 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:06,963 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 00:40:06,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:06,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:07,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:07,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-01 00:40:07,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 00:40:07,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 00:40:07,086 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:07,086 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-10-01 00:40:07,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:07,219 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-01 00:40:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:40:07,219 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-10-01 00:40:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:07,220 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:40:07,220 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 00:40:07,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 00:40:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-01 00:40:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 00:40:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-01 00:40:07,225 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-01 00:40:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:07,226 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-01 00:40:07,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 00:40:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-01 00:40:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-01 00:40:07,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:07,227 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-10-01 00:40:07,227 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:07,227 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:07,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-10-01 00:40:07,227 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:07,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:07,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:07,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:07,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:07,885 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:07,885 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-10-01 00:40:07,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:07,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:08,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:08,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-01 00:40:08,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:40:08,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:40:08,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:08,074 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-10-01 00:40:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:08,245 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-01 00:40:08,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:40:08,246 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-10-01 00:40:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:08,246 INFO L225 Difference]: With dead ends: 59 [2018-10-01 00:40:08,246 INFO L226 Difference]: Without dead ends: 57 [2018-10-01 00:40:08,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:40:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-01 00:40:08,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-01 00:40:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 00:40:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-01 00:40:08,251 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-01 00:40:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:08,252 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-01 00:40:08,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:40:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-01 00:40:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-01 00:40:08,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:08,253 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-10-01 00:40:08,253 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:08,253 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:08,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-10-01 00:40:08,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:08,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:08,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:08,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:08,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:08,473 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:08,473 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-10-01 00:40:08,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:08,525 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:08,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:08,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:08,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:08,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-01 00:40:08,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 00:40:08,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 00:40:08,644 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:08,644 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-10-01 00:40:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:08,801 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-01 00:40:08,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:40:08,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-10-01 00:40:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:08,802 INFO L225 Difference]: With dead ends: 61 [2018-10-01 00:40:08,802 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 00:40:08,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:40:08,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 00:40:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-01 00:40:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:40:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-01 00:40:08,806 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-01 00:40:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:08,806 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-01 00:40:08,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 00:40:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-01 00:40:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 00:40:08,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:08,807 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-10-01 00:40:08,807 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:08,807 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:08,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-10-01 00:40:08,808 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:08,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:08,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:08,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:08,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:09,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:09,088 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-10-01 00:40:09,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:09,152 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-01 00:40:09,153 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:09,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:09,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:09,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-01 00:40:09,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:40:09,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:40:09,379 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:09,380 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-10-01 00:40:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:09,666 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-01 00:40:09,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:40:09,666 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-10-01 00:40:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:09,667 INFO L225 Difference]: With dead ends: 63 [2018-10-01 00:40:09,667 INFO L226 Difference]: Without dead ends: 61 [2018-10-01 00:40:09,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:09,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-01 00:40:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-01 00:40:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-01 00:40:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-01 00:40:09,672 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-01 00:40:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:09,672 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-01 00:40:09,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:40:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-01 00:40:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 00:40:09,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:09,673 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-10-01 00:40:09,673 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:09,673 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-10-01 00:40:09,674 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:09,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:09,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:09,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:09,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:09,912 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:09,912 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-10-01 00:40:09,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:09,965 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:09,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:09,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:10,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:10,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-01 00:40:10,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 00:40:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 00:40:10,144 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:10,145 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-10-01 00:40:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:10,403 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-01 00:40:10,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:40:10,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-10-01 00:40:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:10,405 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:40:10,405 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:40:10,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:40:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-01 00:40:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:40:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-01 00:40:10,408 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-01 00:40:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:10,408 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-01 00:40:10,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 00:40:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-01 00:40:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 00:40:10,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:10,409 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-10-01 00:40:10,409 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:10,409 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:10,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-10-01 00:40:10,410 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:10,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:10,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:10,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:10,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:10,674 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:10,674 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-10-01 00:40:10,685 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:10,750 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-01 00:40:10,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:10,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:10,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:10,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-01 00:40:10,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:40:10,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:40:10,886 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:10,886 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-10-01 00:40:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:11,026 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-01 00:40:11,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:40:11,026 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-10-01 00:40:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:11,027 INFO L225 Difference]: With dead ends: 67 [2018-10-01 00:40:11,027 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:40:11,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:40:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-01 00:40:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-01 00:40:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-01 00:40:11,030 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-10-01 00:40:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:11,031 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-01 00:40:11,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:40:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-01 00:40:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-01 00:40:11,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:11,031 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-10-01 00:40:11,031 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:11,032 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-10-01 00:40:11,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:11,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:11,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:11,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:11,839 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:11,839 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-10-01 00:40:11,848 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:11,915 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 00:40:11,915 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:11,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:12,063 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:12,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-01 00:40:12,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 00:40:12,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 00:40:12,064 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:12,064 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-10-01 00:40:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:12,196 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-01 00:40:12,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:40:12,197 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-10-01 00:40:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:12,198 INFO L225 Difference]: With dead ends: 69 [2018-10-01 00:40:12,198 INFO L226 Difference]: Without dead ends: 67 [2018-10-01 00:40:12,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:40:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-01 00:40:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-01 00:40:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:40:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-01 00:40:12,201 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-10-01 00:40:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:12,201 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-01 00:40:12,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 00:40:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-01 00:40:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:40:12,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:12,202 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-10-01 00:40:12,202 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:12,203 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:12,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-10-01 00:40:12,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:12,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:12,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:13,420 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:13,421 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-10-01 00:40:13,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:13,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:13,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:13,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-01 00:40:13,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:40:13,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:40:13,719 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:13,719 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-10-01 00:40:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:13,864 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-01 00:40:13,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:40:13,865 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-10-01 00:40:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:13,866 INFO L225 Difference]: With dead ends: 71 [2018-10-01 00:40:13,866 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:40:13,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:40:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:40:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-01 00:40:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-01 00:40:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-01 00:40:13,870 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-10-01 00:40:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:13,870 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-01 00:40:13,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:40:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-01 00:40:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:40:13,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:13,870 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-10-01 00:40:13,871 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:13,871 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:13,871 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-10-01 00:40:13,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:13,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:13,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:13,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:13,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:14,815 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:14,815 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-10-01 00:40:14,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:14,876 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:14,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:14,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:15,009 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:15,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-01 00:40:15,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:40:15,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:40:15,010 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:15,010 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-10-01 00:40:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:15,260 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-01 00:40:15,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:40:15,260 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-10-01 00:40:15,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:15,261 INFO L225 Difference]: With dead ends: 73 [2018-10-01 00:40:15,261 INFO L226 Difference]: Without dead ends: 71 [2018-10-01 00:40:15,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:40:15,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-01 00:40:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-01 00:40:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-01 00:40:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-01 00:40:15,266 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-10-01 00:40:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:15,267 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-01 00:40:15,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:40:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-01 00:40:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-01 00:40:15,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:15,268 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-10-01 00:40:15,268 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:15,269 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:15,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-10-01 00:40:15,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:15,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:15,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:15,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:15,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:15,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:15,645 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-10-01 00:40:15,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:15,724 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-01 00:40:15,724 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:15,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:15,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:15,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-01 00:40:15,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:40:15,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:40:15,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:15,880 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-10-01 00:40:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:16,054 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-01 00:40:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:40:16,055 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-10-01 00:40:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:16,056 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:40:16,056 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 00:40:16,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 00:40:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-01 00:40:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:40:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-01 00:40:16,060 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-10-01 00:40:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:16,061 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-01 00:40:16,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:40:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-01 00:40:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-01 00:40:16,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:16,061 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-10-01 00:40:16,062 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:16,062 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:16,062 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-10-01 00:40:16,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:16,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:16,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:16,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:16,363 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:16,363 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-10-01 00:40:16,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:16,427 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:16,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:16,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:16,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:16,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:16,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-01 00:40:16,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 00:40:16,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 00:40:16,605 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:16,605 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-10-01 00:40:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:16,869 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-01 00:40:16,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:40:16,869 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-10-01 00:40:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:16,870 INFO L225 Difference]: With dead ends: 77 [2018-10-01 00:40:16,870 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 00:40:16,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 00:40:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-01 00:40:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:40:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-01 00:40:16,874 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-10-01 00:40:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:16,874 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-01 00:40:16,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 00:40:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-01 00:40:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 00:40:16,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:16,875 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-10-01 00:40:16,876 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:16,876 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:16,876 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-10-01 00:40:16,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:16,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:16,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:16,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:16,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:17,205 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:17,205 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-10-01 00:40:17,213 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:17,287 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-01 00:40:17,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:17,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:18,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:18,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-01 00:40:18,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:40:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:40:18,453 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:18,453 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-10-01 00:40:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:18,717 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-01 00:40:18,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:40:18,718 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-10-01 00:40:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:18,718 INFO L225 Difference]: With dead ends: 79 [2018-10-01 00:40:18,719 INFO L226 Difference]: Without dead ends: 77 [2018-10-01 00:40:18,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:40:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-01 00:40:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-01 00:40:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-01 00:40:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-01 00:40:18,722 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-10-01 00:40:18,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:18,723 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-01 00:40:18,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:40:18,723 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-01 00:40:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 00:40:18,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:18,724 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-10-01 00:40:18,724 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:18,724 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-10-01 00:40:18,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:18,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:18,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:18,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:18,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:18,951 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:18,951 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-10-01 00:40:18,959 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:19,035 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-01 00:40:19,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:19,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:19,199 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:19,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-01 00:40:19,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-01 00:40:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-01 00:40:19,200 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:19,201 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-10-01 00:40:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:19,435 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-01 00:40:19,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:40:19,435 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-10-01 00:40:19,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:19,436 INFO L225 Difference]: With dead ends: 81 [2018-10-01 00:40:19,436 INFO L226 Difference]: Without dead ends: 79 [2018-10-01 00:40:19,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:40:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-01 00:40:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-01 00:40:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-01 00:40:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-01 00:40:19,440 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-10-01 00:40:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:19,440 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-01 00:40:19,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-01 00:40:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-01 00:40:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-01 00:40:19,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:19,441 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-10-01 00:40:19,441 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:19,441 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-10-01 00:40:19,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:19,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:19,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:19,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:19,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:19,902 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:19,902 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-10-01 00:40:19,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:19,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:20,167 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:20,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-01 00:40:20,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:40:20,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:40:20,168 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:20,168 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-10-01 00:40:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:20,475 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-01 00:40:20,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:40:20,475 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-10-01 00:40:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:20,476 INFO L225 Difference]: With dead ends: 83 [2018-10-01 00:40:20,476 INFO L226 Difference]: Without dead ends: 81 [2018-10-01 00:40:20,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-01 00:40:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-01 00:40:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-01 00:40:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-01 00:40:20,480 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-10-01 00:40:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:20,480 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-01 00:40:20,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:40:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-01 00:40:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-01 00:40:20,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:20,481 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-10-01 00:40:20,482 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:20,482 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:20,482 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-10-01 00:40:20,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:20,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:20,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:20,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:20,771 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:20,771 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-10-01 00:40:20,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:20,840 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:20,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:20,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:21,010 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:21,010 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-01 00:40:21,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-01 00:40:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-01 00:40:21,011 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:21,011 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-10-01 00:40:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:21,266 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-01 00:40:21,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:40:21,266 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-10-01 00:40:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:21,267 INFO L225 Difference]: With dead ends: 85 [2018-10-01 00:40:21,267 INFO L226 Difference]: Without dead ends: 83 [2018-10-01 00:40:21,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-01 00:40:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-01 00:40:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-01 00:40:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-01 00:40:21,271 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-10-01 00:40:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:21,272 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-01 00:40:21,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-01 00:40:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-01 00:40:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-01 00:40:21,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:21,272 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-10-01 00:40:21,273 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:21,273 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:21,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-10-01 00:40:21,273 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:21,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:21,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:21,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:21,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:21,590 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:21,590 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-10-01 00:40:21,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:21,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-01 00:40:21,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:21,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:21,850 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:21,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-01 00:40:21,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:40:21,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:40:21,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:21,852 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-10-01 00:40:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:22,140 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-01 00:40:22,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:40:22,141 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-10-01 00:40:22,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:22,142 INFO L225 Difference]: With dead ends: 87 [2018-10-01 00:40:22,142 INFO L226 Difference]: Without dead ends: 85 [2018-10-01 00:40:22,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-01 00:40:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-01 00:40:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-01 00:40:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-01 00:40:22,145 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-10-01 00:40:22,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:22,145 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-01 00:40:22,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:40:22,146 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-01 00:40:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-01 00:40:22,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:22,146 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-10-01 00:40:22,146 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:22,146 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:22,146 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-10-01 00:40:22,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:22,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:22,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:22,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:22,642 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:22,642 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-10-01 00:40:22,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:22,722 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:22,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:22,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:22,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:22,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-01 00:40:22,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-01 00:40:22,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-01 00:40:22,924 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:22,924 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-10-01 00:40:23,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:23,260 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-01 00:40:23,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 00:40:23,261 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-10-01 00:40:23,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:23,262 INFO L225 Difference]: With dead ends: 89 [2018-10-01 00:40:23,262 INFO L226 Difference]: Without dead ends: 87 [2018-10-01 00:40:23,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-01 00:40:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-10-01 00:40:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-01 00:40:23,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-01 00:40:23,266 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-10-01 00:40:23,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:23,266 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-01 00:40:23,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-01 00:40:23,267 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-01 00:40:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-01 00:40:23,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:23,267 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-10-01 00:40:23,268 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:23,268 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:23,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-10-01 00:40:23,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:23,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:23,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:23,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:23,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:23,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:23,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 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-10-01 00:40:23,701 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:23,800 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-01 00:40:23,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:23,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:24,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:24,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-01 00:40:24,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 00:40:24,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 00:40:24,013 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:24,014 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-10-01 00:40:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:24,280 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-01 00:40:24,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 00:40:24,280 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-10-01 00:40:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:24,281 INFO L225 Difference]: With dead ends: 91 [2018-10-01 00:40:24,281 INFO L226 Difference]: Without dead ends: 89 [2018-10-01 00:40:24,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-01 00:40:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-01 00:40:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-01 00:40:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-01 00:40:24,284 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-10-01 00:40:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:24,284 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-01 00:40:24,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 00:40:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-01 00:40:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-01 00:40:24,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:24,285 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-10-01 00:40:24,285 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:24,285 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-10-01 00:40:24,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:24,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:24,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:24,686 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:24,686 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-10-01 00:40:24,693 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:24,789 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-01 00:40:24,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:24,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:25,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:25,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-01 00:40:25,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-01 00:40:25,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-01 00:40:25,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:25,072 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-10-01 00:40:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:25,253 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-01 00:40:25,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 00:40:25,254 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-10-01 00:40:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:25,255 INFO L225 Difference]: With dead ends: 93 [2018-10-01 00:40:25,255 INFO L226 Difference]: Without dead ends: 91 [2018-10-01 00:40:25,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-01 00:40:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-10-01 00:40:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-01 00:40:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-01 00:40:25,259 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-10-01 00:40:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:25,259 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-01 00:40:25,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-01 00:40:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-01 00:40:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-01 00:40:25,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:25,260 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-10-01 00:40:25,260 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:25,260 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-10-01 00:40:25,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:25,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:25,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:25,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:25,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:25,736 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-10-01 00:40:25,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:25,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:26,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:26,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-01 00:40:26,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 00:40:26,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 00:40:26,013 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:26,013 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-10-01 00:40:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:26,298 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-01 00:40:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 00:40:26,298 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-10-01 00:40:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:26,299 INFO L225 Difference]: With dead ends: 95 [2018-10-01 00:40:26,299 INFO L226 Difference]: Without dead ends: 93 [2018-10-01 00:40:26,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-01 00:40:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-01 00:40:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-01 00:40:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-01 00:40:26,303 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-10-01 00:40:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:26,303 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-01 00:40:26,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 00:40:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-01 00:40:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-01 00:40:26,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:26,304 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-10-01 00:40:26,304 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:26,305 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-10-01 00:40:26,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:26,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:26,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:26,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:26,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:27,567 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:27,567 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-10-01 00:40:27,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:27,650 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:27,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:27,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:27,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:27,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-01 00:40:27,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-01 00:40:27,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-01 00:40:27,946 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:27,946 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-10-01 00:40:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:28,399 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-01 00:40:28,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 00:40:28,399 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-10-01 00:40:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:28,400 INFO L225 Difference]: With dead ends: 97 [2018-10-01 00:40:28,400 INFO L226 Difference]: Without dead ends: 95 [2018-10-01 00:40:28,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:40:28,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-01 00:40:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-10-01 00:40:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-01 00:40:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-01 00:40:28,404 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-10-01 00:40:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:28,405 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-01 00:40:28,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-01 00:40:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-01 00:40:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-01 00:40:28,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:28,405 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-10-01 00:40:28,405 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:28,406 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-10-01 00:40:28,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:28,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:28,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:28,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:29,109 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:29,109 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-10-01 00:40:29,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:29,250 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-01 00:40:29,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:29,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:29,504 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:29,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-01 00:40:29,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 00:40:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 00:40:29,521 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:29,521 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-10-01 00:40:29,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:29,854 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-01 00:40:29,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 00:40:29,855 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-10-01 00:40:29,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:29,855 INFO L225 Difference]: With dead ends: 99 [2018-10-01 00:40:29,855 INFO L226 Difference]: Without dead ends: 97 [2018-10-01 00:40:29,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:40:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-01 00:40:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-10-01 00:40:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-01 00:40:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-01 00:40:29,859 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-10-01 00:40:29,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:29,859 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-01 00:40:29,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 00:40:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-01 00:40:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-01 00:40:29,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:29,860 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-10-01 00:40:29,860 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:29,860 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:29,860 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-10-01 00:40:29,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:29,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:29,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:29,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:29,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:30,666 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:30,666 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-10-01 00:40:30,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:30,746 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:30,746 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:30,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:32,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:32,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-01 00:40:32,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-01 00:40:32,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-01 00:40:32,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:32,375 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-10-01 00:40:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:32,686 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-01 00:40:32,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 00:40:32,686 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-10-01 00:40:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:32,687 INFO L225 Difference]: With dead ends: 101 [2018-10-01 00:40:32,687 INFO L226 Difference]: Without dead ends: 99 [2018-10-01 00:40:32,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:40:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-01 00:40:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-10-01 00:40:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-01 00:40:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-01 00:40:32,690 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-10-01 00:40:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:32,691 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-01 00:40:32,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-01 00:40:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-01 00:40:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-01 00:40:32,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:32,692 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-10-01 00:40:32,692 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:32,692 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-10-01 00:40:32,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:32,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:32,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:33,234 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:33,234 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-10-01 00:40:33,242 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:33,347 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-01 00:40:33,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:33,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:33,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:33,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-01 00:40:33,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 00:40:33,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 00:40:33,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:33,590 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-10-01 00:40:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:33,838 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-01 00:40:33,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 00:40:33,839 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-10-01 00:40:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:33,840 INFO L225 Difference]: With dead ends: 103 [2018-10-01 00:40:33,840 INFO L226 Difference]: Without dead ends: 101 [2018-10-01 00:40:33,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:40:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-01 00:40:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-01 00:40:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-01 00:40:33,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-01 00:40:33,843 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-10-01 00:40:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:33,843 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-01 00:40:33,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 00:40:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-01 00:40:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-01 00:40:33,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:33,844 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-10-01 00:40:33,845 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:33,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-10-01 00:40:33,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:33,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:33,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:33,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:34,187 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:34,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 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-10-01 00:40:34,195 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:34,304 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-01 00:40:34,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:34,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:34,500 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:34,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-01 00:40:34,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-01 00:40:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-01 00:40:34,501 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:34,501 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-10-01 00:40:34,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:34,768 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-01 00:40:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 00:40:34,769 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-10-01 00:40:34,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:34,770 INFO L225 Difference]: With dead ends: 105 [2018-10-01 00:40:34,770 INFO L226 Difference]: Without dead ends: 103 [2018-10-01 00:40:34,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:34,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-01 00:40:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-10-01 00:40:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-01 00:40:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-01 00:40:34,776 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-10-01 00:40:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:34,776 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-01 00:40:34,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-01 00:40:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-01 00:40:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-01 00:40:34,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:34,777 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-10-01 00:40:34,777 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:34,777 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:34,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-10-01 00:40:34,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:34,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:34,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:34,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:35,217 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:35,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 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-10-01 00:40:35,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:35,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:35,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:35,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-01 00:40:35,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 00:40:35,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 00:40:35,495 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:35,495 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-10-01 00:40:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:35,774 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-01 00:40:35,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 00:40:35,775 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-10-01 00:40:35,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:35,776 INFO L225 Difference]: With dead ends: 107 [2018-10-01 00:40:35,776 INFO L226 Difference]: Without dead ends: 105 [2018-10-01 00:40:35,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-01 00:40:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-10-01 00:40:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-01 00:40:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-01 00:40:35,780 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-10-01 00:40:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:35,780 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-01 00:40:35,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 00:40:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-01 00:40:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-01 00:40:35,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:35,781 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-10-01 00:40:35,782 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:35,782 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-10-01 00:40:35,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:35,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:35,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:36,123 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:36,123 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-10-01 00:40:36,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:36,210 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:36,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:36,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:36,527 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:36,527 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-01 00:40:36,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 00:40:36,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 00:40:36,528 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:36,528 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-10-01 00:40:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:36,981 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-01 00:40:36,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 00:40:36,982 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-10-01 00:40:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:36,983 INFO L225 Difference]: With dead ends: 109 [2018-10-01 00:40:36,983 INFO L226 Difference]: Without dead ends: 107 [2018-10-01 00:40:36,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-01 00:40:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-10-01 00:40:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-01 00:40:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-01 00:40:36,987 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-10-01 00:40:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:36,987 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-01 00:40:36,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 00:40:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-01 00:40:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-01 00:40:36,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:36,988 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-10-01 00:40:36,989 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:36,989 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-10-01 00:40:36,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:36,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:36,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:36,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:36,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:37,464 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:37,464 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-10-01 00:40:37,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:37,588 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-01 00:40:37,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:37,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:38,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:38,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-01 00:40:38,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 00:40:38,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 00:40:38,046 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:38,047 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-10-01 00:40:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:38,380 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-01 00:40:38,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 00:40:38,381 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-10-01 00:40:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:38,381 INFO L225 Difference]: With dead ends: 111 [2018-10-01 00:40:38,381 INFO L226 Difference]: Without dead ends: 109 [2018-10-01 00:40:38,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:40:38,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-01 00:40:38,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-10-01 00:40:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-01 00:40:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-01 00:40:38,385 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-10-01 00:40:38,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:38,385 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-01 00:40:38,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 00:40:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-01 00:40:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-01 00:40:38,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:38,386 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-10-01 00:40:38,387 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:38,387 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:38,387 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-10-01 00:40:38,387 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:38,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:38,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:38,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:38,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:39,562 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:39,562 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:39,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:39,665 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:39,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:39,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:39,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:39,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-01 00:40:39,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-01 00:40:39,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-01 00:40:39,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:39,875 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-10-01 00:40:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:40,389 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-01 00:40:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 00:40:40,390 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-10-01 00:40:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:40,390 INFO L225 Difference]: With dead ends: 113 [2018-10-01 00:40:40,391 INFO L226 Difference]: Without dead ends: 111 [2018-10-01 00:40:40,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:40:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-01 00:40:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-10-01 00:40:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-01 00:40:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-01 00:40:40,393 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-10-01 00:40:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:40,393 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-01 00:40:40,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-01 00:40:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-01 00:40:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-01 00:40:40,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:40,394 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-10-01 00:40:40,394 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:40,394 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:40,395 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-10-01 00:40:40,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:40,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:40,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:40,732 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:40,732 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:40,746 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:40,918 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-01 00:40:40,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:40,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:41,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:41,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-01 00:40:41,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-01 00:40:41,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-01 00:40:41,218 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:41,218 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-10-01 00:40:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:41,442 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-01 00:40:41,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 00:40:41,443 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-10-01 00:40:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:41,444 INFO L225 Difference]: With dead ends: 115 [2018-10-01 00:40:41,444 INFO L226 Difference]: Without dead ends: 113 [2018-10-01 00:40:41,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-01 00:40:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-10-01 00:40:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-01 00:40:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-01 00:40:41,448 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-10-01 00:40:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:41,448 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-01 00:40:41,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-01 00:40:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-01 00:40:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-01 00:40:41,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:41,449 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-10-01 00:40:41,450 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:41,450 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-10-01 00:40:41,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:41,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:41,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:42,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:42,523 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:42,523 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:42,531 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:42,673 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-01 00:40:42,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:42,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:43,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:43,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-01 00:40:43,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-01 00:40:43,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-01 00:40:43,020 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:43,020 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-10-01 00:40:43,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:43,438 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-01 00:40:43,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 00:40:43,438 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-10-01 00:40:43,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:43,439 INFO L225 Difference]: With dead ends: 117 [2018-10-01 00:40:43,439 INFO L226 Difference]: Without dead ends: 115 [2018-10-01 00:40:43,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:40:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-01 00:40:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-10-01 00:40:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-01 00:40:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-01 00:40:43,443 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-10-01 00:40:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:43,443 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-01 00:40:43,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-01 00:40:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-01 00:40:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-01 00:40:43,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:43,444 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-10-01 00:40:43,444 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:43,444 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-10-01 00:40:43,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:43,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:43,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:43,834 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:43,834 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:43,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:43,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:44,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:44,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-01 00:40:44,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-01 00:40:44,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-01 00:40:44,322 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:44,322 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-10-01 00:40:44,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:44,823 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-01 00:40:44,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-01 00:40:44,824 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-10-01 00:40:44,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:44,825 INFO L225 Difference]: With dead ends: 119 [2018-10-01 00:40:44,825 INFO L226 Difference]: Without dead ends: 117 [2018-10-01 00:40:44,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:40:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-01 00:40:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-10-01 00:40:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-01 00:40:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-01 00:40:44,828 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-10-01 00:40:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:44,829 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-01 00:40:44,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-01 00:40:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-01 00:40:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-01 00:40:44,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:44,830 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-10-01 00:40:44,830 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:44,830 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:44,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-10-01 00:40:44,830 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:44,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:44,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:45,533 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:45,533 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:45,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:45,629 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:45,629 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:45,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:46,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:46,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-01 00:40:46,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-01 00:40:46,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-01 00:40:46,688 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:46,689 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-10-01 00:40:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:47,069 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-01 00:40:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 00:40:47,069 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-10-01 00:40:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:47,070 INFO L225 Difference]: With dead ends: 121 [2018-10-01 00:40:47,070 INFO L226 Difference]: Without dead ends: 119 [2018-10-01 00:40:47,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:40:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-01 00:40:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-01 00:40:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-01 00:40:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-01 00:40:47,072 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-10-01 00:40:47,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:47,073 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-01 00:40:47,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-01 00:40:47,073 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-01 00:40:47,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-01 00:40:47,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:47,073 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-10-01 00:40:47,074 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:47,074 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:47,074 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-10-01 00:40:47,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:47,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:47,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:47,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:47,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:47,432 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:47,432 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:47,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:47,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-01 00:40:47,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:47,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:47,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:47,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:47,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-01 00:40:47,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-01 00:40:47,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-01 00:40:47,866 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:47,866 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-10-01 00:40:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:48,116 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-01 00:40:48,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-01 00:40:48,117 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-10-01 00:40:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:48,118 INFO L225 Difference]: With dead ends: 123 [2018-10-01 00:40:48,118 INFO L226 Difference]: Without dead ends: 121 [2018-10-01 00:40:48,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-01 00:40:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-10-01 00:40:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-01 00:40:48,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-01 00:40:48,121 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-10-01 00:40:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:48,121 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-01 00:40:48,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-01 00:40:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-01 00:40:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-01 00:40:48,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:48,122 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-10-01 00:40:48,122 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:48,122 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-10-01 00:40:48,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:48,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:48,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:48,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:48,604 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:48,604 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:48,724 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:48,725 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:48,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:48,962 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:48,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-01 00:40:48,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-01 00:40:48,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-01 00:40:48,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:48,963 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-10-01 00:40:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:49,343 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-01 00:40:49,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 00:40:49,343 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-10-01 00:40:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:49,345 INFO L225 Difference]: With dead ends: 125 [2018-10-01 00:40:49,345 INFO L226 Difference]: Without dead ends: 123 [2018-10-01 00:40:49,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-01 00:40:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-10-01 00:40:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-01 00:40:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-01 00:40:49,349 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-10-01 00:40:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:49,349 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-01 00:40:49,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-01 00:40:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-01 00:40:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-01 00:40:49,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:49,350 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-10-01 00:40:49,351 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:49,351 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:49,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-10-01 00:40:49,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:49,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:49,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:49,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:49,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:49,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:49,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:49,701 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:49,845 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-01 00:40:49,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:49,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:50,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:50,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-01 00:40:50,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-01 00:40:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-01 00:40:50,195 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:50,195 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-10-01 00:40:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:50,774 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-01 00:40:50,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-01 00:40:50,775 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-10-01 00:40:50,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:50,776 INFO L225 Difference]: With dead ends: 127 [2018-10-01 00:40:50,776 INFO L226 Difference]: Without dead ends: 125 [2018-10-01 00:40:50,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-01 00:40:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-10-01 00:40:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-01 00:40:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-01 00:40:50,779 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-10-01 00:40:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:50,779 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-01 00:40:50,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-01 00:40:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-01 00:40:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-01 00:40:50,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:50,780 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-10-01 00:40:50,781 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:50,781 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:50,781 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-10-01 00:40:50,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:50,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:50,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:50,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:50,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:51,146 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:51,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:51,154 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:51,299 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-01 00:40:51,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:51,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:51,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:51,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-01 00:40:51,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-01 00:40:51,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-01 00:40:51,620 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:51,620 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-10-01 00:40:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:52,056 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-01 00:40:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 00:40:52,057 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-10-01 00:40:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:52,058 INFO L225 Difference]: With dead ends: 129 [2018-10-01 00:40:52,058 INFO L226 Difference]: Without dead ends: 127 [2018-10-01 00:40:52,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:52,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-01 00:40:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-01 00:40:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-01 00:40:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-01 00:40:52,061 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-10-01 00:40:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:52,062 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-01 00:40:52,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-01 00:40:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-01 00:40:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-01 00:40:52,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:52,062 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-10-01 00:40:52,063 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:52,063 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-10-01 00:40:52,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:52,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:52,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:52,613 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:52,613 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:52,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:52,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:52,966 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:52,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-01 00:40:52,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-01 00:40:52,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-01 00:40:52,967 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:52,968 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-10-01 00:40:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:53,328 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-01 00:40:53,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-01 00:40:53,328 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-10-01 00:40:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:53,329 INFO L225 Difference]: With dead ends: 131 [2018-10-01 00:40:53,329 INFO L226 Difference]: Without dead ends: 129 [2018-10-01 00:40:53,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:40:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-01 00:40:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-10-01 00:40:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-01 00:40:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-01 00:40:53,333 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-10-01 00:40:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:53,333 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-01 00:40:53,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-01 00:40:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-01 00:40:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-01 00:40:53,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:53,334 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-10-01 00:40:53,334 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:53,334 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:53,334 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-10-01 00:40:53,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:53,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:53,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:53,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:53,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:53,766 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:53,766 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:53,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:53,871 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:53,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:53,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:54,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:54,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-01 00:40:54,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-01 00:40:54,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-01 00:40:54,145 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:54,145 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-10-01 00:40:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:54,467 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-01 00:40:54,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 00:40:54,467 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-10-01 00:40:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:54,468 INFO L225 Difference]: With dead ends: 133 [2018-10-01 00:40:54,468 INFO L226 Difference]: Without dead ends: 131 [2018-10-01 00:40:54,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-01 00:40:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-10-01 00:40:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-01 00:40:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-01 00:40:54,472 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-10-01 00:40:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:54,473 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-01 00:40:54,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-01 00:40:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-01 00:40:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-01 00:40:54,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:54,474 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-10-01 00:40:54,474 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:54,474 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:54,474 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-10-01 00:40:54,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:54,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:54,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:54,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:54,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:54,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:54,860 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:54,860 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:54,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:55,025 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-10-01 00:40:55,026 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:55,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:55,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:55,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-01 00:40:55,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-01 00:40:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-01 00:40:55,264 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:55,264 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-10-01 00:40:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:55,790 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-01 00:40:55,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-01 00:40:55,790 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-10-01 00:40:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:55,791 INFO L225 Difference]: With dead ends: 135 [2018-10-01 00:40:55,791 INFO L226 Difference]: Without dead ends: 133 [2018-10-01 00:40:55,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:55,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-01 00:40:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-10-01 00:40:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-01 00:40:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-01 00:40:55,794 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-10-01 00:40:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:55,794 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-01 00:40:55,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-01 00:40:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-01 00:40:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-01 00:40:55,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:55,795 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-10-01 00:40:55,796 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:55,796 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:55,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-10-01 00:40:55,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:55,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:55,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:55,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:55,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:56,532 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:56,532 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:56,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:56,640 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:56,640 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:56,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:56,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:56,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-01 00:40:56,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-01 00:40:56,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-01 00:40:56,920 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:56,920 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-10-01 00:40:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:57,360 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-01 00:40:57,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 00:40:57,360 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-10-01 00:40:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:57,361 INFO L225 Difference]: With dead ends: 137 [2018-10-01 00:40:57,361 INFO L226 Difference]: Without dead ends: 135 [2018-10-01 00:40:57,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:40:57,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-01 00:40:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-01 00:40:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-01 00:40:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-01 00:40:57,365 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-10-01 00:40:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:57,365 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-01 00:40:57,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-01 00:40:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-01 00:40:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-01 00:40:57,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:57,366 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-10-01 00:40:57,366 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:57,367 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-10-01 00:40:57,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:57,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:57,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:57,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:57,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:57,784 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:57,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:57,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:57,974 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-10-01 00:40:57,975 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:57,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:58,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:58,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-01 00:40:58,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 00:40:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 00:40:58,249 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:58,249 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-10-01 00:40:58,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:58,697 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-01 00:40:58,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 00:40:58,697 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-10-01 00:40:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:58,698 INFO L225 Difference]: With dead ends: 139 [2018-10-01 00:40:58,698 INFO L226 Difference]: Without dead ends: 137 [2018-10-01 00:40:58,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-01 00:40:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-01 00:40:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-01 00:40:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-01 00:40:58,701 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-10-01 00:40:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:58,701 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-01 00:40:58,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 00:40:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-01 00:40:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-01 00:40:58,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:58,703 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-10-01 00:40:58,703 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:58,703 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:58,703 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-10-01 00:40:58,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:58,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:58,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:59,137 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:59,137 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:59,145 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:59,312 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-10-01 00:40:59,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:59,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:59,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:59,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-01 00:40:59,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-01 00:40:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-01 00:40:59,597 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:59,597 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-10-01 00:40:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:59,998 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-01 00:40:59,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 00:40:59,999 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-10-01 00:40:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:00,000 INFO L225 Difference]: With dead ends: 141 [2018-10-01 00:41:00,000 INFO L226 Difference]: Without dead ends: 139 [2018-10-01 00:41:00,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-01 00:41:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-01 00:41:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-01 00:41:00,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-01 00:41:00,003 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-10-01 00:41:00,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:00,003 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-01 00:41:00,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-01 00:41:00,003 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-01 00:41:00,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-01 00:41:00,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:00,004 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-10-01 00:41:00,004 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:00,004 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:00,004 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-10-01 00:41:00,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:00,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:00,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:00,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:00,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:00,480 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:00,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:00,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:00,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:01,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:01,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-01 00:41:01,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-01 00:41:01,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-01 00:41:01,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:01,123 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-10-01 00:41:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:01,573 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-01 00:41:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-01 00:41:01,574 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-10-01 00:41:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:01,574 INFO L225 Difference]: With dead ends: 143 [2018-10-01 00:41:01,575 INFO L226 Difference]: Without dead ends: 141 [2018-10-01 00:41:01,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:41:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-01 00:41:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-10-01 00:41:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-01 00:41:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-01 00:41:01,577 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-10-01 00:41:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:01,577 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-01 00:41:01,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-01 00:41:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-01 00:41:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-01 00:41:01,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:01,578 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-10-01 00:41:01,578 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:01,578 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-10-01 00:41:01,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:01,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:01,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:01,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:01,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:02,033 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:02,033 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:02,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:02,153 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:02,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:02,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:02,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:02,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-01 00:41:02,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-01 00:41:02,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-01 00:41:02,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:02,470 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-10-01 00:41:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:02,941 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-01 00:41:02,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 00:41:02,942 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-10-01 00:41:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:02,942 INFO L225 Difference]: With dead ends: 145 [2018-10-01 00:41:02,942 INFO L226 Difference]: Without dead ends: 143 [2018-10-01 00:41:02,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-01 00:41:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-10-01 00:41:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-01 00:41:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-01 00:41:02,947 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-10-01 00:41:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:02,947 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-01 00:41:02,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-01 00:41:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-01 00:41:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-01 00:41:02,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:02,949 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-10-01 00:41:02,949 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:02,949 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-10-01 00:41:02,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:02,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:02,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:02,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:02,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:03,503 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:03,503 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:03,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:03,684 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-10-01 00:41:03,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:03,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:03,944 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:03,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-01 00:41:03,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 00:41:03,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 00:41:03,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:03,945 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-10-01 00:41:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:04,446 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-01 00:41:04,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 00:41:04,448 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-10-01 00:41:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:04,449 INFO L225 Difference]: With dead ends: 147 [2018-10-01 00:41:04,449 INFO L226 Difference]: Without dead ends: 145 [2018-10-01 00:41:04,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-01 00:41:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-10-01 00:41:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-01 00:41:04,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-01 00:41:04,453 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-10-01 00:41:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:04,453 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-01 00:41:04,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 00:41:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-01 00:41:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-01 00:41:04,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:04,454 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-10-01 00:41:04,454 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:04,454 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:04,454 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-10-01 00:41:04,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:04,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:04,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:04,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:04,896 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:04,897 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:04,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:05,016 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:05,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:05,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:05,288 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:05,288 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-01 00:41:05,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-01 00:41:05,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-01 00:41:05,289 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:05,289 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-10-01 00:41:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:05,998 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-01 00:41:05,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 00:41:05,998 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-10-01 00:41:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:05,999 INFO L225 Difference]: With dead ends: 149 [2018-10-01 00:41:05,999 INFO L226 Difference]: Without dead ends: 147 [2018-10-01 00:41:05,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-01 00:41:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-10-01 00:41:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-01 00:41:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-01 00:41:06,002 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-10-01 00:41:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:06,002 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-01 00:41:06,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-01 00:41:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-01 00:41:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-01 00:41:06,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:06,003 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-10-01 00:41:06,003 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:06,004 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:06,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-10-01 00:41:06,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:06,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:06,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:06,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:06,445 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:06,446 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:06,452 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:06,645 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-10-01 00:41:06,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:06,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:07,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:07,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-01 00:41:07,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 00:41:07,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 00:41:07,038 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:07,038 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-10-01 00:41:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:07,564 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-01 00:41:07,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-01 00:41:07,564 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-10-01 00:41:07,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:07,565 INFO L225 Difference]: With dead ends: 151 [2018-10-01 00:41:07,565 INFO L226 Difference]: Without dead ends: 149 [2018-10-01 00:41:07,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:07,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-01 00:41:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-10-01 00:41:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-01 00:41:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-01 00:41:07,569 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-10-01 00:41:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:07,569 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-01 00:41:07,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 00:41:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-01 00:41:07,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-01 00:41:07,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:07,570 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-10-01 00:41:07,571 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:07,571 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:07,571 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-10-01 00:41:07,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:07,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:07,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:07,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:08,060 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:08,060 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:08,068 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:08,245 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-10-01 00:41:08,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:08,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:08,567 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:08,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-01 00:41:08,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-01 00:41:08,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-01 00:41:08,569 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:08,569 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-10-01 00:41:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:08,919 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-01 00:41:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 00:41:08,920 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-10-01 00:41:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:08,921 INFO L225 Difference]: With dead ends: 153 [2018-10-01 00:41:08,921 INFO L226 Difference]: Without dead ends: 151 [2018-10-01 00:41:08,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-01 00:41:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-10-01 00:41:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-01 00:41:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-01 00:41:08,926 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-10-01 00:41:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:08,926 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-01 00:41:08,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-01 00:41:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-01 00:41:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-01 00:41:08,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:08,928 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-10-01 00:41:08,928 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:08,928 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:08,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-10-01 00:41:08,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:08,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:08,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:08,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:08,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:09,408 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:09,408 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:09,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:09,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:09,808 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:09,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-01 00:41:09,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-01 00:41:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-01 00:41:09,810 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:09,810 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-10-01 00:41:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:10,338 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-01 00:41:10,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-01 00:41:10,338 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-10-01 00:41:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:10,339 INFO L225 Difference]: With dead ends: 155 [2018-10-01 00:41:10,339 INFO L226 Difference]: Without dead ends: 153 [2018-10-01 00:41:10,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:10,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-01 00:41:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-10-01 00:41:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-01 00:41:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-01 00:41:10,342 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-10-01 00:41:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:10,342 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-01 00:41:10,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-01 00:41:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-01 00:41:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-01 00:41:10,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:10,343 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-10-01 00:41:10,343 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:10,343 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-10-01 00:41:10,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:10,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:10,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:11,198 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:11,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:11,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:11,328 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:11,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:11,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:11,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:11,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-01 00:41:11,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-01 00:41:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-01 00:41:11,723 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:11,723 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-10-01 00:41:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:12,127 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-01 00:41:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 00:41:12,128 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-10-01 00:41:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:12,129 INFO L225 Difference]: With dead ends: 157 [2018-10-01 00:41:12,129 INFO L226 Difference]: Without dead ends: 155 [2018-10-01 00:41:12,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:41:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-01 00:41:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-10-01 00:41:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-01 00:41:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-01 00:41:12,132 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-10-01 00:41:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:12,132 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-01 00:41:12,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-01 00:41:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-01 00:41:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-01 00:41:12,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:12,133 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-10-01 00:41:12,133 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:12,133 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:12,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-10-01 00:41:12,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:12,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:12,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:12,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:12,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:12,599 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:12,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:12,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:12,802 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-10-01 00:41:12,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:12,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:13,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:13,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-01 00:41:13,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-01 00:41:13,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-01 00:41:13,081 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:13,082 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-10-01 00:41:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:13,451 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-01 00:41:13,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-01 00:41:13,452 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-10-01 00:41:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:13,453 INFO L225 Difference]: With dead ends: 159 [2018-10-01 00:41:13,453 INFO L226 Difference]: Without dead ends: 157 [2018-10-01 00:41:13,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-01 00:41:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-10-01 00:41:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-01 00:41:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-01 00:41:13,456 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-10-01 00:41:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:13,456 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-01 00:41:13,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-01 00:41:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-01 00:41:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-01 00:41:13,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:13,457 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-10-01 00:41:13,458 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:13,458 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:13,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-10-01 00:41:13,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:13,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:13,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:13,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:13,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:13,945 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:13,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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:13,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:14,067 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:14,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:14,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:14,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:14,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-01 00:41:14,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-01 00:41:14,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-01 00:41:14,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:14,371 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-10-01 00:41:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:15,014 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-01 00:41:15,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 00:41:15,014 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-10-01 00:41:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:15,015 INFO L225 Difference]: With dead ends: 161 [2018-10-01 00:41:15,015 INFO L226 Difference]: Without dead ends: 159 [2018-10-01 00:41:15,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-01 00:41:15,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-10-01 00:41:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-01 00:41:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-01 00:41:15,020 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-10-01 00:41:15,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:15,020 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-01 00:41:15,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-01 00:41:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-01 00:41:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-01 00:41:15,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:15,021 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-10-01 00:41:15,022 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:15,022 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:15,022 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-10-01 00:41:15,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:15,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:15,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:15,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:15,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:15,509 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:15,509 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:15,517 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:15,719 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-10-01 00:41:15,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:15,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:16,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:16,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-01 00:41:16,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-01 00:41:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-01 00:41:16,212 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:16,212 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-10-01 00:41:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:16,834 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-01 00:41:16,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-01 00:41:16,834 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-10-01 00:41:16,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:16,835 INFO L225 Difference]: With dead ends: 163 [2018-10-01 00:41:16,835 INFO L226 Difference]: Without dead ends: 161 [2018-10-01 00:41:16,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:41:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-01 00:41:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-10-01 00:41:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-01 00:41:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-01 00:41:16,840 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-10-01 00:41:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:16,840 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-01 00:41:16,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-01 00:41:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-01 00:41:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-01 00:41:16,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:16,841 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-10-01 00:41:16,841 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:16,842 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:16,842 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-10-01 00:41:16,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:16,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:16,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:16,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:17,346 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:17,346 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:17,353 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:17,569 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-10-01 00:41:17,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:17,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:17,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:17,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-01 00:41:17,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-01 00:41:17,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-01 00:41:17,860 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:17,860 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-10-01 00:41:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:18,250 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-01 00:41:18,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 00:41:18,250 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-10-01 00:41:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:18,251 INFO L225 Difference]: With dead ends: 165 [2018-10-01 00:41:18,251 INFO L226 Difference]: Without dead ends: 163 [2018-10-01 00:41:18,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-01 00:41:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-10-01 00:41:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-01 00:41:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-01 00:41:18,255 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-10-01 00:41:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:18,255 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-01 00:41:18,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-01 00:41:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-01 00:41:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-01 00:41:18,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:18,256 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-10-01 00:41:18,257 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:18,257 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:18,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-10-01 00:41:18,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:18,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:18,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:18,763 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:18,763 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:18,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:18,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:19,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:19,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-01 00:41:19,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-01 00:41:19,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-01 00:41:19,250 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:19,250 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-10-01 00:41:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:19,790 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-01 00:41:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 00:41:19,790 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-10-01 00:41:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:19,791 INFO L225 Difference]: With dead ends: 167 [2018-10-01 00:41:19,791 INFO L226 Difference]: Without dead ends: 165 [2018-10-01 00:41:19,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-01 00:41:19,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-10-01 00:41:19,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-01 00:41:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-01 00:41:19,794 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-10-01 00:41:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:19,794 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-01 00:41:19,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-01 00:41:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-01 00:41:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-01 00:41:19,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:19,795 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-10-01 00:41:19,795 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:19,795 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:19,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-10-01 00:41:19,796 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:19,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:19,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:19,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:19,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:20,370 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:20,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:20,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:20,526 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:20,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:20,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:20,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:20,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-01 00:41:20,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-01 00:41:20,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-01 00:41:20,832 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:20,832 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-10-01 00:41:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:21,602 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-01 00:41:21,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 00:41:21,603 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-10-01 00:41:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:21,603 INFO L225 Difference]: With dead ends: 169 [2018-10-01 00:41:21,604 INFO L226 Difference]: Without dead ends: 167 [2018-10-01 00:41:21,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-01 00:41:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-10-01 00:41:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-01 00:41:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-01 00:41:21,607 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-10-01 00:41:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:21,607 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-01 00:41:21,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-01 00:41:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-01 00:41:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-01 00:41:21,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:21,608 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-10-01 00:41:21,608 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:21,608 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:21,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-10-01 00:41:21,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:21,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:21,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:21,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:21,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:22,159 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:22,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:22,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:22,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-10-01 00:41:22,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:22,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:22,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:22,787 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-01 00:41:22,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-01 00:41:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-01 00:41:22,788 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:22,788 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-10-01 00:41:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:23,333 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-01 00:41:23,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 00:41:23,333 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-10-01 00:41:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:23,334 INFO L225 Difference]: With dead ends: 171 [2018-10-01 00:41:23,334 INFO L226 Difference]: Without dead ends: 169 [2018-10-01 00:41:23,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-01 00:41:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-10-01 00:41:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-01 00:41:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-01 00:41:23,338 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-10-01 00:41:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:23,338 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-01 00:41:23,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-01 00:41:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-01 00:41:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-01 00:41:23,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:23,339 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-10-01 00:41:23,339 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:23,339 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-10-01 00:41:23,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:23,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:23,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:23,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:23,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:23,879 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:23,879 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:23,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:24,012 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:24,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:24,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:24,313 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:24,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-10-01 00:41:24,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-01 00:41:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-01 00:41:24,314 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:24,315 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-10-01 00:41:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:24,750 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-01 00:41:24,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-01 00:41:24,750 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-10-01 00:41:24,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:24,751 INFO L225 Difference]: With dead ends: 173 [2018-10-01 00:41:24,751 INFO L226 Difference]: Without dead ends: 171 [2018-10-01 00:41:24,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-01 00:41:24,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-10-01 00:41:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-01 00:41:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-01 00:41:24,754 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-10-01 00:41:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:24,754 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-01 00:41:24,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-01 00:41:24,755 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-01 00:41:24,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-01 00:41:24,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:24,755 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-10-01 00:41:24,756 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:24,756 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-10-01 00:41:24,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:24,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:24,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:24,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:24,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:25,349 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:25,349 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:25,357 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:25,576 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-10-01 00:41:25,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:25,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:25,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:25,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-10-01 00:41:25,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-01 00:41:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-01 00:41:25,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:25,885 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-10-01 00:41:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:26,466 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-01 00:41:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-01 00:41:26,466 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-10-01 00:41:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:26,467 INFO L225 Difference]: With dead ends: 175 [2018-10-01 00:41:26,467 INFO L226 Difference]: Without dead ends: 173 [2018-10-01 00:41:26,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-01 00:41:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-01 00:41:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-01 00:41:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-01 00:41:26,470 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-10-01 00:41:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:26,470 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-01 00:41:26,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-01 00:41:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-01 00:41:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-01 00:41:26,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:26,471 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-10-01 00:41:26,472 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:26,472 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-10-01 00:41:26,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:26,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:26,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:27,059 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:27,059 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:27,070 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:27,305 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-10-01 00:41:27,305 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:27,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:27,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:27,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-10-01 00:41:27,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-01 00:41:27,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-01 00:41:27,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:27,669 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-10-01 00:41:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:28,303 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-01 00:41:28,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-01 00:41:28,303 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-10-01 00:41:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:28,304 INFO L225 Difference]: With dead ends: 177 [2018-10-01 00:41:28,304 INFO L226 Difference]: Without dead ends: 175 [2018-10-01 00:41:28,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-01 00:41:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-10-01 00:41:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-01 00:41:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-01 00:41:28,309 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-10-01 00:41:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:28,310 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-01 00:41:28,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-01 00:41:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-01 00:41:28,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-01 00:41:28,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:28,311 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-10-01 00:41:28,311 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:28,311 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:28,312 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-10-01 00:41:28,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:28,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:28,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:28,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:28,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:28,916 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:28,917 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:28,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:29,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:29,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:29,386 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-10-01 00:41:29,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-01 00:41:29,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-01 00:41:29,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:29,388 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-10-01 00:41:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:29,846 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-01 00:41:29,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-01 00:41:29,847 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-10-01 00:41:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:29,848 INFO L225 Difference]: With dead ends: 179 [2018-10-01 00:41:29,848 INFO L226 Difference]: Without dead ends: 177 [2018-10-01 00:41:29,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-01 00:41:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-10-01 00:41:29,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-01 00:41:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-01 00:41:29,852 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-10-01 00:41:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:29,853 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-01 00:41:29,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-01 00:41:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-01 00:41:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-01 00:41:29,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:29,854 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-10-01 00:41:29,854 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:29,855 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-10-01 00:41:29,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:29,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:29,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:29,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:29,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:30,477 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:30,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:30,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:30,622 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:30,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:30,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:30,948 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:30,948 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-10-01 00:41:30,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-01 00:41:30,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-01 00:41:30,949 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:30,949 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-10-01 00:41:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:31,668 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-01 00:41:31,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-01 00:41:31,669 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-10-01 00:41:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:31,669 INFO L225 Difference]: With dead ends: 181 [2018-10-01 00:41:31,670 INFO L226 Difference]: Without dead ends: 179 [2018-10-01 00:41:31,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-01 00:41:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-10-01 00:41:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-01 00:41:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-01 00:41:31,673 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-10-01 00:41:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:31,673 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-01 00:41:31,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-01 00:41:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-01 00:41:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-01 00:41:31,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:31,674 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-10-01 00:41:31,674 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:31,674 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-10-01 00:41:31,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:31,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:31,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:32,261 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:32,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:32,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:32,515 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-10-01 00:41:32,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:32,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:32,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:32,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-10-01 00:41:32,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-01 00:41:32,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-01 00:41:32,838 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:32,838 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-10-01 00:41:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:33,327 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-01 00:41:33,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-01 00:41:33,327 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-10-01 00:41:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:33,328 INFO L225 Difference]: With dead ends: 183 [2018-10-01 00:41:33,328 INFO L226 Difference]: Without dead ends: 181 [2018-10-01 00:41:33,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-01 00:41:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-10-01 00:41:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-01 00:41:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-01 00:41:33,331 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-10-01 00:41:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:33,332 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-01 00:41:33,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-01 00:41:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-01 00:41:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-01 00:41:33,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:33,332 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-10-01 00:41:33,333 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:33,333 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:33,333 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-10-01 00:41:33,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:33,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:33,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:33,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:33,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:33,931 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:33,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:33,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:34,072 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:34,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:34,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:34,419 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:34,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-10-01 00:41:34,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-01 00:41:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-01 00:41:34,421 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:34,421 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-10-01 00:41:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:35,015 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-01 00:41:35,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-01 00:41:35,015 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-10-01 00:41:35,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:35,016 INFO L225 Difference]: With dead ends: 185 [2018-10-01 00:41:35,016 INFO L226 Difference]: Without dead ends: 183 [2018-10-01 00:41:35,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-01 00:41:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-01 00:41:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-01 00:41:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-01 00:41:35,020 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-10-01 00:41:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:35,020 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-01 00:41:35,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-01 00:41:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-01 00:41:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-01 00:41:35,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:35,021 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-10-01 00:41:35,021 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:35,021 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:35,022 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-10-01 00:41:35,022 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:35,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:35,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:35,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:35,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:35,651 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:35,651 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:35,658 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:35,928 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-10-01 00:41:35,928 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:35,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:36,275 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:36,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-10-01 00:41:36,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-01 00:41:36,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-01 00:41:36,276 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:36,276 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-10-01 00:41:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:36,893 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-01 00:41:36,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-01 00:41:36,893 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-10-01 00:41:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:36,894 INFO L225 Difference]: With dead ends: 187 [2018-10-01 00:41:36,894 INFO L226 Difference]: Without dead ends: 185 [2018-10-01 00:41:36,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-01 00:41:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-01 00:41:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-01 00:41:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-01 00:41:36,897 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-10-01 00:41:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:36,897 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-01 00:41:36,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-01 00:41:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-01 00:41:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-01 00:41:36,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:36,898 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-10-01 00:41:36,898 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:36,899 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:36,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-10-01 00:41:36,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:36,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:36,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:36,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:36,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:37,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:37,522 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:37,531 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:37,783 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 91 check-sat command(s) [2018-10-01 00:41:37,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:37,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:38,116 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:38,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2018-10-01 00:41:38,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-01 00:41:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-01 00:41:38,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:38,117 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-10-01 00:41:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:38,588 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-01 00:41:38,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-01 00:41:38,588 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-10-01 00:41:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:38,589 INFO L225 Difference]: With dead ends: 189 [2018-10-01 00:41:38,589 INFO L226 Difference]: Without dead ends: 187 [2018-10-01 00:41:38,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-01 00:41:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-01 00:41:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-01 00:41:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-01 00:41:38,593 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-10-01 00:41:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:38,594 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-01 00:41:38,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-01 00:41:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-01 00:41:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-01 00:41:38,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:38,595 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-10-01 00:41:38,595 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:38,595 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-10-01 00:41:38,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:38,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:38,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:38,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:39,248 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:39,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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:39,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:39,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:39,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:39,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-10-01 00:41:39,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-01 00:41:39,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-01 00:41:39,728 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:39,728 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-10-01 00:41:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:40,197 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-01 00:41:40,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-01 00:41:40,197 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-10-01 00:41:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:40,198 INFO L225 Difference]: With dead ends: 191 [2018-10-01 00:41:40,198 INFO L226 Difference]: Without dead ends: 189 [2018-10-01 00:41:40,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-01 00:41:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-10-01 00:41:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-01 00:41:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-01 00:41:40,202 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-10-01 00:41:40,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:40,202 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-01 00:41:40,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-01 00:41:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-01 00:41:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-01 00:41:40,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:40,203 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-10-01 00:41:40,204 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:40,204 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash -685070945, now seen corresponding path program 92 times [2018-10-01 00:41:40,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:40,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:40,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:40,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:40,867 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:40,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:40,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:41,017 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:41,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:41,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:41,358 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:41,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-10-01 00:41:41,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-01 00:41:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-01 00:41:41,360 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:41,360 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-10-01 00:41:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:41,995 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-01 00:41:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-01 00:41:41,995 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-10-01 00:41:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:41,996 INFO L225 Difference]: With dead ends: 193 [2018-10-01 00:41:41,996 INFO L226 Difference]: Without dead ends: 191 [2018-10-01 00:41:41,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-01 00:41:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-01 00:41:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-01 00:41:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-01 00:41:42,000 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-10-01 00:41:42,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:42,000 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-01 00:41:42,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-01 00:41:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-01 00:41:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-01 00:41:42,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:42,001 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-10-01 00:41:42,001 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:42,001 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:42,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1223129767, now seen corresponding path program 93 times [2018-10-01 00:41:42,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:42,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:42,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:42,668 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:42,668 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:42,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:42,949 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 94 check-sat command(s) [2018-10-01 00:41:42,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:42,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:43,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:43,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-10-01 00:41:43,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-01 00:41:43,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-01 00:41:43,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:43,298 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-10-01 00:41:43,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:43,946 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-01 00:41:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-01 00:41:43,946 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-10-01 00:41:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:43,947 INFO L225 Difference]: With dead ends: 195 [2018-10-01 00:41:43,947 INFO L226 Difference]: Without dead ends: 193 [2018-10-01 00:41:43,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-01 00:41:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-10-01 00:41:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-01 00:41:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-01 00:41:43,951 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-10-01 00:41:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:43,951 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-01 00:41:43,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-01 00:41:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-01 00:41:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-01 00:41:43,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:43,952 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-10-01 00:41:43,952 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:43,952 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1393385107, now seen corresponding path program 94 times [2018-10-01 00:41:43,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:43,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:43,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:44,737 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:44,737 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:44,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:44,894 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:44,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:44,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:45,306 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:45,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-10-01 00:41:45,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-01 00:41:45,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-01 00:41:45,308 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:45,308 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-10-01 00:41:45,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:45,919 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-01 00:41:45,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-01 00:41:45,919 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-10-01 00:41:45,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:45,920 INFO L225 Difference]: With dead ends: 197 [2018-10-01 00:41:45,920 INFO L226 Difference]: Without dead ends: 195 [2018-10-01 00:41:45,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:41:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-01 00:41:45,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-01 00:41:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-01 00:41:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-01 00:41:45,923 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-10-01 00:41:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:45,923 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-01 00:41:45,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-01 00:41:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-01 00:41:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-01 00:41:45,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:45,924 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-10-01 00:41:45,925 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:45,925 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash -986656435, now seen corresponding path program 95 times [2018-10-01 00:41:45,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:45,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:45,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:46,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:46,731 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:46,731 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:46,739 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:47,060 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 96 check-sat command(s) [2018-10-01 00:41:47,060 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:47,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:47,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:47,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-10-01 00:41:47,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-01 00:41:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-01 00:41:47,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:47,432 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-10-01 00:41:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:48,122 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-01 00:41:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-01 00:41:48,122 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-10-01 00:41:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:48,123 INFO L225 Difference]: With dead ends: 199 [2018-10-01 00:41:48,123 INFO L226 Difference]: Without dead ends: 197 [2018-10-01 00:41:48,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:41:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-01 00:41:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-10-01 00:41:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-01 00:41:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-01 00:41:48,127 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-10-01 00:41:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:48,127 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-01 00:41:48,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-01 00:41:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-01 00:41:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-01 00:41:48,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:48,129 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-10-01 00:41:48,129 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:48,129 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1010990471, now seen corresponding path program 96 times [2018-10-01 00:41:48,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:48,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:48,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:48,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:48,876 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:48,876 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:48,884 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:49,167 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 97 check-sat command(s) [2018-10-01 00:41:49,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:49,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:49,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:49,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-10-01 00:41:49,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-01 00:41:49,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-01 00:41:49,525 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:49,525 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-10-01 00:41:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:50,034 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-01 00:41:50,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-01 00:41:50,034 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-10-01 00:41:50,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:50,035 INFO L225 Difference]: With dead ends: 201 [2018-10-01 00:41:50,035 INFO L226 Difference]: Without dead ends: 199 [2018-10-01 00:41:50,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:41:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-01 00:41:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-10-01 00:41:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-01 00:41:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-01 00:41:50,040 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-10-01 00:41:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:50,040 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-01 00:41:50,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-01 00:41:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-01 00:41:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-01 00:41:50,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:50,041 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-10-01 00:41:50,041 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:50,041 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 899285825, now seen corresponding path program 97 times [2018-10-01 00:41:50,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:50,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:50,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:50,727 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:50,727 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:50,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:50,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:51,244 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:51,244 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-10-01 00:41:51,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-01 00:41:51,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-01 00:41:51,246 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:51,246 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-10-01 00:41:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:51,912 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-01 00:41:51,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-01 00:41:51,913 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-10-01 00:41:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:51,914 INFO L225 Difference]: With dead ends: 203 [2018-10-01 00:41:51,914 INFO L226 Difference]: Without dead ends: 201 [2018-10-01 00:41:51,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-01 00:41:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-10-01 00:41:51,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-01 00:41:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-01 00:41:51,917 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-10-01 00:41:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:51,917 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-01 00:41:51,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-01 00:41:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-01 00:41:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-01 00:41:51,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:51,918 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-10-01 00:41:51,918 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:51,919 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash 925303419, now seen corresponding path program 98 times [2018-10-01 00:41:51,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:51,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:51,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:51,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:51,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:52,646 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:52,646 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:52,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:52,806 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:52,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:52,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:53,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:53,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-10-01 00:41:53,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-01 00:41:53,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-01 00:41:53,179 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:53,179 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-10-01 00:41:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:53,767 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-01 00:41:53,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-01 00:41:53,767 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-10-01 00:41:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:53,768 INFO L225 Difference]: With dead ends: 205 [2018-10-01 00:41:53,768 INFO L226 Difference]: Without dead ends: 203 [2018-10-01 00:41:53,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:41:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-01 00:41:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-10-01 00:41:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-01 00:41:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-01 00:41:53,771 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-10-01 00:41:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:53,772 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-01 00:41:53,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-01 00:41:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-01 00:41:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-01 00:41:53,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:53,773 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-10-01 00:41:53,773 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:53,773 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:53,773 INFO L82 PathProgramCache]: Analyzing trace with hash 158407477, now seen corresponding path program 99 times [2018-10-01 00:41:53,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:53,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:53,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:53,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:53,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:54,481 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:54,482 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:54,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:54,799 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-10-01 00:41:54,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:54,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:55,182 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:55,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-10-01 00:41:55,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-01 00:41:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-01 00:41:55,183 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:55,183 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-10-01 00:41:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:55,764 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-01 00:41:55,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-01 00:41:55,764 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-10-01 00:41:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:55,765 INFO L225 Difference]: With dead ends: 207 [2018-10-01 00:41:55,765 INFO L226 Difference]: Without dead ends: 205 [2018-10-01 00:41:55,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:41:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-01 00:41:55,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-10-01 00:41:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-01 00:41:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-01 00:41:55,768 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-10-01 00:41:55,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:55,769 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-01 00:41:55,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-01 00:41:55,769 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-01 00:41:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-01 00:41:55,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:55,770 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-10-01 00:41:55,770 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:55,770 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:55,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1905782127, now seen corresponding path program 100 times [2018-10-01 00:41:55,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:55,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:55,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:55,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:55,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:56,627 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:56,627 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:56,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:56,792 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:56,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:56,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:57,348 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:57,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102] total 102 [2018-10-01 00:41:57,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-01 00:41:57,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-01 00:41:57,349 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:57,350 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-10-01 00:41:57,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:57,985 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-01 00:41:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-01 00:41:57,985 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-10-01 00:41:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:57,986 INFO L225 Difference]: With dead ends: 209 [2018-10-01 00:41:57,987 INFO L226 Difference]: Without dead ends: 207 [2018-10-01 00:41:57,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:41:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-01 00:41:57,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-10-01 00:41:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-01 00:41:57,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-01 00:41:57,991 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-10-01 00:41:57,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:57,991 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-01 00:41:57,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-01 00:41:57,991 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-01 00:41:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-01 00:41:57,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:57,993 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-10-01 00:41:57,993 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:57,993 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1800608041, now seen corresponding path program 101 times [2018-10-01 00:41:57,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:57,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:57,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:57,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:57,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:58,815 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:58,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:41:58,822 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:59,282 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 102 check-sat command(s) [2018-10-01 00:41:59,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:59,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:59,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:59,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103] total 103 [2018-10-01 00:41:59,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-01 00:41:59,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-01 00:41:59,767 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:59,768 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-10-01 00:42:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:00,642 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-01 00:42:00,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-01 00:42:00,642 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-10-01 00:42:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:00,643 INFO L225 Difference]: With dead ends: 211 [2018-10-01 00:42:00,644 INFO L226 Difference]: Without dead ends: 209 [2018-10-01 00:42:00,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:42:00,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-01 00:42:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-10-01 00:42:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-01 00:42:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-01 00:42:00,647 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-10-01 00:42:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:00,647 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-01 00:42:00,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-01 00:42:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-01 00:42:00,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-01 00:42:00,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:00,648 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-10-01 00:42:00,648 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:00,648 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:00,648 INFO L82 PathProgramCache]: Analyzing trace with hash -487440797, now seen corresponding path program 102 times [2018-10-01 00:42:00,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:00,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:00,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:00,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:00,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:01,497 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:01,497 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:01,504 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:42:01,825 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 103 check-sat command(s) [2018-10-01 00:42:01,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:01,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:02,423 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:02,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104] total 104 [2018-10-01 00:42:02,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-01 00:42:02,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-01 00:42:02,425 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:02,425 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-10-01 00:42:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:03,085 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-10-01 00:42:03,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-01 00:42:03,086 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-10-01 00:42:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:03,086 INFO L225 Difference]: With dead ends: 213 [2018-10-01 00:42:03,086 INFO L226 Difference]: Without dead ends: 211 [2018-10-01 00:42:03,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:42:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-01 00:42:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-01 00:42:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-01 00:42:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-01 00:42:03,090 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-10-01 00:42:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:03,091 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-01 00:42:03,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-01 00:42:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-01 00:42:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-01 00:42:03,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:03,092 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-10-01 00:42:03,092 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:03,093 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:03,093 INFO L82 PathProgramCache]: Analyzing trace with hash -279118563, now seen corresponding path program 103 times [2018-10-01 00:42:03,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:03,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:03,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:03,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:03,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:03,880 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:03,880 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:03,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:04,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:04,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:04,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105] total 105 [2018-10-01 00:42:04,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-01 00:42:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-01 00:42:04,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:04,452 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-10-01 00:42:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:05,069 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-01 00:42:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-01 00:42:05,069 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-10-01 00:42:05,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:05,070 INFO L225 Difference]: With dead ends: 215 [2018-10-01 00:42:05,070 INFO L226 Difference]: Without dead ends: 213 [2018-10-01 00:42:05,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:42:05,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-01 00:42:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-01 00:42:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-01 00:42:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-01 00:42:05,074 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-10-01 00:42:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:05,074 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-01 00:42:05,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-01 00:42:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-01 00:42:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-01 00:42:05,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:05,075 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-10-01 00:42:05,076 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:05,076 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1944914601, now seen corresponding path program 104 times [2018-10-01 00:42:05,076 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:05,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:05,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:05,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:05,894 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:05,894 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:05,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:42:06,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:42:06,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:06,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:06,475 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:06,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106] total 106 [2018-10-01 00:42:06,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-01 00:42:06,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-01 00:42:06,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:06,477 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-10-01 00:42:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:07,427 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-01 00:42:07,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-01 00:42:07,428 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-10-01 00:42:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:07,428 INFO L225 Difference]: With dead ends: 217 [2018-10-01 00:42:07,428 INFO L226 Difference]: Without dead ends: 215 [2018-10-01 00:42:07,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:42:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-01 00:42:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-10-01 00:42:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-01 00:42:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-01 00:42:07,432 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-10-01 00:42:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:07,433 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-01 00:42:07,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-01 00:42:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-01 00:42:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-01 00:42:07,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:07,434 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-10-01 00:42:07,434 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:07,434 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:07,434 INFO L82 PathProgramCache]: Analyzing trace with hash -752105711, now seen corresponding path program 105 times [2018-10-01 00:42:07,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:07,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:07,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:07,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:07,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:08,253 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:08,253 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:08,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:42:08,620 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 106 check-sat command(s) [2018-10-01 00:42:08,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:08,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:09,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:09,031 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107] total 107 [2018-10-01 00:42:09,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-01 00:42:09,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-01 00:42:09,032 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:09,032 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-10-01 00:42:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:10,003 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-01 00:42:10,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-01 00:42:10,003 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-10-01 00:42:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:10,004 INFO L225 Difference]: With dead ends: 219 [2018-10-01 00:42:10,004 INFO L226 Difference]: Without dead ends: 217 [2018-10-01 00:42:10,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:42:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-01 00:42:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-10-01 00:42:10,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-01 00:42:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-01 00:42:10,008 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-10-01 00:42:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:10,009 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-01 00:42:10,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-01 00:42:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-01 00:42:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-01 00:42:10,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:10,010 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-10-01 00:42:10,010 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:10,010 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:10,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1219030453, now seen corresponding path program 106 times [2018-10-01 00:42:10,010 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:10,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:10,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:10,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:10,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:10,833 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:10,833 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:10,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:42:11,006 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:42:11,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:11,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:11,399 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:11,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108] total 108 [2018-10-01 00:42:11,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-01 00:42:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-01 00:42:11,400 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:11,400 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-10-01 00:42:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:12,431 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-01 00:42:12,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-01 00:42:12,431 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-10-01 00:42:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:12,432 INFO L225 Difference]: With dead ends: 221 [2018-10-01 00:42:12,432 INFO L226 Difference]: Without dead ends: 219 [2018-10-01 00:42:12,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:42:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-01 00:42:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-10-01 00:42:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-01 00:42:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-01 00:42:12,436 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-10-01 00:42:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:12,436 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-01 00:42:12,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-01 00:42:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-01 00:42:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-01 00:42:12,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:12,437 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-10-01 00:42:12,438 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:12,438 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:12,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1037858565, now seen corresponding path program 107 times [2018-10-01 00:42:12,438 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:12,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:12,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:12,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:12,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:13,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:13,251 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:13,259 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:42:13,593 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 108 check-sat command(s) [2018-10-01 00:42:13,594 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:13,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:13,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:13,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109] total 109 [2018-10-01 00:42:13,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-01 00:42:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-01 00:42:13,995 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:13,995 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-10-01 00:42:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:14,633 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-01 00:42:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-01 00:42:14,633 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-10-01 00:42:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:14,634 INFO L225 Difference]: With dead ends: 223 [2018-10-01 00:42:14,634 INFO L226 Difference]: Without dead ends: 221 [2018-10-01 00:42:14,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:42:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-01 00:42:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-10-01 00:42:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-01 00:42:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-01 00:42:14,638 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-10-01 00:42:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:14,638 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-01 00:42:14,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-01 00:42:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-01 00:42:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-01 00:42:14,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:14,639 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-10-01 00:42:14,640 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:14,640 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:14,640 INFO L82 PathProgramCache]: Analyzing trace with hash 949720383, now seen corresponding path program 108 times [2018-10-01 00:42:14,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:14,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:14,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:14,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:14,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:15,513 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:15,514 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:15,520 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:42:15,848 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 109 check-sat command(s) [2018-10-01 00:42:15,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:15,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:16,245 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:16,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110] total 110 [2018-10-01 00:42:16,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-01 00:42:16,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-01 00:42:16,247 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:16,247 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-10-01 00:42:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:17,082 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-01 00:42:17,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-01 00:42:17,082 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-10-01 00:42:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:17,083 INFO L225 Difference]: With dead ends: 225 [2018-10-01 00:42:17,083 INFO L226 Difference]: Without dead ends: 223 [2018-10-01 00:42:17,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:42:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-01 00:42:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-10-01 00:42:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-01 00:42:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-01 00:42:17,086 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-10-01 00:42:17,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:17,087 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-01 00:42:17,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-01 00:42:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-01 00:42:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-01 00:42:17,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:17,087 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-10-01 00:42:17,088 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:17,088 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:17,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2146693895, now seen corresponding path program 109 times [2018-10-01 00:42:17,088 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:17,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:17,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:17,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:17,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:18,083 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:18,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:18,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:18,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:18,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:18,671 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111] total 111 [2018-10-01 00:42:18,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-01 00:42:18,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-01 00:42:18,672 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:18,672 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-10-01 00:42:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:19,633 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-01 00:42:19,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-01 00:42:19,633 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-10-01 00:42:19,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:19,634 INFO L225 Difference]: With dead ends: 227 [2018-10-01 00:42:19,634 INFO L226 Difference]: Without dead ends: 225 [2018-10-01 00:42:19,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:42:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-01 00:42:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-10-01 00:42:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-01 00:42:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-01 00:42:19,638 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-10-01 00:42:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:19,638 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-01 00:42:19,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-01 00:42:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-01 00:42:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-01 00:42:19,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:19,639 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-10-01 00:42:19,639 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:19,639 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:19,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1388478925, now seen corresponding path program 110 times [2018-10-01 00:42:19,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:19,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:19,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:19,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:19,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:20,562 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:20,562 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:20,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:42:20,749 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:42:20,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:20,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:21,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:21,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112] total 112 [2018-10-01 00:42:21,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-01 00:42:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-01 00:42:21,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:21,176 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-10-01 00:42:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:22,234 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-01 00:42:22,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-01 00:42:22,234 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-10-01 00:42:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:22,235 INFO L225 Difference]: With dead ends: 229 [2018-10-01 00:42:22,235 INFO L226 Difference]: Without dead ends: 227 [2018-10-01 00:42:22,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:42:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-01 00:42:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-10-01 00:42:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-01 00:42:22,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-01 00:42:22,237 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-10-01 00:42:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:22,238 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-01 00:42:22,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-01 00:42:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-01 00:42:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-01 00:42:22,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:22,238 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-10-01 00:42:22,239 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:22,239 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:22,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1406634221, now seen corresponding path program 111 times [2018-10-01 00:42:22,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:22,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:22,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:22,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:22,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:23,305 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:23,305 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:23,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:42:23,698 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 112 check-sat command(s) [2018-10-01 00:42:23,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:23,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:24,129 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:24,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113] total 113 [2018-10-01 00:42:24,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-01 00:42:24,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-01 00:42:24,130 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:24,131 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-10-01 00:42:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:25,107 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-01 00:42:25,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-01 00:42:25,107 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-10-01 00:42:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:25,108 INFO L225 Difference]: With dead ends: 231 [2018-10-01 00:42:25,108 INFO L226 Difference]: Without dead ends: 229 [2018-10-01 00:42:25,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:42:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-01 00:42:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-10-01 00:42:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-01 00:42:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-01 00:42:25,112 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-10-01 00:42:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:25,112 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-01 00:42:25,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-01 00:42:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-01 00:42:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-01 00:42:25,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:25,113 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-10-01 00:42:25,113 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:25,114 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:25,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1139159769, now seen corresponding path program 112 times [2018-10-01 00:42:25,114 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:25,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:25,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:26,061 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:26,061 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:26,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:42:26,243 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:42:26,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:26,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:26,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:26,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114] total 114 [2018-10-01 00:42:26,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-01 00:42:26,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-01 00:42:26,843 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:26,843 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-10-01 00:42:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:27,857 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-01 00:42:27,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-01 00:42:27,857 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-10-01 00:42:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:27,858 INFO L225 Difference]: With dead ends: 233 [2018-10-01 00:42:27,858 INFO L226 Difference]: Without dead ends: 231 [2018-10-01 00:42:27,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:42:27,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-01 00:42:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-01 00:42:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-01 00:42:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-01 00:42:27,861 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-10-01 00:42:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:27,861 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-01 00:42:27,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-01 00:42:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-01 00:42:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-01 00:42:27,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:27,862 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-10-01 00:42:27,862 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:27,862 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:27,862 INFO L82 PathProgramCache]: Analyzing trace with hash 484174561, now seen corresponding path program 113 times [2018-10-01 00:42:27,862 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:27,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:27,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:27,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:27,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:28,807 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:28,807 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:28,815 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:42:29,233 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 114 check-sat command(s) [2018-10-01 00:42:29,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:29,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:29,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:29,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115] total 115 [2018-10-01 00:42:29,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-01 00:42:29,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-01 00:42:29,662 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:29,663 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-10-01 00:42:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:30,632 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-01 00:42:30,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-01 00:42:30,632 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-10-01 00:42:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:30,633 INFO L225 Difference]: With dead ends: 235 [2018-10-01 00:42:30,633 INFO L226 Difference]: Without dead ends: 233 [2018-10-01 00:42:30,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:42:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-01 00:42:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-10-01 00:42:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-01 00:42:30,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-01 00:42:30,636 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-10-01 00:42:30,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:30,637 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-01 00:42:30,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-01 00:42:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-01 00:42:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-01 00:42:30,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:30,637 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-10-01 00:42:30,638 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:30,638 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1435337243, now seen corresponding path program 114 times [2018-10-01 00:42:30,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:30,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:30,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:30,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:30,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:31,599 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:31,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:31,607 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:42:31,991 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 115 check-sat command(s) [2018-10-01 00:42:31,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:31,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:32,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:32,430 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116] total 116 [2018-10-01 00:42:32,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-01 00:42:32,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-01 00:42:32,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:32,432 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-10-01 00:42:33,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:33,698 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-10-01 00:42:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-01 00:42:33,698 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-10-01 00:42:33,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:33,699 INFO L225 Difference]: With dead ends: 237 [2018-10-01 00:42:33,699 INFO L226 Difference]: Without dead ends: 235 [2018-10-01 00:42:33,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:42:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-01 00:42:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-01 00:42:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-01 00:42:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-01 00:42:33,702 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-10-01 00:42:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:33,702 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-01 00:42:33,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-01 00:42:33,703 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-01 00:42:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-01 00:42:33,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:33,703 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-10-01 00:42:33,703 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:33,703 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:33,704 INFO L82 PathProgramCache]: Analyzing trace with hash 674640597, now seen corresponding path program 115 times [2018-10-01 00:42:33,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:33,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:33,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:33,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:34,644 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:34,645 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:34,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:34,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:35,266 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:35,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:35,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117] total 117 [2018-10-01 00:42:35,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-01 00:42:35,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-01 00:42:35,288 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:35,288 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-10-01 00:42:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:36,375 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-01 00:42:36,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-01 00:42:36,376 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-10-01 00:42:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:36,376 INFO L225 Difference]: With dead ends: 239 [2018-10-01 00:42:36,377 INFO L226 Difference]: Without dead ends: 237 [2018-10-01 00:42:36,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:42:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-01 00:42:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-01 00:42:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-01 00:42:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-01 00:42:36,381 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-10-01 00:42:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:36,382 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-01 00:42:36,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-01 00:42:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-01 00:42:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-01 00:42:36,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:36,383 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-10-01 00:42:36,383 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:36,383 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:36,383 INFO L82 PathProgramCache]: Analyzing trace with hash -210395889, now seen corresponding path program 116 times [2018-10-01 00:42:36,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:36,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:36,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:36,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:36,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:37,359 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:37,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:37,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:42:37,559 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:42:37,559 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:37,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:38,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:38,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118] total 118 [2018-10-01 00:42:38,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-01 00:42:38,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-01 00:42:38,243 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:38,243 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-10-01 00:42:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:39,435 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-01 00:42:39,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-01 00:42:39,435 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-10-01 00:42:39,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:39,436 INFO L225 Difference]: With dead ends: 241 [2018-10-01 00:42:39,436 INFO L226 Difference]: Without dead ends: 239 [2018-10-01 00:42:39,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:42:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-01 00:42:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-01 00:42:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-01 00:42:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-10-01 00:42:39,440 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-10-01 00:42:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:39,440 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-10-01 00:42:39,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-01 00:42:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-10-01 00:42:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-01 00:42:39,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:39,441 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-10-01 00:42:39,441 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:39,441 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:39,441 INFO L82 PathProgramCache]: Analyzing trace with hash -326934327, now seen corresponding path program 117 times [2018-10-01 00:42:39,441 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:39,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:40,410 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:40,410 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:40,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:42:40,821 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 118 check-sat command(s) [2018-10-01 00:42:40,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:40,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:41,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:41,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119] total 119 [2018-10-01 00:42:41,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-01 00:42:41,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-01 00:42:41,265 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:41,265 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-10-01 00:42:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:42,094 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-01 00:42:42,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-01 00:42:42,095 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-10-01 00:42:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:42,095 INFO L225 Difference]: With dead ends: 243 [2018-10-01 00:42:42,095 INFO L226 Difference]: Without dead ends: 241 [2018-10-01 00:42:42,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:42:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-01 00:42:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-10-01 00:42:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-01 00:42:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-01 00:42:42,098 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-10-01 00:42:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:42,098 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-01 00:42:42,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-01 00:42:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-01 00:42:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-01 00:42:42,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:42,099 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-10-01 00:42:42,099 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:42,100 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:42,100 INFO L82 PathProgramCache]: Analyzing trace with hash -651223549, now seen corresponding path program 118 times [2018-10-01 00:42:42,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:42,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:42,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:42,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:42,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:43,186 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:43,186 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:42:43,383 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:42:43,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:43,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:43,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:43,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120] total 120 [2018-10-01 00:42:43,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-01 00:42:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-01 00:42:43,841 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:43,842 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-10-01 00:42:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:44,985 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-01 00:42:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-01 00:42:44,986 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-10-01 00:42:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:44,987 INFO L225 Difference]: With dead ends: 245 [2018-10-01 00:42:44,987 INFO L226 Difference]: Without dead ends: 243 [2018-10-01 00:42:44,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:42:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-01 00:42:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-10-01 00:42:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-01 00:42:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-01 00:42:44,990 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-10-01 00:42:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:44,990 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-01 00:42:44,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-01 00:42:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-01 00:42:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-01 00:42:44,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:44,991 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-10-01 00:42:44,991 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:44,991 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1239446717, now seen corresponding path program 119 times [2018-10-01 00:42:44,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:44,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:44,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:45,977 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:45,977 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:45,984 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:42:46,428 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 120 check-sat command(s) [2018-10-01 00:42:46,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:46,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:46,901 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:46,901 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121] total 121 [2018-10-01 00:42:46,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-01 00:42:46,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-01 00:42:46,903 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:46,903 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-10-01 00:42:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:47,778 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-01 00:42:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-01 00:42:47,779 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-10-01 00:42:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:47,779 INFO L225 Difference]: With dead ends: 247 [2018-10-01 00:42:47,779 INFO L226 Difference]: Without dead ends: 245 [2018-10-01 00:42:47,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:42:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-01 00:42:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-10-01 00:42:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-01 00:42:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-01 00:42:47,784 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-10-01 00:42:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:47,784 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-01 00:42:47,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-01 00:42:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-01 00:42:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-01 00:42:47,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:47,785 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-10-01 00:42:47,786 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:47,786 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:47,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1402406135, now seen corresponding path program 120 times [2018-10-01 00:42:47,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:47,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:47,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:47,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:47,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:48,857 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:48,857 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:48,868 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:42:49,274 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 121 check-sat command(s) [2018-10-01 00:42:49,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:49,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:49,725 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:49,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122, 122] total 122 [2018-10-01 00:42:49,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-01 00:42:49,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-01 00:42:49,726 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:49,726 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-10-01 00:42:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:50,863 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-01 00:42:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-01 00:42:50,864 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-10-01 00:42:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:50,864 INFO L225 Difference]: With dead ends: 249 [2018-10-01 00:42:50,864 INFO L226 Difference]: Without dead ends: 247 [2018-10-01 00:42:50,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:42:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-01 00:42:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-10-01 00:42:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-01 00:42:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-01 00:42:50,867 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-10-01 00:42:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:50,867 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-01 00:42:50,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-01 00:42:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-01 00:42:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-01 00:42:50,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:50,868 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-10-01 00:42:50,868 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:50,868 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:50,868 INFO L82 PathProgramCache]: Analyzing trace with hash -907383119, now seen corresponding path program 121 times [2018-10-01 00:42:50,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:50,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:50,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:51,816 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:51,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:51,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:52,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:52,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:52,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123] total 123 [2018-10-01 00:42:52,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-01 00:42:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-01 00:42:52,535 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:52,535 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-10-01 00:42:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:53,434 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-01 00:42:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-01 00:42:53,442 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-10-01 00:42:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:53,442 INFO L225 Difference]: With dead ends: 251 [2018-10-01 00:42:53,443 INFO L226 Difference]: Without dead ends: 249 [2018-10-01 00:42:53,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:42:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-01 00:42:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-10-01 00:42:53,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-01 00:42:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-01 00:42:53,447 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-10-01 00:42:53,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:53,447 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-01 00:42:53,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-01 00:42:53,447 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-01 00:42:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-01 00:42:53,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:53,448 INFO L375 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-10-01 00:42:53,449 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:53,449 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash -116764181, now seen corresponding path program 122 times [2018-10-01 00:42:53,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:53,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:42:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:54,441 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:54,441 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:54,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:42:54,633 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:42:54,633 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:54,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:55,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:55,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124] total 124 [2018-10-01 00:42:55,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-01 00:42:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-01 00:42:55,095 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:55,095 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-10-01 00:42:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:56,389 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-01 00:42:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-01 00:42:56,389 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-10-01 00:42:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:56,390 INFO L225 Difference]: With dead ends: 253 [2018-10-01 00:42:56,390 INFO L226 Difference]: Without dead ends: 251 [2018-10-01 00:42:56,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:42:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-01 00:42:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-10-01 00:42:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-01 00:42:56,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-01 00:42:56,393 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-10-01 00:42:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:56,394 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-01 00:42:56,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-01 00:42:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-01 00:42:56,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-01 00:42:56,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:56,395 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-10-01 00:42:56,395 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:56,395 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:56,395 INFO L82 PathProgramCache]: Analyzing trace with hash -541176155, now seen corresponding path program 123 times [2018-10-01 00:42:56,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:56,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:56,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:56,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:56,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:57,403 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:57,403 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:42:57,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:42:57,847 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 124 check-sat command(s) [2018-10-01 00:42:57,847 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:42:57,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:42:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:58,516 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:42:58,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125] total 125 [2018-10-01 00:42:58,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-01 00:42:58,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-01 00:42:58,518 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:42:58,518 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-10-01 00:42:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:59,675 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-01 00:42:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-01 00:42:59,675 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-10-01 00:42:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:59,676 INFO L225 Difference]: With dead ends: 255 [2018-10-01 00:42:59,676 INFO L226 Difference]: Without dead ends: 253 [2018-10-01 00:42:59,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:42:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-01 00:42:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-10-01 00:42:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-01 00:42:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-01 00:42:59,679 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-10-01 00:42:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:59,680 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-01 00:42:59,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-01 00:42:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-01 00:42:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-01 00:42:59,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:59,680 INFO L375 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-10-01 00:42:59,681 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:59,681 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash -379190049, now seen corresponding path program 124 times [2018-10-01 00:42:59,681 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:59,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:59,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:59,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:00,730 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:00,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:00,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:43:00,937 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:43:00,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:00,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:01,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:01,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126, 126] total 126 [2018-10-01 00:43:01,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-01 00:43:01,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-01 00:43:01,431 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:01,431 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-10-01 00:43:02,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:02,891 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-01 00:43:02,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-01 00:43:02,892 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-10-01 00:43:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:02,892 INFO L225 Difference]: With dead ends: 257 [2018-10-01 00:43:02,892 INFO L226 Difference]: Without dead ends: 255 [2018-10-01 00:43:02,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:43:02,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-01 00:43:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-01 00:43:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-01 00:43:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-01 00:43:02,896 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-10-01 00:43:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:02,896 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-01 00:43:02,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-01 00:43:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-01 00:43:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-01 00:43:02,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:02,897 INFO L375 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-10-01 00:43:02,897 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:02,897 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash 670635161, now seen corresponding path program 125 times [2018-10-01 00:43:02,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:02,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:02,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:02,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:02,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:04,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:04,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:04,264 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:43:04,730 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 126 check-sat command(s) [2018-10-01 00:43:04,730 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:04,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:05,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:05,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127] total 127 [2018-10-01 00:43:05,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-01 00:43:05,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-01 00:43:05,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:05,223 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-10-01 00:43:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:06,407 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-01 00:43:06,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-01 00:43:06,408 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-10-01 00:43:06,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:06,408 INFO L225 Difference]: With dead ends: 259 [2018-10-01 00:43:06,408 INFO L226 Difference]: Without dead ends: 257 [2018-10-01 00:43:06,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:43:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-01 00:43:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-10-01 00:43:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-01 00:43:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-01 00:43:06,412 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-10-01 00:43:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:06,413 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-01 00:43:06,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-01 00:43:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-01 00:43:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-01 00:43:06,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:06,414 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-10-01 00:43:06,414 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:06,414 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:06,415 INFO L82 PathProgramCache]: Analyzing trace with hash 235347411, now seen corresponding path program 126 times [2018-10-01 00:43:06,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:06,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:06,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:06,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:07,479 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:07,479 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:07,486 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:43:07,919 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 127 check-sat command(s) [2018-10-01 00:43:07,919 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:07,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:08,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:08,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128] total 128 [2018-10-01 00:43:08,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-01 00:43:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-01 00:43:08,397 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:08,397 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-10-01 00:43:09,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:09,688 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-01 00:43:09,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-01 00:43:09,688 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-10-01 00:43:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:09,689 INFO L225 Difference]: With dead ends: 261 [2018-10-01 00:43:09,689 INFO L226 Difference]: Without dead ends: 259 [2018-10-01 00:43:09,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:43:09,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-01 00:43:09,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-10-01 00:43:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-01 00:43:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-01 00:43:09,692 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-10-01 00:43:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:09,693 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-01 00:43:09,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-01 00:43:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-01 00:43:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-01 00:43:09,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:09,693 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-10-01 00:43:09,694 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:09,694 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:09,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1464352627, now seen corresponding path program 127 times [2018-10-01 00:43:09,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:09,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:09,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:10,834 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:10,834 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:10,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:11,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:11,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:11,518 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129] total 129 [2018-10-01 00:43:11,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-01 00:43:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-01 00:43:11,520 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:11,520 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-10-01 00:43:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:12,688 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-01 00:43:12,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-01 00:43:12,688 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-10-01 00:43:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:12,689 INFO L225 Difference]: With dead ends: 263 [2018-10-01 00:43:12,689 INFO L226 Difference]: Without dead ends: 261 [2018-10-01 00:43:12,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:43:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-01 00:43:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-10-01 00:43:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-01 00:43:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-01 00:43:12,693 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-10-01 00:43:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:12,694 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-01 00:43:12,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-01 00:43:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-01 00:43:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-01 00:43:12,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:12,695 INFO L375 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-10-01 00:43:12,695 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:12,695 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1506450631, now seen corresponding path program 128 times [2018-10-01 00:43:12,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:12,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:12,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:12,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:12,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:13,990 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:13,990 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:13,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:43:14,206 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:43:14,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:14,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:14,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:14,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130, 130] total 130 [2018-10-01 00:43:14,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-01 00:43:14,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-01 00:43:14,710 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:14,710 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-10-01 00:43:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:16,281 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-01 00:43:16,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-01 00:43:16,281 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-10-01 00:43:16,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:16,282 INFO L225 Difference]: With dead ends: 265 [2018-10-01 00:43:16,282 INFO L226 Difference]: Without dead ends: 263 [2018-10-01 00:43:16,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:43:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-01 00:43:16,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-10-01 00:43:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-01 00:43:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-01 00:43:16,286 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-10-01 00:43:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:16,287 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-01 00:43:16,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-01 00:43:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-01 00:43:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-01 00:43:16,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:16,288 INFO L375 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-10-01 00:43:16,288 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:16,288 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash 295129729, now seen corresponding path program 129 times [2018-10-01 00:43:16,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:16,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:16,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:16,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:16,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:17,497 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:17,497 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:17,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:43:18,019 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 130 check-sat command(s) [2018-10-01 00:43:18,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:18,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:18,525 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:18,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131] total 131 [2018-10-01 00:43:18,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-01 00:43:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-01 00:43:18,527 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:18,527 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-10-01 00:43:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:20,038 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-01 00:43:20,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-01 00:43:20,038 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-10-01 00:43:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:20,039 INFO L225 Difference]: With dead ends: 267 [2018-10-01 00:43:20,039 INFO L226 Difference]: Without dead ends: 265 [2018-10-01 00:43:20,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:43:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-01 00:43:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-10-01 00:43:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-01 00:43:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-01 00:43:20,042 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-10-01 00:43:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:20,042 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-01 00:43:20,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-01 00:43:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-01 00:43:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-01 00:43:20,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:20,043 INFO L375 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-10-01 00:43:20,044 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:20,044 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:20,044 INFO L82 PathProgramCache]: Analyzing trace with hash 151880123, now seen corresponding path program 130 times [2018-10-01 00:43:20,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:20,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:20,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:20,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:20,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:21,198 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:21,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:21,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:43:21,417 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:43:21,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:21,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:21,935 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:21,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132] total 132 [2018-10-01 00:43:21,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-01 00:43:21,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-01 00:43:21,937 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:21,937 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-10-01 00:43:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:23,523 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-01 00:43:23,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-01 00:43:23,523 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-10-01 00:43:23,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:23,524 INFO L225 Difference]: With dead ends: 269 [2018-10-01 00:43:23,524 INFO L226 Difference]: Without dead ends: 267 [2018-10-01 00:43:23,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:43:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-01 00:43:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-01 00:43:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-01 00:43:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-01 00:43:23,528 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-10-01 00:43:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:23,528 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-01 00:43:23,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-01 00:43:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-01 00:43:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-01 00:43:23,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:23,529 INFO L375 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-10-01 00:43:23,529 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:23,529 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash -72037771, now seen corresponding path program 131 times [2018-10-01 00:43:23,530 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:23,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:23,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:24,883 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:24,883 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:24,891 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:43:25,361 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 132 check-sat command(s) [2018-10-01 00:43:25,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:25,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:25,867 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:25,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133] total 133 [2018-10-01 00:43:25,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-01 00:43:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-01 00:43:25,869 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:25,869 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-10-01 00:43:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:26,775 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-01 00:43:26,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-01 00:43:26,775 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-10-01 00:43:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:26,776 INFO L225 Difference]: With dead ends: 271 [2018-10-01 00:43:26,776 INFO L226 Difference]: Without dead ends: 269 [2018-10-01 00:43:26,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:43:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-01 00:43:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-10-01 00:43:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-01 00:43:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-01 00:43:26,779 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-10-01 00:43:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:26,779 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-01 00:43:26,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-01 00:43:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-01 00:43:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-01 00:43:26,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:26,780 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-10-01 00:43:26,781 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:26,781 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash -508769105, now seen corresponding path program 132 times [2018-10-01 00:43:26,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:26,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:26,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:26,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:27,909 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:27,910 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:27,916 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:43:28,413 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 133 check-sat command(s) [2018-10-01 00:43:28,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:28,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:28,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:28,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 134] total 134 [2018-10-01 00:43:28,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-01 00:43:28,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-01 00:43:28,945 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:28,946 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-10-01 00:43:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:30,796 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-10-01 00:43:30,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-01 00:43:30,796 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-10-01 00:43:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:30,797 INFO L225 Difference]: With dead ends: 273 [2018-10-01 00:43:30,797 INFO L226 Difference]: Without dead ends: 271 [2018-10-01 00:43:30,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:43:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-01 00:43:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-10-01 00:43:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-01 00:43:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-01 00:43:30,801 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-10-01 00:43:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:30,801 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-01 00:43:30,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-01 00:43:30,801 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-01 00:43:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-01 00:43:30,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:30,802 INFO L375 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-10-01 00:43:30,802 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:30,802 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:30,802 INFO L82 PathProgramCache]: Analyzing trace with hash 699213929, now seen corresponding path program 133 times [2018-10-01 00:43:30,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:30,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:30,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:30,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:30,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:32,040 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:32,040 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:32,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:32,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:32,796 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:32,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135] total 135 [2018-10-01 00:43:32,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-01 00:43:32,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-01 00:43:32,799 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:32,799 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-10-01 00:43:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:34,142 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-01 00:43:34,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-01 00:43:34,143 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-10-01 00:43:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:34,143 INFO L225 Difference]: With dead ends: 275 [2018-10-01 00:43:34,143 INFO L226 Difference]: Without dead ends: 273 [2018-10-01 00:43:34,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:43:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-01 00:43:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-10-01 00:43:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-01 00:43:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-01 00:43:34,148 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-10-01 00:43:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:34,148 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-01 00:43:34,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-01 00:43:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-01 00:43:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-01 00:43:34,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:34,149 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-10-01 00:43:34,149 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:34,149 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:34,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1929739683, now seen corresponding path program 134 times [2018-10-01 00:43:34,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:34,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:34,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:34,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:34,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:35,293 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:35,293 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:35,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:43:35,509 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:43:35,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:35,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:36,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:36,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:36,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136] total 136 [2018-10-01 00:43:36,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-01 00:43:36,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-01 00:43:36,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:36,022 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-10-01 00:43:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:37,748 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-01 00:43:37,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-01 00:43:37,748 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-10-01 00:43:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:37,749 INFO L225 Difference]: With dead ends: 277 [2018-10-01 00:43:37,749 INFO L226 Difference]: Without dead ends: 275 [2018-10-01 00:43:37,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:43:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-01 00:43:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-10-01 00:43:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-01 00:43:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-01 00:43:37,754 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-10-01 00:43:37,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:37,754 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-01 00:43:37,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-01 00:43:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-01 00:43:37,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-01 00:43:37,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:37,756 INFO L375 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-10-01 00:43:37,756 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:37,756 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:37,756 INFO L82 PathProgramCache]: Analyzing trace with hash -945984419, now seen corresponding path program 135 times [2018-10-01 00:43:37,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:37,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:37,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:37,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:37,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:39,058 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:39,058 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:39,064 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:43:39,591 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2018-10-01 00:43:39,591 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:39,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:40,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:40,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137] total 137 [2018-10-01 00:43:40,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-01 00:43:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-01 00:43:40,106 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:40,106 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-10-01 00:43:41,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:41,132 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-01 00:43:41,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-01 00:43:41,132 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-10-01 00:43:41,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:41,133 INFO L225 Difference]: With dead ends: 279 [2018-10-01 00:43:41,133 INFO L226 Difference]: Without dead ends: 277 [2018-10-01 00:43:41,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:43:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-01 00:43:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-10-01 00:43:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-01 00:43:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-01 00:43:41,136 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-10-01 00:43:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:41,136 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-01 00:43:41,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-01 00:43:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-01 00:43:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-01 00:43:41,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:41,137 INFO L375 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-10-01 00:43:41,138 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:41,138 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:41,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1442092183, now seen corresponding path program 136 times [2018-10-01 00:43:41,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:41,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:41,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:41,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:42,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:42,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:42,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:43:42,547 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:43:42,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:42,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:43,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:43,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138, 138] total 138 [2018-10-01 00:43:43,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-01 00:43:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-01 00:43:43,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:43,074 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 139 states. [2018-10-01 00:43:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:44,703 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-01 00:43:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-01 00:43:44,703 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 276 [2018-10-01 00:43:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:44,704 INFO L225 Difference]: With dead ends: 281 [2018-10-01 00:43:44,704 INFO L226 Difference]: Without dead ends: 279 [2018-10-01 00:43:44,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:43:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-01 00:43:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-01 00:43:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-01 00:43:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-01 00:43:44,707 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-10-01 00:43:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:44,707 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-01 00:43:44,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-01 00:43:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-01 00:43:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-01 00:43:44,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:44,708 INFO L375 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1] [2018-10-01 00:43:44,708 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:44,709 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1423796655, now seen corresponding path program 137 times [2018-10-01 00:43:44,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:44,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:44,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:44,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:45,973 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:45,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:45,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:43:46,518 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 138 check-sat command(s) [2018-10-01 00:43:46,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:46,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:47,063 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:47,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139] total 139 [2018-10-01 00:43:47,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-01 00:43:47,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-01 00:43:47,065 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:47,065 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 140 states. [2018-10-01 00:43:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:49,003 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-01 00:43:49,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-01 00:43:49,003 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-10-01 00:43:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:49,004 INFO L225 Difference]: With dead ends: 283 [2018-10-01 00:43:49,004 INFO L226 Difference]: Without dead ends: 281 [2018-10-01 00:43:49,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:43:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-01 00:43:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-10-01 00:43:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-01 00:43:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-01 00:43:49,008 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-10-01 00:43:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:49,008 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-01 00:43:49,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-01 00:43:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-01 00:43:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-01 00:43:49,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:49,009 INFO L375 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1] [2018-10-01 00:43:49,009 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:49,009 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:49,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1826034059, now seen corresponding path program 138 times [2018-10-01 00:43:49,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:49,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:49,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:49,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:49,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:50,491 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:50,491 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:50,498 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:43:51,039 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 139 check-sat command(s) [2018-10-01 00:43:51,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:51,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:51,587 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:51,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140] total 140 [2018-10-01 00:43:51,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-01 00:43:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-01 00:43:51,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:51,590 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 141 states. [2018-10-01 00:43:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:53,006 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-10-01 00:43:53,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-01 00:43:53,006 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 280 [2018-10-01 00:43:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:53,007 INFO L225 Difference]: With dead ends: 285 [2018-10-01 00:43:53,007 INFO L226 Difference]: Without dead ends: 283 [2018-10-01 00:43:53,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:43:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-01 00:43:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-10-01 00:43:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-01 00:43:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-01 00:43:53,011 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-10-01 00:43:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:53,011 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-01 00:43:53,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-01 00:43:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-01 00:43:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-01 00:43:53,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:53,013 INFO L375 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1] [2018-10-01 00:43:53,013 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:53,013 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1822841275, now seen corresponding path program 139 times [2018-10-01 00:43:53,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:53,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:53,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:53,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:54,328 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:54,328 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:54,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:54,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:55,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:55,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141] total 141 [2018-10-01 00:43:55,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-01 00:43:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-01 00:43:55,253 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:55,253 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 142 states. [2018-10-01 00:43:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:56,318 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-01 00:43:56,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-10-01 00:43:56,318 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-10-01 00:43:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:56,319 INFO L225 Difference]: With dead ends: 287 [2018-10-01 00:43:56,319 INFO L226 Difference]: Without dead ends: 285 [2018-10-01 00:43:56,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:43:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-01 00:43:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-10-01 00:43:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-01 00:43:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-01 00:43:56,323 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-10-01 00:43:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:56,323 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-01 00:43:56,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-01 00:43:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-01 00:43:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-01 00:43:56,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:56,324 INFO L375 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1] [2018-10-01 00:43:56,324 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:56,324 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash 596243583, now seen corresponding path program 140 times [2018-10-01 00:43:56,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:56,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:56,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:43:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:57,587 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:57,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 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:43:57,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:43:57,809 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:43:57,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:57,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:58,401 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:58,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142, 142] total 142 [2018-10-01 00:43:58,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-01 00:43:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-01 00:43:58,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:58,403 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 143 states. [2018-10-01 00:43:59,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:59,445 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-01 00:43:59,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-01 00:43:59,445 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 284 [2018-10-01 00:43:59,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:59,446 INFO L225 Difference]: With dead ends: 289 [2018-10-01 00:43:59,446 INFO L226 Difference]: Without dead ends: 287 [2018-10-01 00:43:59,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:43:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-01 00:43:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-10-01 00:43:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-01 00:43:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-01 00:43:59,451 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-10-01 00:43:59,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:59,451 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-01 00:43:59,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-01 00:43:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-01 00:43:59,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-01 00:43:59,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:59,452 INFO L375 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1] [2018-10-01 00:43:59,452 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:59,453 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:59,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1759484985, now seen corresponding path program 141 times [2018-10-01 00:43:59,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:59,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:59,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:59,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:59,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:00,702 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:00,702 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:00,702 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:00,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:44:01,271 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 142 check-sat command(s) [2018-10-01 00:44:01,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:01,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:01,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:01,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143] total 143 [2018-10-01 00:44:01,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-01 00:44:01,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-01 00:44:01,802 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:01,803 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 144 states. [2018-10-01 00:44:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:02,990 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-01 00:44:02,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-01 00:44:02,990 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-10-01 00:44:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:02,991 INFO L225 Difference]: With dead ends: 291 [2018-10-01 00:44:02,991 INFO L226 Difference]: Without dead ends: 289 [2018-10-01 00:44:02,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:44:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-01 00:44:02,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-10-01 00:44:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-01 00:44:02,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-01 00:44:02,995 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2018-10-01 00:44:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:02,995 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-01 00:44:02,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-01 00:44:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-01 00:44:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-01 00:44:02,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:02,996 INFO L375 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1] [2018-10-01 00:44:02,996 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:02,996 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1351991949, now seen corresponding path program 142 times [2018-10-01 00:44:02,997 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:02,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:02,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:04,310 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:04,310 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:04,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:44:04,549 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:44:04,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:04,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:05,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:05,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144, 144] total 144 [2018-10-01 00:44:05,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-01 00:44:05,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-01 00:44:05,397 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:05,397 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 145 states. [2018-10-01 00:44:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:06,591 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-01 00:44:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-01 00:44:06,591 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 288 [2018-10-01 00:44:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:06,592 INFO L225 Difference]: With dead ends: 293 [2018-10-01 00:44:06,592 INFO L226 Difference]: Without dead ends: 291 [2018-10-01 00:44:06,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:44:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-01 00:44:06,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-10-01 00:44:06,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-01 00:44:06,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-01 00:44:06,596 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2018-10-01 00:44:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:06,596 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-01 00:44:06,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-01 00:44:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-01 00:44:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-01 00:44:06,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:06,597 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1] [2018-10-01 00:44:06,597 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:06,597 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:06,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2110879789, now seen corresponding path program 143 times [2018-10-01 00:44:06,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:06,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:06,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:06,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:06,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:07,960 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:07,960 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:07,970 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:44:08,557 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2018-10-01 00:44:08,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:08,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:09,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:09,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145] total 145 [2018-10-01 00:44:09,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-01 00:44:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-01 00:44:09,134 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:09,134 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 146 states. [2018-10-01 00:44:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:11,052 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-01 00:44:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-01 00:44:11,053 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-10-01 00:44:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:11,053 INFO L225 Difference]: With dead ends: 295 [2018-10-01 00:44:11,053 INFO L226 Difference]: Without dead ends: 293 [2018-10-01 00:44:11,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:44:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-01 00:44:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-10-01 00:44:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-01 00:44:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-01 00:44:11,057 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2018-10-01 00:44:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:11,058 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-01 00:44:11,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-01 00:44:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-01 00:44:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-01 00:44:11,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:11,059 INFO L375 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1] [2018-10-01 00:44:11,059 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:11,059 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:11,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1330965607, now seen corresponding path program 144 times [2018-10-01 00:44:11,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:11,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:11,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:11,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:12,490 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:12,490 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:12,497 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:44:13,082 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 145 check-sat command(s) [2018-10-01 00:44:13,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:13,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:13,706 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:13,706 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146, 146] total 146 [2018-10-01 00:44:13,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-01 00:44:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-01 00:44:13,708 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:13,708 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 147 states. [2018-10-01 00:44:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:15,673 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-01 00:44:15,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-01 00:44:15,673 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 292 [2018-10-01 00:44:15,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:15,674 INFO L225 Difference]: With dead ends: 297 [2018-10-01 00:44:15,674 INFO L226 Difference]: Without dead ends: 295 [2018-10-01 00:44:15,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:44:15,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-01 00:44:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-10-01 00:44:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-01 00:44:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-01 00:44:15,677 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2018-10-01 00:44:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:15,678 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-01 00:44:15,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-01 00:44:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-01 00:44:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-01 00:44:15,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:15,679 INFO L375 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1] [2018-10-01 00:44:15,679 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:15,679 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:15,679 INFO L82 PathProgramCache]: Analyzing trace with hash -842253791, now seen corresponding path program 145 times [2018-10-01 00:44:15,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:15,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:15,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:15,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:15,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:17,093 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:17,093 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:17,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:17,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:17,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:17,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147] total 147 [2018-10-01 00:44:17,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-01 00:44:17,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-01 00:44:17,935 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:17,935 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 148 states. [2018-10-01 00:44:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:20,008 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-01 00:44:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-10-01 00:44:20,008 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-10-01 00:44:20,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:20,009 INFO L225 Difference]: With dead ends: 299 [2018-10-01 00:44:20,009 INFO L226 Difference]: Without dead ends: 297 [2018-10-01 00:44:20,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:44:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-01 00:44:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-10-01 00:44:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-01 00:44:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-01 00:44:20,013 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2018-10-01 00:44:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:20,013 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-01 00:44:20,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-01 00:44:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-01 00:44:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-01 00:44:20,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:20,014 INFO L375 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1] [2018-10-01 00:44:20,014 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:20,014 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1951989413, now seen corresponding path program 146 times [2018-10-01 00:44:20,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:20,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:20,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:21,421 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:21,421 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:21,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:44:21,655 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:44:21,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:21,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:22,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:22,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148, 148] total 148 [2018-10-01 00:44:22,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-01 00:44:22,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-01 00:44:22,210 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:22,211 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 149 states. [2018-10-01 00:44:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:23,673 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-01 00:44:23,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-01 00:44:23,673 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 296 [2018-10-01 00:44:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:23,674 INFO L225 Difference]: With dead ends: 301 [2018-10-01 00:44:23,674 INFO L226 Difference]: Without dead ends: 299 [2018-10-01 00:44:23,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:44:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-01 00:44:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-10-01 00:44:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-01 00:44:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-01 00:44:23,679 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2018-10-01 00:44:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:23,680 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-01 00:44:23,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-01 00:44:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-01 00:44:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-01 00:44:23,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:23,681 INFO L375 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1] [2018-10-01 00:44:23,682 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:23,682 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:23,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1038934549, now seen corresponding path program 147 times [2018-10-01 00:44:23,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:23,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:23,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:23,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:23,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:25,226 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:25,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:25,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:44:25,901 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 148 check-sat command(s) [2018-10-01 00:44:25,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:25,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:26,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:26,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149, 149] total 149 [2018-10-01 00:44:26,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-10-01 00:44:26,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-10-01 00:44:26,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:26,498 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 150 states. [2018-10-01 00:44:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:28,564 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-01 00:44:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-01 00:44:28,564 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-10-01 00:44:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:28,565 INFO L225 Difference]: With dead ends: 303 [2018-10-01 00:44:28,565 INFO L226 Difference]: Without dead ends: 301 [2018-10-01 00:44:28,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:44:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-01 00:44:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-01 00:44:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-01 00:44:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-01 00:44:28,569 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2018-10-01 00:44:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:28,570 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-01 00:44:28,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-10-01 00:44:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-01 00:44:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-01 00:44:28,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:28,571 INFO L375 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1] [2018-10-01 00:44:28,571 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:28,571 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1983741007, now seen corresponding path program 148 times [2018-10-01 00:44:28,571 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:28,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:28,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:28,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:28,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:30,105 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:30,105 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:30,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:44:30,356 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:44:30,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:30,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:31,120 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:31,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150, 150] total 150 [2018-10-01 00:44:31,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-01 00:44:31,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-01 00:44:31,123 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:31,123 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 151 states. [2018-10-01 00:44:32,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:32,411 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-01 00:44:32,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-01 00:44:32,411 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 300 [2018-10-01 00:44:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:32,412 INFO L225 Difference]: With dead ends: 305 [2018-10-01 00:44:32,412 INFO L226 Difference]: Without dead ends: 303 [2018-10-01 00:44:32,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:44:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-01 00:44:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-10-01 00:44:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-01 00:44:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-01 00:44:32,416 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2018-10-01 00:44:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:32,416 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-01 00:44:32,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-10-01 00:44:32,416 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-01 00:44:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-01 00:44:32,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:32,417 INFO L375 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1] [2018-10-01 00:44:32,418 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:32,418 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:32,418 INFO L82 PathProgramCache]: Analyzing trace with hash -590319607, now seen corresponding path program 149 times [2018-10-01 00:44:32,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:32,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:32,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:32,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:32,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:33,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:33,827 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:33,834 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:44:34,420 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 150 check-sat command(s) [2018-10-01 00:44:34,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:34,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:35,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:35,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151, 151] total 151 [2018-10-01 00:44:35,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-10-01 00:44:35,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-10-01 00:44:35,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:35,022 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 152 states. [2018-10-01 00:44:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:36,927 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-01 00:44:36,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-01 00:44:36,927 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-10-01 00:44:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:36,928 INFO L225 Difference]: With dead ends: 307 [2018-10-01 00:44:36,928 INFO L226 Difference]: Without dead ends: 305 [2018-10-01 00:44:36,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 00:44:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-01 00:44:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-10-01 00:44:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-01 00:44:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-01 00:44:36,932 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2018-10-01 00:44:36,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:36,932 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-01 00:44:36,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-10-01 00:44:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-01 00:44:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-01 00:44:36,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:36,933 INFO L375 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1] [2018-10-01 00:44:36,933 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:36,933 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash -361407165, now seen corresponding path program 150 times [2018-10-01 00:44:36,934 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:36,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:36,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:36,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:38,372 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:38,372 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:38,379 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:44:38,971 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 151 check-sat command(s) [2018-10-01 00:44:38,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:38,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:39,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:39,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152, 152] total 152 [2018-10-01 00:44:39,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-10-01 00:44:39,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-10-01 00:44:39,547 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:39,547 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 153 states. [2018-10-01 00:44:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:41,651 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-01 00:44:41,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-01 00:44:41,652 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 304 [2018-10-01 00:44:41,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:41,652 INFO L225 Difference]: With dead ends: 309 [2018-10-01 00:44:41,652 INFO L226 Difference]: Without dead ends: 307 [2018-10-01 00:44:41,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:44:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-01 00:44:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-01 00:44:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-01 00:44:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-01 00:44:41,656 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2018-10-01 00:44:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:41,656 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-01 00:44:41,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-10-01 00:44:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-01 00:44:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-01 00:44:41,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:41,657 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1] [2018-10-01 00:44:41,658 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:41,658 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:41,658 INFO L82 PathProgramCache]: Analyzing trace with hash 580117501, now seen corresponding path program 151 times [2018-10-01 00:44:41,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:41,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:41,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:43,197 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:43,197 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:43,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:43,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:44,017 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:44,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153, 153] total 153 [2018-10-01 00:44:44,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-10-01 00:44:44,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-10-01 00:44:44,020 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:44,020 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 154 states. [2018-10-01 00:44:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:45,379 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-01 00:44:45,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-01 00:44:45,379 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 306 [2018-10-01 00:44:45,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:45,380 INFO L225 Difference]: With dead ends: 311 [2018-10-01 00:44:45,381 INFO L226 Difference]: Without dead ends: 309 [2018-10-01 00:44:45,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:44:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-01 00:44:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-10-01 00:44:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-01 00:44:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-01 00:44:45,386 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2018-10-01 00:44:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:45,386 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-01 00:44:45,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-10-01 00:44:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-01 00:44:45,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-01 00:44:45,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:45,388 INFO L375 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1] [2018-10-01 00:44:45,388 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:45,388 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:45,389 INFO L82 PathProgramCache]: Analyzing trace with hash -852777929, now seen corresponding path program 152 times [2018-10-01 00:44:45,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:45,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:45,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:45,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:45,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:47,041 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:47,041 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:47,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:44:47,297 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:44:47,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:47,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:47,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:47,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154, 154] total 154 [2018-10-01 00:44:47,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-10-01 00:44:47,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-10-01 00:44:47,947 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:47,947 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 155 states. [2018-10-01 00:44:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:49,850 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-01 00:44:49,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-01 00:44:49,850 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 308 [2018-10-01 00:44:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:49,851 INFO L225 Difference]: With dead ends: 313 [2018-10-01 00:44:49,851 INFO L226 Difference]: Without dead ends: 311 [2018-10-01 00:44:49,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:44:49,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-01 00:44:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-10-01 00:44:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-01 00:44:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-01 00:44:49,857 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2018-10-01 00:44:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:49,857 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-01 00:44:49,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-10-01 00:44:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-01 00:44:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-01 00:44:49,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:49,858 INFO L375 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1] [2018-10-01 00:44:49,858 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:49,858 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash 819215857, now seen corresponding path program 153 times [2018-10-01 00:44:49,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:49,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:49,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:49,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:51,584 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:51,584 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:51,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:44:52,292 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 154 check-sat command(s) [2018-10-01 00:44:52,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:52,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:52,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:52,912 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155, 155] total 155 [2018-10-01 00:44:52,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-10-01 00:44:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-10-01 00:44:52,914 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:52,914 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 156 states. [2018-10-01 00:44:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:55,189 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-10-01 00:44:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-01 00:44:55,190 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 310 [2018-10-01 00:44:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:55,190 INFO L225 Difference]: With dead ends: 315 [2018-10-01 00:44:55,191 INFO L226 Difference]: Without dead ends: 313 [2018-10-01 00:44:55,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:44:55,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-01 00:44:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-10-01 00:44:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-01 00:44:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-10-01 00:44:55,194 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2018-10-01 00:44:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:55,195 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-10-01 00:44:55,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-10-01 00:44:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-10-01 00:44:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-01 00:44:55,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:55,196 INFO L375 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1] [2018-10-01 00:44:55,196 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:55,196 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1287475499, now seen corresponding path program 154 times [2018-10-01 00:44:55,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:55,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:55,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:56,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:56,952 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:44:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:44:57,208 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:44:57,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:57,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:57,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:57,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156, 156] total 156 [2018-10-01 00:44:57,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-10-01 00:44:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-10-01 00:44:57,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:57,823 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 157 states. [2018-10-01 00:45:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:00,075 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-01 00:45:00,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-01 00:45:00,075 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 312 [2018-10-01 00:45:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:00,075 INFO L225 Difference]: With dead ends: 317 [2018-10-01 00:45:00,076 INFO L226 Difference]: Without dead ends: 315 [2018-10-01 00:45:00,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:45:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-01 00:45:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-10-01 00:45:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-01 00:45:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-01 00:45:00,081 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2018-10-01 00:45:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:00,081 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-01 00:45:00,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-10-01 00:45:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-01 00:45:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-01 00:45:00,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:00,082 INFO L375 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1] [2018-10-01 00:45:00,083 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:00,083 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 313425381, now seen corresponding path program 155 times [2018-10-01 00:45:00,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:00,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:00,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:00,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:00,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:01,960 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:01,961 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:01,967 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:45:02,595 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 156 check-sat command(s) [2018-10-01 00:45:02,595 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:02,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:03,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:03,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157, 157] total 157 [2018-10-01 00:45:03,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-10-01 00:45:03,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-10-01 00:45:03,190 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:03,190 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 158 states. [2018-10-01 00:45:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:05,363 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-10-01 00:45:05,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-01 00:45:05,363 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 314 [2018-10-01 00:45:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:05,364 INFO L225 Difference]: With dead ends: 319 [2018-10-01 00:45:05,364 INFO L226 Difference]: Without dead ends: 317 [2018-10-01 00:45:05,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:45:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-01 00:45:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-10-01 00:45:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-01 00:45:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-01 00:45:05,367 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2018-10-01 00:45:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:05,368 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-01 00:45:05,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-10-01 00:45:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-01 00:45:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-01 00:45:05,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:05,369 INFO L375 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1] [2018-10-01 00:45:05,369 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:05,369 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash 554132511, now seen corresponding path program 156 times [2018-10-01 00:45:05,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:05,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:05,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:07,097 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:07,097 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:07,104 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:45:07,736 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 157 check-sat command(s) [2018-10-01 00:45:07,737 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:07,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:08,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:08,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158, 158] total 158 [2018-10-01 00:45:08,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-10-01 00:45:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-10-01 00:45:08,395 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:08,395 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 159 states. [2018-10-01 00:45:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:10,603 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-10-01 00:45:10,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-01 00:45:10,603 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 316 [2018-10-01 00:45:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:10,604 INFO L225 Difference]: With dead ends: 321 [2018-10-01 00:45:10,604 INFO L226 Difference]: Without dead ends: 319 [2018-10-01 00:45:10,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:45:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-01 00:45:10,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-10-01 00:45:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-01 00:45:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-01 00:45:10,607 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2018-10-01 00:45:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:10,607 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-01 00:45:10,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-10-01 00:45:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-01 00:45:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-01 00:45:10,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:10,608 INFO L375 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1] [2018-10-01 00:45:10,608 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:10,609 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash -54549543, now seen corresponding path program 157 times [2018-10-01 00:45:10,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:10,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:10,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:12,478 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:12,478 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:12,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:45:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:12,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:13,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:13,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159, 159] total 159 [2018-10-01 00:45:13,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-10-01 00:45:13,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-10-01 00:45:13,387 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:13,387 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 160 states. [2018-10-01 00:45:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:15,316 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-01 00:45:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-10-01 00:45:15,317 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 318 [2018-10-01 00:45:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:15,317 INFO L225 Difference]: With dead ends: 323 [2018-10-01 00:45:15,318 INFO L226 Difference]: Without dead ends: 321 [2018-10-01 00:45:15,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:45:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-01 00:45:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-10-01 00:45:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-01 00:45:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-10-01 00:45:15,321 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2018-10-01 00:45:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:15,322 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-10-01 00:45:15,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-10-01 00:45:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-10-01 00:45:15,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-01 00:45:15,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:15,323 INFO L375 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1] [2018-10-01 00:45:15,323 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:15,323 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:15,323 INFO L82 PathProgramCache]: Analyzing trace with hash -882451181, now seen corresponding path program 158 times [2018-10-01 00:45:15,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:15,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:15,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:15,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:45:15,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:17,183 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:17,183 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:17,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:45:17,451 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:45:17,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:17,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:18,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:18,096 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160, 160] total 160 [2018-10-01 00:45:18,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-10-01 00:45:18,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-10-01 00:45:18,099 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:18,099 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 161 states. [2018-10-01 00:45:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:19,740 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-10-01 00:45:19,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-01 00:45:19,741 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 320 [2018-10-01 00:45:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:19,741 INFO L225 Difference]: With dead ends: 325 [2018-10-01 00:45:19,741 INFO L226 Difference]: Without dead ends: 323 [2018-10-01 00:45:19,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:45:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-01 00:45:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-10-01 00:45:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-01 00:45:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-01 00:45:19,745 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2018-10-01 00:45:19,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:19,746 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-01 00:45:19,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-10-01 00:45:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-01 00:45:19,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-01 00:45:19,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:19,747 INFO L375 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1] [2018-10-01 00:45:19,747 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:19,747 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:19,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1926975539, now seen corresponding path program 159 times [2018-10-01 00:45:19,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:19,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:19,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:19,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:19,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:21,465 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:21,465 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:21,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:45:22,254 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 160 check-sat command(s) [2018-10-01 00:45:22,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:22,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:22,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:22,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161, 161] total 161 [2018-10-01 00:45:22,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-10-01 00:45:22,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-10-01 00:45:22,893 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:22,893 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 162 states. [2018-10-01 00:45:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:25,475 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-10-01 00:45:25,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-01 00:45:25,475 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 322 [2018-10-01 00:45:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:25,476 INFO L225 Difference]: With dead ends: 327 [2018-10-01 00:45:25,476 INFO L226 Difference]: Without dead ends: 325 [2018-10-01 00:45:25,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:45:25,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-01 00:45:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-10-01 00:45:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-01 00:45:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-10-01 00:45:25,481 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2018-10-01 00:45:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:25,481 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-10-01 00:45:25,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-10-01 00:45:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-10-01 00:45:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-01 00:45:25,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:25,482 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1] [2018-10-01 00:45:25,482 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:25,482 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:25,482 INFO L82 PathProgramCache]: Analyzing trace with hash -692536313, now seen corresponding path program 160 times [2018-10-01 00:45:25,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:25,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:25,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:25,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:25,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:27,254 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:27,254 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:27,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:45:27,515 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:45:27,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:27,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:28,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:28,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162, 162] total 162 [2018-10-01 00:45:28,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-10-01 00:45:28,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-10-01 00:45:28,155 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:28,155 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 163 states. [2018-10-01 00:45:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:30,753 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-01 00:45:30,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-10-01 00:45:30,753 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 324 [2018-10-01 00:45:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:30,754 INFO L225 Difference]: With dead ends: 329 [2018-10-01 00:45:30,754 INFO L226 Difference]: Without dead ends: 327 [2018-10-01 00:45:30,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:45:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-01 00:45:30,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-10-01 00:45:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-01 00:45:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-10-01 00:45:30,758 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2018-10-01 00:45:30,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:30,758 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-10-01 00:45:30,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-10-01 00:45:30,758 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-10-01 00:45:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-01 00:45:30,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:30,759 INFO L375 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1] [2018-10-01 00:45:30,759 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:30,759 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash 192586177, now seen corresponding path program 161 times [2018-10-01 00:45:30,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:30,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:30,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:32,589 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:32,589 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:32,589 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:32,596 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:45:33,268 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 162 check-sat command(s) [2018-10-01 00:45:33,268 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:33,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:33,903 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:33,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163, 163] total 163 [2018-10-01 00:45:33,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-10-01 00:45:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-10-01 00:45:33,906 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:33,906 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 164 states. [2018-10-01 00:45:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:35,481 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-01 00:45:35,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-01 00:45:35,490 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 326 [2018-10-01 00:45:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:35,490 INFO L225 Difference]: With dead ends: 331 [2018-10-01 00:45:35,491 INFO L226 Difference]: Without dead ends: 329 [2018-10-01 00:45:35,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:45:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-01 00:45:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-10-01 00:45:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-01 00:45:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-10-01 00:45:35,496 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2018-10-01 00:45:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:35,496 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-10-01 00:45:35,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-10-01 00:45:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-10-01 00:45:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-01 00:45:35,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:35,498 INFO L375 BasicCegarLoop]: trace histogram [163, 162, 1, 1, 1] [2018-10-01 00:45:35,498 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:35,498 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash 391774459, now seen corresponding path program 162 times [2018-10-01 00:45:35,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:35,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:35,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:37,353 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:37,353 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:37,360 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:45:38,080 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 163 check-sat command(s) [2018-10-01 00:45:38,080 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:38,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:38,743 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:38,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164, 164] total 164 [2018-10-01 00:45:38,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-10-01 00:45:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-10-01 00:45:38,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:38,746 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 165 states. [2018-10-01 00:45:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:41,642 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-10-01 00:45:41,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-01 00:45:41,643 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 328 [2018-10-01 00:45:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:41,643 INFO L225 Difference]: With dead ends: 333 [2018-10-01 00:45:41,644 INFO L226 Difference]: Without dead ends: 331 [2018-10-01 00:45:41,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:45:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-01 00:45:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-10-01 00:45:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-01 00:45:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-01 00:45:41,648 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2018-10-01 00:45:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:41,648 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-01 00:45:41,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-10-01 00:45:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-01 00:45:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-01 00:45:41,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:41,649 INFO L375 BasicCegarLoop]: trace histogram [164, 163, 1, 1, 1] [2018-10-01 00:45:41,649 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:41,649 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1461814859, now seen corresponding path program 163 times [2018-10-01 00:45:41,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:41,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:41,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:41,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:41,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:43,515 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:43,515 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:43,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:45:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:43,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:44,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:44,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165, 165] total 165 [2018-10-01 00:45:44,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-10-01 00:45:44,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-10-01 00:45:44,463 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:44,463 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 166 states. [2018-10-01 00:45:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:46,140 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-01 00:45:46,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-01 00:45:46,140 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 330 [2018-10-01 00:45:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:46,140 INFO L225 Difference]: With dead ends: 335 [2018-10-01 00:45:46,141 INFO L226 Difference]: Without dead ends: 333 [2018-10-01 00:45:46,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:45:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-01 00:45:46,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-10-01 00:45:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-01 00:45:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-01 00:45:46,146 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2018-10-01 00:45:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:46,147 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-01 00:45:46,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-10-01 00:45:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-01 00:45:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-01 00:45:46,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:46,148 INFO L375 BasicCegarLoop]: trace histogram [165, 164, 1, 1, 1] [2018-10-01 00:45:46,149 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:46,149 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:46,149 INFO L82 PathProgramCache]: Analyzing trace with hash -349721617, now seen corresponding path program 164 times [2018-10-01 00:45:46,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:46,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:46,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:45:46,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:48,180 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:48,181 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:48,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:45:48,446 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:45:48,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:48,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:49,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:49,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166, 166] total 166 [2018-10-01 00:45:49,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-10-01 00:45:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-10-01 00:45:49,093 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:49,093 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 167 states. [2018-10-01 00:45:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:51,262 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-01 00:45:51,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-01 00:45:51,262 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 332 [2018-10-01 00:45:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:51,263 INFO L225 Difference]: With dead ends: 337 [2018-10-01 00:45:51,263 INFO L226 Difference]: Without dead ends: 335 [2018-10-01 00:45:51,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:45:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-01 00:45:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-10-01 00:45:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-01 00:45:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-01 00:45:51,267 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2018-10-01 00:45:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:51,267 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-01 00:45:51,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-10-01 00:45:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-01 00:45:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-01 00:45:51,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:51,269 INFO L375 BasicCegarLoop]: trace histogram [166, 165, 1, 1, 1] [2018-10-01 00:45:51,269 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:51,269 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1074972759, now seen corresponding path program 165 times [2018-10-01 00:45:51,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:51,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:51,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:51,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:51,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:53,191 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:53,191 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:53,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:45:53,944 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 166 check-sat command(s) [2018-10-01 00:45:53,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:53,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:45:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:54,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:45:54,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167, 167] total 167 [2018-10-01 00:45:54,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-10-01 00:45:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-10-01 00:45:54,629 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:45:54,629 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 168 states. [2018-10-01 00:45:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:45:57,357 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-10-01 00:45:57,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-01 00:45:57,358 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 334 [2018-10-01 00:45:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:45:57,359 INFO L225 Difference]: With dead ends: 339 [2018-10-01 00:45:57,359 INFO L226 Difference]: Without dead ends: 337 [2018-10-01 00:45:57,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:45:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-01 00:45:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-10-01 00:45:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-01 00:45:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-10-01 00:45:57,363 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2018-10-01 00:45:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:45:57,363 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-10-01 00:45:57,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-10-01 00:45:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-10-01 00:45:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-01 00:45:57,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:45:57,364 INFO L375 BasicCegarLoop]: trace histogram [167, 166, 1, 1, 1] [2018-10-01 00:45:57,364 INFO L423 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:45:57,365 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:45:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2038349027, now seen corresponding path program 166 times [2018-10-01 00:45:57,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:45:57,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:45:57,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:57,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:45:57,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:45:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:45:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:45:59,228 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:45:59,228 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:45:59,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:45:59,503 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:45:59,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:45:59,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:00,169 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:00,169 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168, 168] total 168 [2018-10-01 00:46:00,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-10-01 00:46:00,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-10-01 00:46:00,172 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:00,172 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 169 states. [2018-10-01 00:46:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:02,436 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-10-01 00:46:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-01 00:46:02,437 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 336 [2018-10-01 00:46:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:02,437 INFO L225 Difference]: With dead ends: 341 [2018-10-01 00:46:02,437 INFO L226 Difference]: Without dead ends: 339 [2018-10-01 00:46:02,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:46:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-01 00:46:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-10-01 00:46:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-01 00:46:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-01 00:46:02,441 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2018-10-01 00:46:02,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:02,441 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-01 00:46:02,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-10-01 00:46:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-01 00:46:02,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-01 00:46:02,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:02,443 INFO L375 BasicCegarLoop]: trace histogram [168, 167, 1, 1, 1] [2018-10-01 00:46:02,443 INFO L423 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:02,443 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:02,443 INFO L82 PathProgramCache]: Analyzing trace with hash 348380061, now seen corresponding path program 167 times [2018-10-01 00:46:02,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:02,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:02,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:02,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:02,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:04,282 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:04,282 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:04,289 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:46:05,053 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 168 check-sat command(s) [2018-10-01 00:46:05,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:05,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:05,742 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:05,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169, 169] total 169 [2018-10-01 00:46:05,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-10-01 00:46:05,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-10-01 00:46:05,745 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:05,745 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 170 states. [2018-10-01 00:46:07,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:07,502 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-10-01 00:46:07,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-01 00:46:07,502 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 338 [2018-10-01 00:46:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:07,503 INFO L225 Difference]: With dead ends: 343 [2018-10-01 00:46:07,503 INFO L226 Difference]: Without dead ends: 341 [2018-10-01 00:46:07,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:46:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-01 00:46:07,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-10-01 00:46:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-01 00:46:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-10-01 00:46:07,507 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2018-10-01 00:46:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:07,507 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-10-01 00:46:07,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-10-01 00:46:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-10-01 00:46:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-01 00:46:07,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:07,508 INFO L375 BasicCegarLoop]: trace histogram [169, 168, 1, 1, 1] [2018-10-01 00:46:07,508 INFO L423 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:07,508 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:07,509 INFO L82 PathProgramCache]: Analyzing trace with hash -214158377, now seen corresponding path program 168 times [2018-10-01 00:46:07,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:07,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:07,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:07,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:07,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:09,406 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:09,406 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:09,413 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:46:10,194 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 169 check-sat command(s) [2018-10-01 00:46:10,194 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:10,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:10,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:10,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170, 170] total 170 [2018-10-01 00:46:10,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-10-01 00:46:10,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-10-01 00:46:10,908 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:10,908 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 171 states. [2018-10-01 00:46:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:12,617 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-01 00:46:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-01 00:46:12,617 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 340 [2018-10-01 00:46:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:12,618 INFO L225 Difference]: With dead ends: 345 [2018-10-01 00:46:12,618 INFO L226 Difference]: Without dead ends: 343 [2018-10-01 00:46:12,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:46:12,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-01 00:46:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-10-01 00:46:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-01 00:46:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-10-01 00:46:12,622 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2018-10-01 00:46:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:12,622 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-10-01 00:46:12,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-10-01 00:46:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-10-01 00:46:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-01 00:46:12,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:12,624 INFO L375 BasicCegarLoop]: trace histogram [170, 169, 1, 1, 1] [2018-10-01 00:46:12,624 INFO L423 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:12,624 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash 352282001, now seen corresponding path program 169 times [2018-10-01 00:46:12,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:12,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:12,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:12,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:12,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:14,588 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:14,588 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:14,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:46:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:14,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:15,556 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:15,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171, 171] total 171 [2018-10-01 00:46:15,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-10-01 00:46:15,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-10-01 00:46:15,558 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:15,558 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 172 states. [2018-10-01 00:46:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:17,243 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-10-01 00:46:17,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-10-01 00:46:17,244 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 342 [2018-10-01 00:46:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:17,244 INFO L225 Difference]: With dead ends: 347 [2018-10-01 00:46:17,244 INFO L226 Difference]: Without dead ends: 345 [2018-10-01 00:46:17,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:46:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-01 00:46:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-10-01 00:46:17,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-01 00:46:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-10-01 00:46:17,248 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2018-10-01 00:46:17,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:17,249 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-10-01 00:46:17,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-10-01 00:46:17,249 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-10-01 00:46:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-01 00:46:17,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:17,250 INFO L375 BasicCegarLoop]: trace histogram [171, 170, 1, 1, 1] [2018-10-01 00:46:17,250 INFO L423 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:17,250 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash -759361333, now seen corresponding path program 170 times [2018-10-01 00:46:17,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:17,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:17,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:17,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:46:17,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:19,247 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:19,247 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:19,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:46:19,526 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:46:19,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:19,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:20,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:20,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172, 172] total 172 [2018-10-01 00:46:20,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-10-01 00:46:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-10-01 00:46:20,205 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:20,206 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 173 states. [2018-10-01 00:46:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:21,949 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-10-01 00:46:21,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-01 00:46:21,950 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 344 [2018-10-01 00:46:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:21,950 INFO L225 Difference]: With dead ends: 349 [2018-10-01 00:46:21,950 INFO L226 Difference]: Without dead ends: 347 [2018-10-01 00:46:21,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:46:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-01 00:46:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-10-01 00:46:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-01 00:46:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-01 00:46:21,954 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2018-10-01 00:46:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:21,955 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-01 00:46:21,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-10-01 00:46:21,955 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-01 00:46:21,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-01 00:46:21,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:21,956 INFO L375 BasicCegarLoop]: trace histogram [172, 171, 1, 1, 1] [2018-10-01 00:46:21,956 INFO L423 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:21,956 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:21,956 INFO L82 PathProgramCache]: Analyzing trace with hash 398251397, now seen corresponding path program 171 times [2018-10-01 00:46:21,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:21,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:21,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:21,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:24,121 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:24,121 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:24,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:46:24,916 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 172 check-sat command(s) [2018-10-01 00:46:24,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:24,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:25,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:25,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173, 173] total 173 [2018-10-01 00:46:25,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-10-01 00:46:25,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-10-01 00:46:25,633 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:25,633 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 174 states. [2018-10-01 00:46:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:27,410 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-10-01 00:46:27,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-01 00:46:27,411 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 346 [2018-10-01 00:46:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:27,412 INFO L225 Difference]: With dead ends: 351 [2018-10-01 00:46:27,412 INFO L226 Difference]: Without dead ends: 349 [2018-10-01 00:46:27,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:46:27,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-01 00:46:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-10-01 00:46:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-01 00:46:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-10-01 00:46:27,416 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2018-10-01 00:46:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:27,416 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-10-01 00:46:27,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-10-01 00:46:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-10-01 00:46:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-01 00:46:27,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:27,417 INFO L375 BasicCegarLoop]: trace histogram [173, 172, 1, 1, 1] [2018-10-01 00:46:27,417 INFO L423 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:27,417 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:27,417 INFO L82 PathProgramCache]: Analyzing trace with hash 467555263, now seen corresponding path program 172 times [2018-10-01 00:46:27,418 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:27,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:27,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:27,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:27,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:29,534 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:29,534 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:29,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:46:29,818 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:46:29,819 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:29,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:30,515 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:30,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174, 174] total 174 [2018-10-01 00:46:30,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-10-01 00:46:30,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-10-01 00:46:30,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:30,517 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 175 states. [2018-10-01 00:46:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:33,655 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-01 00:46:33,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-01 00:46:33,655 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 348 [2018-10-01 00:46:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:33,656 INFO L225 Difference]: With dead ends: 353 [2018-10-01 00:46:33,656 INFO L226 Difference]: Without dead ends: 351 [2018-10-01 00:46:33,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:46:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-01 00:46:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-10-01 00:46:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-01 00:46:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-10-01 00:46:33,659 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2018-10-01 00:46:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:33,660 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-10-01 00:46:33,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-10-01 00:46:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-10-01 00:46:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-01 00:46:33,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:33,661 INFO L375 BasicCegarLoop]: trace histogram [174, 173, 1, 1, 1] [2018-10-01 00:46:33,661 INFO L423 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:33,661 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1650906247, now seen corresponding path program 173 times [2018-10-01 00:46:33,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:33,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:33,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:33,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:33,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:35,695 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:35,695 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:35,703 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:46:36,532 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 174 check-sat command(s) [2018-10-01 00:46:36,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:36,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:37,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:37,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175, 175] total 175 [2018-10-01 00:46:37,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-10-01 00:46:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-10-01 00:46:37,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:37,252 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 176 states. [2018-10-01 00:46:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:40,768 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-10-01 00:46:40,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-01 00:46:40,768 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 350 [2018-10-01 00:46:40,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:40,769 INFO L225 Difference]: With dead ends: 355 [2018-10-01 00:46:40,769 INFO L226 Difference]: Without dead ends: 353 [2018-10-01 00:46:40,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:46:40,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-01 00:46:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-10-01 00:46:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-01 00:46:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-01 00:46:40,773 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2018-10-01 00:46:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:40,773 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-01 00:46:40,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-10-01 00:46:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-01 00:46:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-01 00:46:40,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:40,775 INFO L375 BasicCegarLoop]: trace histogram [175, 174, 1, 1, 1] [2018-10-01 00:46:40,775 INFO L423 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:40,775 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:40,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1677919053, now seen corresponding path program 174 times [2018-10-01 00:46:40,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:40,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:40,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:40,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:40,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:42,848 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:42,848 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:42,861 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:46:43,704 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 175 check-sat command(s) [2018-10-01 00:46:43,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:43,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:44,464 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:44,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176, 176] total 176 [2018-10-01 00:46:44,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-10-01 00:46:44,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-10-01 00:46:44,467 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:44,468 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 177 states. [2018-10-01 00:46:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:46,876 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-10-01 00:46:46,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-01 00:46:46,876 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 352 [2018-10-01 00:46:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:46,877 INFO L225 Difference]: With dead ends: 357 [2018-10-01 00:46:46,877 INFO L226 Difference]: Without dead ends: 355 [2018-10-01 00:46:46,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:46:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-01 00:46:46,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-10-01 00:46:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-01 00:46:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-10-01 00:46:46,881 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2018-10-01 00:46:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:46,881 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-10-01 00:46:46,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-10-01 00:46:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-10-01 00:46:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-01 00:46:46,883 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:46,883 INFO L375 BasicCegarLoop]: trace histogram [176, 175, 1, 1, 1] [2018-10-01 00:46:46,883 INFO L423 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:46,883 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1867421843, now seen corresponding path program 175 times [2018-10-01 00:46:46,884 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:46,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:46,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:49,162 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:49,162 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-01 00:46:49,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:49,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:50,167 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:50,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177, 177] total 177 [2018-10-01 00:46:50,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-10-01 00:46:50,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-10-01 00:46:50,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:50,170 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 178 states. [2018-10-01 00:46:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:52,898 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-01 00:46:52,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-01 00:46:52,899 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 354 [2018-10-01 00:46:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:52,899 INFO L225 Difference]: With dead ends: 359 [2018-10-01 00:46:52,899 INFO L226 Difference]: Without dead ends: 357 [2018-10-01 00:46:52,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:46:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-01 00:46:52,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-10-01 00:46:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-01 00:46:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-10-01 00:46:52,903 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 354 [2018-10-01 00:46:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:52,904 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-10-01 00:46:52,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-10-01 00:46:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-10-01 00:46:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-01 00:46:52,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:52,905 INFO L375 BasicCegarLoop]: trace histogram [177, 176, 1, 1, 1] [2018-10-01 00:46:52,905 INFO L423 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:52,905 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:52,905 INFO L82 PathProgramCache]: Analyzing trace with hash 703990695, now seen corresponding path program 176 times [2018-10-01 00:46:52,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:52,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:52,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:52,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:46:52,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:46:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:55,130 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:46:55,130 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:46:55,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:46:55,423 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:46:55,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:46:55,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:46:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:46:56,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:46:56,188 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178, 178] total 178 [2018-10-01 00:46:56,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-10-01 00:46:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-10-01 00:46:56,191 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:46:56,192 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 179 states. [2018-10-01 00:46:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:46:58,805 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-10-01 00:46:58,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-01 00:46:58,805 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 356 [2018-10-01 00:46:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:46:58,807 INFO L225 Difference]: With dead ends: 361 [2018-10-01 00:46:58,807 INFO L226 Difference]: Without dead ends: 359 [2018-10-01 00:46:58,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:46:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-01 00:46:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-10-01 00:46:58,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-01 00:46:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-10-01 00:46:58,813 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 356 [2018-10-01 00:46:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:46:58,814 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-10-01 00:46:58,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-10-01 00:46:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-10-01 00:46:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-01 00:46:58,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:46:58,815 INFO L375 BasicCegarLoop]: trace histogram [178, 177, 1, 1, 1] [2018-10-01 00:46:58,815 INFO L423 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:46:58,815 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:46:58,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2069722783, now seen corresponding path program 177 times [2018-10-01 00:46:58,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:46:58,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:46:58,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:58,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:46:58,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:46:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:00,962 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:00,962 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:00,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:47:01,845 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 178 check-sat command(s) [2018-10-01 00:47:01,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:01,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:02,649 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:02,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179, 179] total 179 [2018-10-01 00:47:02,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-10-01 00:47:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-10-01 00:47:02,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:02,651 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 180 states. [2018-10-01 00:47:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:05,764 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-10-01 00:47:05,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-01 00:47:05,764 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 358 [2018-10-01 00:47:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:05,765 INFO L225 Difference]: With dead ends: 363 [2018-10-01 00:47:05,765 INFO L226 Difference]: Without dead ends: 361 [2018-10-01 00:47:05,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 00:47:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-01 00:47:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-10-01 00:47:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-01 00:47:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-10-01 00:47:05,769 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 358 [2018-10-01 00:47:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:05,770 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-10-01 00:47:05,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-10-01 00:47:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-10-01 00:47:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-01 00:47:05,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:05,771 INFO L375 BasicCegarLoop]: trace histogram [179, 178, 1, 1, 1] [2018-10-01 00:47:05,771 INFO L423 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:05,771 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash -433684325, now seen corresponding path program 178 times [2018-10-01 00:47:05,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:05,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:05,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:05,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:05,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:07,902 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:07,902 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:07,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:47:08,194 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:47:08,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:08,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:09,018 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:09,018 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180, 180] total 180 [2018-10-01 00:47:09,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-10-01 00:47:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-10-01 00:47:09,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:09,021 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 181 states. [2018-10-01 00:47:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:11,147 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-01 00:47:11,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-10-01 00:47:11,147 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 360 [2018-10-01 00:47:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:11,148 INFO L225 Difference]: With dead ends: 365 [2018-10-01 00:47:11,148 INFO L226 Difference]: Without dead ends: 363 [2018-10-01 00:47:11,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:47:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-10-01 00:47:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-10-01 00:47:11,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-01 00:47:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-10-01 00:47:11,152 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 360 [2018-10-01 00:47:11,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:11,153 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-10-01 00:47:11,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-10-01 00:47:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-10-01 00:47:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-01 00:47:11,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:11,154 INFO L375 BasicCegarLoop]: trace histogram [180, 179, 1, 1, 1] [2018-10-01 00:47:11,154 INFO L423 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:11,154 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:11,154 INFO L82 PathProgramCache]: Analyzing trace with hash -158756523, now seen corresponding path program 179 times [2018-10-01 00:47:11,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:11,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:11,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:11,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:11,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 32220 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:13,391 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:13,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:13,399 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:47:14,357 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 180 check-sat command(s) [2018-10-01 00:47:14,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:14,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 32220 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:15,153 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:15,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181, 181] total 181 [2018-10-01 00:47:15,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-10-01 00:47:15,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-10-01 00:47:15,156 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:15,156 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 182 states. [2018-10-01 00:47:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:18,578 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-10-01 00:47:18,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-01 00:47:18,578 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 362 [2018-10-01 00:47:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:18,579 INFO L225 Difference]: With dead ends: 367 [2018-10-01 00:47:18,579 INFO L226 Difference]: Without dead ends: 365 [2018-10-01 00:47:18,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:47:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-01 00:47:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-10-01 00:47:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-01 00:47:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-10-01 00:47:18,584 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 362 [2018-10-01 00:47:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:18,584 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-10-01 00:47:18,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-10-01 00:47:18,584 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-10-01 00:47:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-10-01 00:47:18,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:18,585 INFO L375 BasicCegarLoop]: trace histogram [181, 180, 1, 1, 1] [2018-10-01 00:47:18,586 INFO L423 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:18,586 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash 2053856143, now seen corresponding path program 180 times [2018-10-01 00:47:18,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:18,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:18,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:18,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:18,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 32580 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:21,004 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:21,004 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:21,013 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:47:21,872 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 181 check-sat command(s) [2018-10-01 00:47:21,872 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:21,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 32580 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:22,623 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:22,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182, 182] total 182 [2018-10-01 00:47:22,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-10-01 00:47:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-10-01 00:47:22,626 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:22,626 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 183 states. [2018-10-01 00:47:26,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:26,082 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-10-01 00:47:26,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-01 00:47:26,082 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 364 [2018-10-01 00:47:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:26,083 INFO L225 Difference]: With dead ends: 369 [2018-10-01 00:47:26,083 INFO L226 Difference]: Without dead ends: 367 [2018-10-01 00:47:26,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:47:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-01 00:47:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-10-01 00:47:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-01 00:47:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-01 00:47:26,087 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 364 [2018-10-01 00:47:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:26,087 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-01 00:47:26,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-10-01 00:47:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-01 00:47:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-01 00:47:26,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:26,088 INFO L375 BasicCegarLoop]: trace histogram [182, 181, 1, 1, 1] [2018-10-01 00:47:26,089 INFO L423 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:26,089 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:26,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1929150647, now seen corresponding path program 181 times [2018-10-01 00:47:26,089 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:26,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:26,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:26,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:26,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 32942 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:28,261 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:28,261 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:28,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:47:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:28,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 32942 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:29,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:29,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183, 183] total 183 [2018-10-01 00:47:29,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-10-01 00:47:29,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-10-01 00:47:29,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:29,263 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 184 states. [2018-10-01 00:47:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:31,961 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-10-01 00:47:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-10-01 00:47:31,962 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 366 [2018-10-01 00:47:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:31,962 INFO L225 Difference]: With dead ends: 371 [2018-10-01 00:47:31,962 INFO L226 Difference]: Without dead ends: 369 [2018-10-01 00:47:31,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:47:31,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-01 00:47:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-10-01 00:47:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-01 00:47:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-10-01 00:47:31,967 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 366 [2018-10-01 00:47:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:31,967 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-10-01 00:47:31,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-10-01 00:47:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-10-01 00:47:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-01 00:47:31,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:31,968 INFO L375 BasicCegarLoop]: trace histogram [183, 182, 1, 1, 1] [2018-10-01 00:47:31,968 INFO L423 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:31,968 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1512152195, now seen corresponding path program 182 times [2018-10-01 00:47:31,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:31,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:31,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:47:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 33306 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:34,165 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:34,165 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:34,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:47:34,458 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:47:34,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:34,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 33306 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:35,389 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:35,389 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184, 184] total 184 [2018-10-01 00:47:35,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-10-01 00:47:35,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-10-01 00:47:35,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:35,392 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 185 states. [2018-10-01 00:47:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:37,404 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-01 00:47:37,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-01 00:47:37,404 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 368 [2018-10-01 00:47:37,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:37,405 INFO L225 Difference]: With dead ends: 373 [2018-10-01 00:47:37,405 INFO L226 Difference]: Without dead ends: 371 [2018-10-01 00:47:37,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:47:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-01 00:47:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-10-01 00:47:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-01 00:47:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-01 00:47:37,409 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 368 [2018-10-01 00:47:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:37,409 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-01 00:47:37,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-10-01 00:47:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-01 00:47:37,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-01 00:47:37,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:37,411 INFO L375 BasicCegarLoop]: trace histogram [184, 183, 1, 1, 1] [2018-10-01 00:47:37,411 INFO L423 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:37,411 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:37,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1479365437, now seen corresponding path program 183 times [2018-10-01 00:47:37,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:37,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:37,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:37,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:37,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 33672 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:39,633 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:39,633 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:39,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:47:40,560 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 184 check-sat command(s) [2018-10-01 00:47:40,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:40,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 33672 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:41,294 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:41,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185, 185] total 185 [2018-10-01 00:47:41,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-10-01 00:47:41,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-10-01 00:47:41,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:41,297 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 186 states. [2018-10-01 00:47:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:43,275 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-10-01 00:47:43,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-01 00:47:43,276 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 370 [2018-10-01 00:47:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:43,276 INFO L225 Difference]: With dead ends: 375 [2018-10-01 00:47:43,276 INFO L226 Difference]: Without dead ends: 373 [2018-10-01 00:47:43,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 00:47:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-01 00:47:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-10-01 00:47:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-01 00:47:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-10-01 00:47:43,280 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 370 [2018-10-01 00:47:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:43,281 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-10-01 00:47:43,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-10-01 00:47:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-10-01 00:47:43,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-01 00:47:43,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:43,282 INFO L375 BasicCegarLoop]: trace histogram [185, 184, 1, 1, 1] [2018-10-01 00:47:43,282 INFO L423 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:43,282 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash 36062071, now seen corresponding path program 184 times [2018-10-01 00:47:43,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:43,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:43,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 34040 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:45,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:45,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:45,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:47:45,939 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:47:45,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:45,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 34040 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:46,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:46,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186, 186] total 186 [2018-10-01 00:47:46,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-10-01 00:47:46,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-10-01 00:47:46,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:46,790 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 187 states. [2018-10-01 00:47:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:49,016 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-10-01 00:47:49,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-01 00:47:49,017 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 372 [2018-10-01 00:47:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:49,017 INFO L225 Difference]: With dead ends: 377 [2018-10-01 00:47:49,017 INFO L226 Difference]: Without dead ends: 375 [2018-10-01 00:47:49,018 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:47:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-10-01 00:47:49,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-10-01 00:47:49,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-01 00:47:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-10-01 00:47:49,022 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 372 [2018-10-01 00:47:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:49,022 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-10-01 00:47:49,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-10-01 00:47:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-10-01 00:47:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-01 00:47:49,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:49,023 INFO L375 BasicCegarLoop]: trace histogram [186, 185, 1, 1, 1] [2018-10-01 00:47:49,023 INFO L423 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:49,024 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:49,024 INFO L82 PathProgramCache]: Analyzing trace with hash 295963953, now seen corresponding path program 185 times [2018-10-01 00:47:49,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:49,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:49,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 34410 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:51,413 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:51,413 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:51,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:47:52,364 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 186 check-sat command(s) [2018-10-01 00:47:52,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:52,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 34410 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:53,239 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:53,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187, 187] total 187 [2018-10-01 00:47:53,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-10-01 00:47:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-10-01 00:47:53,243 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:53,243 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 188 states. [2018-10-01 00:47:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:56,136 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-10-01 00:47:56,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-01 00:47:56,137 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 374 [2018-10-01 00:47:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:56,138 INFO L225 Difference]: With dead ends: 379 [2018-10-01 00:47:56,138 INFO L226 Difference]: Without dead ends: 377 [2018-10-01 00:47:56,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:47:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-01 00:47:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-10-01 00:47:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-01 00:47:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-10-01 00:47:56,142 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 374 [2018-10-01 00:47:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:56,142 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-10-01 00:47:56,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-10-01 00:47:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-10-01 00:47:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-01 00:47:56,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:56,144 INFO L375 BasicCegarLoop]: trace histogram [187, 186, 1, 1, 1] [2018-10-01 00:47:56,144 INFO L423 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:56,144 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash 953569387, now seen corresponding path program 186 times [2018-10-01 00:47:56,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:56,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 34782 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:58,575 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:58,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:47:58,583 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:47:59,500 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 187 check-sat command(s) [2018-10-01 00:47:59,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:59,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 34782 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:00,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:00,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188, 188] total 188 [2018-10-01 00:48:00,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-10-01 00:48:00,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-10-01 00:48:00,359 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:00,359 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 189 states. [2018-10-01 00:48:04,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:04,344 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-10-01 00:48:04,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-01 00:48:04,345 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 376 [2018-10-01 00:48:04,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:04,346 INFO L225 Difference]: With dead ends: 381 [2018-10-01 00:48:04,346 INFO L226 Difference]: Without dead ends: 379 [2018-10-01 00:48:04,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:48:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-01 00:48:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-01 00:48:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-01 00:48:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-10-01 00:48:04,350 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 376 [2018-10-01 00:48:04,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:04,350 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-10-01 00:48:04,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-10-01 00:48:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-10-01 00:48:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-01 00:48:04,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:04,352 INFO L375 BasicCegarLoop]: trace histogram [188, 187, 1, 1, 1] [2018-10-01 00:48:04,352 INFO L423 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:04,352 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:04,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1552198949, now seen corresponding path program 187 times [2018-10-01 00:48:04,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:04,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:04,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:04,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 35156 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:06,911 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:06,911 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:06,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:48:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:07,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 35156 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:08,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:08,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189, 189] total 189 [2018-10-01 00:48:08,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-10-01 00:48:08,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-10-01 00:48:08,019 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:08,019 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 190 states. [2018-10-01 00:48:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:11,688 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-10-01 00:48:11,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-10-01 00:48:11,689 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 378 [2018-10-01 00:48:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:11,689 INFO L225 Difference]: With dead ends: 383 [2018-10-01 00:48:11,690 INFO L226 Difference]: Without dead ends: 381 [2018-10-01 00:48:11,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:48:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-01 00:48:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-01 00:48:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-01 00:48:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-10-01 00:48:11,694 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 378 [2018-10-01 00:48:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:11,694 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-10-01 00:48:11,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-10-01 00:48:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-10-01 00:48:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-01 00:48:11,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:11,695 INFO L375 BasicCegarLoop]: trace histogram [189, 188, 1, 1, 1] [2018-10-01 00:48:11,696 INFO L423 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:11,696 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:11,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1309590367, now seen corresponding path program 188 times [2018-10-01 00:48:11,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:11,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:11,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:11,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:48:11,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 35532 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:14,035 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:14,036 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:14,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:48:14,344 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:48:14,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:14,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 35532 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:15,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:15,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190, 190] total 190 [2018-10-01 00:48:15,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-10-01 00:48:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-10-01 00:48:15,163 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:15,163 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 191 states. [2018-10-01 00:48:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:17,287 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-10-01 00:48:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-01 00:48:17,288 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 380 [2018-10-01 00:48:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:17,288 INFO L225 Difference]: With dead ends: 385 [2018-10-01 00:48:17,288 INFO L226 Difference]: Without dead ends: 383 [2018-10-01 00:48:17,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:48:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-01 00:48:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-10-01 00:48:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-01 00:48:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-10-01 00:48:17,293 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 380 [2018-10-01 00:48:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:17,294 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-10-01 00:48:17,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-10-01 00:48:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-10-01 00:48:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-01 00:48:17,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:17,295 INFO L375 BasicCegarLoop]: trace histogram [190, 189, 1, 1, 1] [2018-10-01 00:48:17,295 INFO L423 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:17,295 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 90977049, now seen corresponding path program 189 times [2018-10-01 00:48:17,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:17,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:17,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:17,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:19,766 INFO L134 CoverageAnalysis]: Checked inductivity of 35910 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:19,767 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:19,767 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:19,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:48:20,804 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 190 check-sat command(s) [2018-10-01 00:48:20,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:20,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 35910 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:21,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:21,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191] total 191 [2018-10-01 00:48:21,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-10-01 00:48:21,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-10-01 00:48:21,798 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:21,798 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 192 states. [2018-10-01 00:48:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:25,570 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-10-01 00:48:25,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-01 00:48:25,571 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 382 [2018-10-01 00:48:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:25,572 INFO L225 Difference]: With dead ends: 387 [2018-10-01 00:48:25,572 INFO L226 Difference]: Without dead ends: 385 [2018-10-01 00:48:25,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:48:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-01 00:48:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-10-01 00:48:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-01 00:48:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2018-10-01 00:48:25,576 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 382 [2018-10-01 00:48:25,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:25,576 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2018-10-01 00:48:25,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-10-01 00:48:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2018-10-01 00:48:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-01 00:48:25,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:25,578 INFO L375 BasicCegarLoop]: trace histogram [191, 190, 1, 1, 1] [2018-10-01 00:48:25,578 INFO L423 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:25,578 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:25,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1529650259, now seen corresponding path program 190 times [2018-10-01 00:48:25,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:25,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:25,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:25,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:28,023 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:28,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:28,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:48:28,337 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:48:28,338 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:28,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:29,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:29,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 192] total 192 [2018-10-01 00:48:29,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-10-01 00:48:29,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-10-01 00:48:29,186 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:29,186 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 193 states. [2018-10-01 00:48:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:31,979 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-10-01 00:48:31,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-01 00:48:31,979 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 384 [2018-10-01 00:48:31,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:31,980 INFO L225 Difference]: With dead ends: 389 [2018-10-01 00:48:31,980 INFO L226 Difference]: Without dead ends: 387 [2018-10-01 00:48:31,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:48:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-01 00:48:31,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-10-01 00:48:31,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-01 00:48:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-10-01 00:48:31,986 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 384 [2018-10-01 00:48:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:31,987 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-10-01 00:48:31,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-10-01 00:48:31,987 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-10-01 00:48:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-01 00:48:31,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:31,988 INFO L375 BasicCegarLoop]: trace histogram [192, 191, 1, 1, 1] [2018-10-01 00:48:31,988 INFO L423 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:31,988 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:31,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1115135757, now seen corresponding path program 191 times [2018-10-01 00:48:31,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:31,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:31,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:31,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:31,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36672 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:34,551 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:34,551 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:34,564 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:48:35,581 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 192 check-sat command(s) [2018-10-01 00:48:35,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:35,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36672 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:36,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:36,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193] total 193 [2018-10-01 00:48:36,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-10-01 00:48:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-10-01 00:48:36,486 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:36,486 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 194 states. [2018-10-01 00:48:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:40,349 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-10-01 00:48:40,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-10-01 00:48:40,350 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 386 [2018-10-01 00:48:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:40,350 INFO L225 Difference]: With dead ends: 391 [2018-10-01 00:48:40,351 INFO L226 Difference]: Without dead ends: 389 [2018-10-01 00:48:40,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:48:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-01 00:48:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-10-01 00:48:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-01 00:48:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-01 00:48:40,355 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 386 [2018-10-01 00:48:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:40,356 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-01 00:48:40,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-10-01 00:48:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-01 00:48:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-01 00:48:40,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:40,358 INFO L375 BasicCegarLoop]: trace histogram [193, 192, 1, 1, 1] [2018-10-01 00:48:40,358 INFO L423 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:40,358 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:40,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2096309433, now seen corresponding path program 192 times [2018-10-01 00:48:40,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:40,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:40,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:40,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:40,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 37056 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:42,954 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:42,954 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:42,969 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:48:43,882 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 193 check-sat command(s) [2018-10-01 00:48:43,883 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:43,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 37056 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:44,669 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:44,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194, 194] total 194 [2018-10-01 00:48:44,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-10-01 00:48:44,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-10-01 00:48:44,674 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:44,674 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 195 states. [2018-10-01 00:48:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:46,946 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-01 00:48:46,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-01 00:48:46,947 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 388 [2018-10-01 00:48:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:46,947 INFO L225 Difference]: With dead ends: 393 [2018-10-01 00:48:46,947 INFO L226 Difference]: Without dead ends: 391 [2018-10-01 00:48:46,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 00:48:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-01 00:48:46,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-10-01 00:48:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-10-01 00:48:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-10-01 00:48:46,953 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 388 [2018-10-01 00:48:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:46,953 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-10-01 00:48:46,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-10-01 00:48:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-10-01 00:48:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-10-01 00:48:46,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:46,954 INFO L375 BasicCegarLoop]: trace histogram [194, 193, 1, 1, 1] [2018-10-01 00:48:46,955 INFO L423 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:46,955 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash -213651199, now seen corresponding path program 193 times [2018-10-01 00:48:46,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:46,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:46,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:46,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:46,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 37442 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:49,368 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:49,368 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:48:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:49,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 37442 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:50,480 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:50,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195, 195] total 195 [2018-10-01 00:48:50,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-10-01 00:48:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-10-01 00:48:50,484 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:50,484 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 196 states. [2018-10-01 00:48:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:54,909 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-10-01 00:48:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-10-01 00:48:54,909 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 390 [2018-10-01 00:48:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:54,910 INFO L225 Difference]: With dead ends: 395 [2018-10-01 00:48:54,910 INFO L226 Difference]: Without dead ends: 393 [2018-10-01 00:48:54,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 00:48:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-01 00:48:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-10-01 00:48:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-01 00:48:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-10-01 00:48:54,914 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 390 [2018-10-01 00:48:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:54,915 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-10-01 00:48:54,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-10-01 00:48:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-10-01 00:48:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-01 00:48:54,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:54,916 INFO L375 BasicCegarLoop]: trace histogram [195, 194, 1, 1, 1] [2018-10-01 00:48:54,916 INFO L423 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:54,917 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash 839680059, now seen corresponding path program 194 times [2018-10-01 00:48:54,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:54,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:54,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:48:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:48:57,565 INFO L134 CoverageAnalysis]: Checked inductivity of 37830 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:57,566 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:48:57,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:48:57,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:48:57,874 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:48:57,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:57,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 37830 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:58,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:58,652 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196, 196] total 196 [2018-10-01 00:48:58,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-10-01 00:48:58,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-10-01 00:48:58,656 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:58,656 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 197 states. [2018-10-01 00:49:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:02,944 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-10-01 00:49:02,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-01 00:49:02,944 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 392 [2018-10-01 00:49:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:02,945 INFO L225 Difference]: With dead ends: 397 [2018-10-01 00:49:02,945 INFO L226 Difference]: Without dead ends: 395 [2018-10-01 00:49:02,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:49:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-01 00:49:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-01 00:49:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-01 00:49:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-01 00:49:02,949 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 392 [2018-10-01 00:49:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:02,949 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-01 00:49:02,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-10-01 00:49:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-01 00:49:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-01 00:49:02,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:02,951 INFO L375 BasicCegarLoop]: trace histogram [196, 195, 1, 1, 1] [2018-10-01 00:49:02,951 INFO L423 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:02,951 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:02,951 INFO L82 PathProgramCache]: Analyzing trace with hash -521262859, now seen corresponding path program 195 times [2018-10-01 00:49:02,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:02,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:02,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 38220 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:05,681 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:05,681 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:05,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:49:06,829 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 196 check-sat command(s) [2018-10-01 00:49:06,829 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:06,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 38220 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:07,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:07,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197, 197] total 197 [2018-10-01 00:49:07,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-10-01 00:49:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-10-01 00:49:07,822 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:07,822 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 198 states. [2018-10-01 00:49:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:10,562 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-10-01 00:49:10,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-01 00:49:10,562 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 394 [2018-10-01 00:49:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:10,563 INFO L225 Difference]: With dead ends: 399 [2018-10-01 00:49:10,563 INFO L226 Difference]: Without dead ends: 397 [2018-10-01 00:49:10,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:49:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-01 00:49:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-10-01 00:49:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-10-01 00:49:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2018-10-01 00:49:10,567 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 394 [2018-10-01 00:49:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:10,568 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2018-10-01 00:49:10,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-10-01 00:49:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2018-10-01 00:49:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-01 00:49:10,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:10,569 INFO L375 BasicCegarLoop]: trace histogram [197, 196, 1, 1, 1] [2018-10-01 00:49:10,569 INFO L423 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:10,569 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1577618223, now seen corresponding path program 196 times [2018-10-01 00:49:10,570 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:10,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:10,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:10,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:10,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 38612 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:13,469 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:13,469 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:13,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:49:13,797 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:49:13,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:13,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 38612 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:14,712 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:14,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198, 198] total 198 [2018-10-01 00:49:14,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-10-01 00:49:14,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-10-01 00:49:14,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:14,715 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 199 states. [2018-10-01 00:49:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:17,136 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-01 00:49:17,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-01 00:49:17,136 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 396 [2018-10-01 00:49:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:17,137 INFO L225 Difference]: With dead ends: 401 [2018-10-01 00:49:17,137 INFO L226 Difference]: Without dead ends: 399 [2018-10-01 00:49:17,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:49:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-01 00:49:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-10-01 00:49:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-01 00:49:17,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2018-10-01 00:49:17,141 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 396 [2018-10-01 00:49:17,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:17,141 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 399 transitions. [2018-10-01 00:49:17,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-10-01 00:49:17,142 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 399 transitions. [2018-10-01 00:49:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-01 00:49:17,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:17,143 INFO L375 BasicCegarLoop]: trace histogram [198, 197, 1, 1, 1] [2018-10-01 00:49:17,143 INFO L423 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:17,143 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash -32291095, now seen corresponding path program 197 times [2018-10-01 00:49:17,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:17,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:17,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 39006 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:19,533 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:19,533 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:19,541 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:49:20,526 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 198 check-sat command(s) [2018-10-01 00:49:20,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:20,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 39006 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:21,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:21,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199, 199] total 199 [2018-10-01 00:49:21,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-10-01 00:49:21,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-10-01 00:49:21,426 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:21,426 INFO L87 Difference]: Start difference. First operand 399 states and 399 transitions. Second operand 200 states. [2018-10-01 00:49:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:23,836 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-10-01 00:49:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-01 00:49:23,836 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 398 [2018-10-01 00:49:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:23,837 INFO L225 Difference]: With dead ends: 403 [2018-10-01 00:49:23,837 INFO L226 Difference]: Without dead ends: 401 [2018-10-01 00:49:23,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:49:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-01 00:49:23,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2018-10-01 00:49:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-01 00:49:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-10-01 00:49:23,841 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 398 [2018-10-01 00:49:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:23,842 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-10-01 00:49:23,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-10-01 00:49:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-10-01 00:49:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-01 00:49:23,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:23,843 INFO L375 BasicCegarLoop]: trace histogram [199, 198, 1, 1, 1] [2018-10-01 00:49:23,843 INFO L423 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:23,843 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:23,843 INFO L82 PathProgramCache]: Analyzing trace with hash -966919133, now seen corresponding path program 198 times [2018-10-01 00:49:23,843 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:23,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:23,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:23,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:23,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 39402 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:26,556 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:26,556 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:26,563 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:49:27,535 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 199 check-sat command(s) [2018-10-01 00:49:27,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:27,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 39402 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:28,372 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:28,372 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200, 200] total 200 [2018-10-01 00:49:28,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-10-01 00:49:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-10-01 00:49:28,375 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:28,375 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 201 states. [2018-10-01 00:49:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:30,853 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-10-01 00:49:30,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-01 00:49:30,854 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 400 [2018-10-01 00:49:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:30,854 INFO L225 Difference]: With dead ends: 405 [2018-10-01 00:49:30,854 INFO L226 Difference]: Without dead ends: 403 [2018-10-01 00:49:30,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:49:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-01 00:49:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-10-01 00:49:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-01 00:49:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-01 00:49:30,859 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 400 [2018-10-01 00:49:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:30,859 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-01 00:49:30,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-10-01 00:49:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-01 00:49:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-01 00:49:30,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:30,861 INFO L375 BasicCegarLoop]: trace histogram [200, 199, 1, 1, 1] [2018-10-01 00:49:30,861 INFO L423 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:30,861 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1496298787, now seen corresponding path program 199 times [2018-10-01 00:49:30,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:30,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:30,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:30,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:30,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 39800 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:33,772 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:33,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:33,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:49:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:34,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 39800 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:34,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:34,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201, 201] total 201 [2018-10-01 00:49:34,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-10-01 00:49:34,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-10-01 00:49:34,931 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:34,931 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 202 states. [2018-10-01 00:49:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:37,878 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-10-01 00:49:37,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-10-01 00:49:37,878 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 402 [2018-10-01 00:49:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:37,879 INFO L225 Difference]: With dead ends: 407 [2018-10-01 00:49:37,879 INFO L226 Difference]: Without dead ends: 405 [2018-10-01 00:49:37,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:49:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-01 00:49:37,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2018-10-01 00:49:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-01 00:49:37,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-10-01 00:49:37,883 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 402 [2018-10-01 00:49:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:37,884 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-10-01 00:49:37,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-10-01 00:49:37,884 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-10-01 00:49:37,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-01 00:49:37,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:37,885 INFO L375 BasicCegarLoop]: trace histogram [201, 200, 1, 1, 1] [2018-10-01 00:49:37,885 INFO L423 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:37,885 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:37,885 INFO L82 PathProgramCache]: Analyzing trace with hash 870961943, now seen corresponding path program 200 times [2018-10-01 00:49:37,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:37,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:37,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:49:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 40200 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:40,870 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:40,870 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:40,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:49:41,203 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:49:41,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:41,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 40200 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:42,047 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:42,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202, 202] total 202 [2018-10-01 00:49:42,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-10-01 00:49:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-10-01 00:49:42,051 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:42,051 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 203 states. [2018-10-01 00:49:46,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:46,424 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-10-01 00:49:46,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-01 00:49:46,425 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 404 [2018-10-01 00:49:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:46,425 INFO L225 Difference]: With dead ends: 409 [2018-10-01 00:49:46,425 INFO L226 Difference]: Without dead ends: 407 [2018-10-01 00:49:46,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time [2018-10-01 00:49:46,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-01 00:49:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-10-01 00:49:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-01 00:49:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-10-01 00:49:46,430 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 404 [2018-10-01 00:49:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:46,430 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-10-01 00:49:46,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-10-01 00:49:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-10-01 00:49:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-01 00:49:46,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:46,432 INFO L375 BasicCegarLoop]: trace histogram [202, 201, 1, 1, 1] [2018-10-01 00:49:46,432 INFO L423 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:46,432 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:46,432 INFO L82 PathProgramCache]: Analyzing trace with hash -524143407, now seen corresponding path program 201 times [2018-10-01 00:49:46,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:46,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:46,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:46,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:46,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 40602 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:49,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:49,364 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:49,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:49:50,542 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 202 check-sat command(s) [2018-10-01 00:49:50,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:50,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 40602 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:51,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:51,394 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203, 203] total 203 [2018-10-01 00:49:51,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-10-01 00:49:51,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-10-01 00:49:51,397 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:51,397 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 204 states. [2018-10-01 00:49:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:56,709 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2018-10-01 00:49:56,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-01 00:49:56,709 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 406 [2018-10-01 00:49:56,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:56,710 INFO L225 Difference]: With dead ends: 411 [2018-10-01 00:49:56,710 INFO L226 Difference]: Without dead ends: 409 [2018-10-01 00:49:56,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:49:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-10-01 00:49:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-10-01 00:49:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-01 00:49:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 409 transitions. [2018-10-01 00:49:56,714 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 409 transitions. Word has length 406 [2018-10-01 00:49:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:56,714 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 409 transitions. [2018-10-01 00:49:56,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-10-01 00:49:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 409 transitions. [2018-10-01 00:49:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-01 00:49:56,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:56,716 INFO L375 BasicCegarLoop]: trace histogram [203, 202, 1, 1, 1] [2018-10-01 00:49:56,716 INFO L423 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:56,716 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1190588405, now seen corresponding path program 202 times [2018-10-01 00:49:56,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:56,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:56,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:56,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:56,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 41006 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:59,787 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:59,788 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:59,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:50:00,110 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:50:00,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:00,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 41006 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:00,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:00,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204, 204] total 204 [2018-10-01 00:50:00,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-10-01 00:50:00,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-10-01 00:50:00,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:00,955 INFO L87 Difference]: Start difference. First operand 409 states and 409 transitions. Second operand 205 states. [2018-10-01 00:50:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:03,741 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-10-01 00:50:03,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-10-01 00:50:03,741 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 408 [2018-10-01 00:50:03,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:03,742 INFO L225 Difference]: With dead ends: 413 [2018-10-01 00:50:03,742 INFO L226 Difference]: Without dead ends: 411 [2018-10-01 00:50:03,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:50:03,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-01 00:50:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-10-01 00:50:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-01 00:50:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-10-01 00:50:03,748 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 408 [2018-10-01 00:50:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:03,748 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-10-01 00:50:03,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-10-01 00:50:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-10-01 00:50:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-01 00:50:03,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:03,751 INFO L375 BasicCegarLoop]: trace histogram [204, 203, 1, 1, 1] [2018-10-01 00:50:03,751 INFO L423 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:03,751 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:03,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1694104379, now seen corresponding path program 203 times [2018-10-01 00:50:03,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:03,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:03,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:03,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 41412 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:06,575 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:06,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:06,583 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:50:07,619 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 204 check-sat command(s) [2018-10-01 00:50:07,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:07,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 41412 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:08,734 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:08,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205, 205] total 205 [2018-10-01 00:50:08,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-10-01 00:50:08,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-10-01 00:50:08,737 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:08,737 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 206 states. [2018-10-01 00:50:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:11,656 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-10-01 00:50:11,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-01 00:50:11,656 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 410 [2018-10-01 00:50:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:11,657 INFO L225 Difference]: With dead ends: 415 [2018-10-01 00:50:11,657 INFO L226 Difference]: Without dead ends: 413 [2018-10-01 00:50:11,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:50:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-01 00:50:11,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-10-01 00:50:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-01 00:50:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 413 transitions. [2018-10-01 00:50:11,662 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 413 transitions. Word has length 410 [2018-10-01 00:50:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:11,662 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 413 transitions. [2018-10-01 00:50:11,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-10-01 00:50:11,662 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 413 transitions. [2018-10-01 00:50:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-01 00:50:11,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:11,664 INFO L375 BasicCegarLoop]: trace histogram [205, 204, 1, 1, 1] [2018-10-01 00:50:11,664 INFO L423 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:11,664 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash -241650945, now seen corresponding path program 204 times [2018-10-01 00:50:11,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:11,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:11,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:11,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:11,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 41820 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:14,849 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:14,849 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:14,857 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:50:15,949 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 205 check-sat command(s) [2018-10-01 00:50:15,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:15,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 41820 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:16,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:16,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206, 206] total 206 [2018-10-01 00:50:16,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-10-01 00:50:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-10-01 00:50:16,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:16,795 INFO L87 Difference]: Start difference. First operand 413 states and 413 transitions. Second operand 207 states. [2018-10-01 00:50:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:21,766 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-10-01 00:50:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-01 00:50:21,766 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 412 [2018-10-01 00:50:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:21,767 INFO L225 Difference]: With dead ends: 417 [2018-10-01 00:50:21,767 INFO L226 Difference]: Without dead ends: 415 [2018-10-01 00:50:21,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:50:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-01 00:50:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-10-01 00:50:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-01 00:50:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 415 transitions. [2018-10-01 00:50:21,772 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 415 transitions. Word has length 412 [2018-10-01 00:50:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:21,773 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 415 transitions. [2018-10-01 00:50:21,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-10-01 00:50:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 415 transitions. [2018-10-01 00:50:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-01 00:50:21,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:21,774 INFO L375 BasicCegarLoop]: trace histogram [206, 205, 1, 1, 1] [2018-10-01 00:50:21,774 INFO L423 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:21,774 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash -298272071, now seen corresponding path program 205 times [2018-10-01 00:50:21,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:21,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:21,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:21,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:21,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:25,011 INFO L134 CoverageAnalysis]: Checked inductivity of 42230 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:25,012 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:25,012 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:25,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:50:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:25,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 42230 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:26,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:26,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207, 207] total 207 [2018-10-01 00:50:26,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-10-01 00:50:26,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-10-01 00:50:26,215 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:26,215 INFO L87 Difference]: Start difference. First operand 415 states and 415 transitions. Second operand 208 states. [2018-10-01 00:50:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:29,923 INFO L93 Difference]: Finished difference Result 419 states and 419 transitions. [2018-10-01 00:50:29,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-10-01 00:50:29,923 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 414 [2018-10-01 00:50:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:29,924 INFO L225 Difference]: With dead ends: 419 [2018-10-01 00:50:29,924 INFO L226 Difference]: Without dead ends: 417 [2018-10-01 00:50:29,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:50:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-01 00:50:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-10-01 00:50:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-01 00:50:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2018-10-01 00:50:29,929 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 414 [2018-10-01 00:50:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:29,930 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2018-10-01 00:50:29,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-10-01 00:50:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2018-10-01 00:50:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-01 00:50:29,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:29,931 INFO L375 BasicCegarLoop]: trace histogram [207, 206, 1, 1, 1] [2018-10-01 00:50:29,932 INFO L423 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:29,932 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:29,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1123400691, now seen corresponding path program 206 times [2018-10-01 00:50:29,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:29,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:29,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:29,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:50:29,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 42642 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:33,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:33,161 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:33,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:50:33,509 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:50:33,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:33,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 42642 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:34,556 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:34,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208, 208] total 208 [2018-10-01 00:50:34,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-10-01 00:50:34,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-10-01 00:50:34,561 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:34,561 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 209 states. [2018-10-01 00:50:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:38,102 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-01 00:50:38,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-01 00:50:38,102 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 416 [2018-10-01 00:50:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:38,103 INFO L225 Difference]: With dead ends: 421 [2018-10-01 00:50:38,103 INFO L226 Difference]: Without dead ends: 419 [2018-10-01 00:50:38,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:50:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-01 00:50:38,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-10-01 00:50:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-01 00:50:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 419 transitions. [2018-10-01 00:50:38,108 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 419 transitions. Word has length 416 [2018-10-01 00:50:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:38,108 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 419 transitions. [2018-10-01 00:50:38,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-10-01 00:50:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 419 transitions. [2018-10-01 00:50:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-01 00:50:38,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:38,109 INFO L375 BasicCegarLoop]: trace histogram [208, 207, 1, 1, 1] [2018-10-01 00:50:38,110 INFO L423 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:38,110 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:38,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1551324845, now seen corresponding path program 207 times [2018-10-01 00:50:38,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:38,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:38,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:38,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:38,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 43056 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:41,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:41,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 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:41,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:50:42,470 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 208 check-sat command(s) [2018-10-01 00:50:42,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:42,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 43056 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:43,348 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:43,348 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209, 209] total 209 [2018-10-01 00:50:43,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-10-01 00:50:43,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-10-01 00:50:43,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:43,351 INFO L87 Difference]: Start difference. First operand 419 states and 419 transitions. Second operand 210 states. [2018-10-01 00:50:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:48,067 INFO L93 Difference]: Finished difference Result 423 states and 423 transitions. [2018-10-01 00:50:48,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-01 00:50:48,068 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 418 [2018-10-01 00:50:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:48,068 INFO L225 Difference]: With dead ends: 423 [2018-10-01 00:50:48,068 INFO L226 Difference]: Without dead ends: 421 [2018-10-01 00:50:48,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:50:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-01 00:50:48,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2018-10-01 00:50:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-01 00:50:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2018-10-01 00:50:48,072 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 418 [2018-10-01 00:50:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:48,073 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2018-10-01 00:50:48,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-10-01 00:50:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2018-10-01 00:50:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-10-01 00:50:48,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:48,074 INFO L375 BasicCegarLoop]: trace histogram [209, 208, 1, 1, 1] [2018-10-01 00:50:48,074 INFO L423 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:48,074 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:48,075 INFO L82 PathProgramCache]: Analyzing trace with hash 469576423, now seen corresponding path program 208 times [2018-10-01 00:50:48,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:48,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:48,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:48,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:48,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 43472 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:51,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:51,037 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:51,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:50:51,380 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:50:51,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:51,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:50:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 43472 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:52,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:50:52,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210, 210] total 210 [2018-10-01 00:50:52,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-10-01 00:50:52,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-10-01 00:50:52,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:50:52,252 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 211 states. [2018-10-01 00:50:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:50:55,811 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-10-01 00:50:55,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-10-01 00:50:55,812 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 420 [2018-10-01 00:50:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:50:55,812 INFO L225 Difference]: With dead ends: 425 [2018-10-01 00:50:55,813 INFO L226 Difference]: Without dead ends: 423 [2018-10-01 00:50:55,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:50:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-01 00:50:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-10-01 00:50:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-01 00:50:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-01 00:50:55,817 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 420 [2018-10-01 00:50:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:50:55,818 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-01 00:50:55,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-10-01 00:50:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-01 00:50:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-01 00:50:55,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:50:55,819 INFO L375 BasicCegarLoop]: trace histogram [210, 209, 1, 1, 1] [2018-10-01 00:50:55,819 INFO L423 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:50:55,819 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:50:55,820 INFO L82 PathProgramCache]: Analyzing trace with hash 291428513, now seen corresponding path program 209 times [2018-10-01 00:50:55,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:50:55,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:50:55,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:55,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:50:55,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:50:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:50:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 43890 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:50:58,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:50:58,811 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:50:58,818 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:50:59,935 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 210 check-sat command(s) [2018-10-01 00:50:59,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:50:59,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 43890 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:00,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:00,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211, 211] total 211 [2018-10-01 00:51:00,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-10-01 00:51:00,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-10-01 00:51:00,803 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:00,803 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 212 states. [2018-10-01 00:51:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:03,700 INFO L93 Difference]: Finished difference Result 427 states and 427 transitions. [2018-10-01 00:51:03,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-01 00:51:03,701 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 422 [2018-10-01 00:51:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:03,701 INFO L225 Difference]: With dead ends: 427 [2018-10-01 00:51:03,701 INFO L226 Difference]: Without dead ends: 425 [2018-10-01 00:51:03,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:51:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-01 00:51:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-10-01 00:51:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-01 00:51:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 425 transitions. [2018-10-01 00:51:03,706 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 425 transitions. Word has length 422 [2018-10-01 00:51:03,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:03,706 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 425 transitions. [2018-10-01 00:51:03,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-10-01 00:51:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 425 transitions. [2018-10-01 00:51:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-01 00:51:03,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:03,708 INFO L375 BasicCegarLoop]: trace histogram [211, 210, 1, 1, 1] [2018-10-01 00:51:03,708 INFO L423 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:03,708 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash 889978843, now seen corresponding path program 210 times [2018-10-01 00:51:03,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:03,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:03,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:03,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 44310 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:07,591 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:07,591 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:07,599 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:51:08,777 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 211 check-sat command(s) [2018-10-01 00:51:08,778 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:08,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 44310 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:09,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:09,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212, 212] total 212 [2018-10-01 00:51:09,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-10-01 00:51:09,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-10-01 00:51:09,768 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:09,768 INFO L87 Difference]: Start difference. First operand 425 states and 425 transitions. Second operand 213 states. [2018-10-01 00:51:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:14,723 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-10-01 00:51:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-01 00:51:14,724 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 424 [2018-10-01 00:51:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:14,725 INFO L225 Difference]: With dead ends: 429 [2018-10-01 00:51:14,725 INFO L226 Difference]: Without dead ends: 427 [2018-10-01 00:51:14,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time [2018-10-01 00:51:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-01 00:51:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-10-01 00:51:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-01 00:51:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2018-10-01 00:51:14,730 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 424 [2018-10-01 00:51:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:14,730 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2018-10-01 00:51:14,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-10-01 00:51:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2018-10-01 00:51:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-01 00:51:14,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:14,732 INFO L375 BasicCegarLoop]: trace histogram [212, 211, 1, 1, 1] [2018-10-01 00:51:14,732 INFO L423 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:14,732 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 571228309, now seen corresponding path program 211 times [2018-10-01 00:51:14,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:14,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:14,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:14,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:14,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 44732 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:18,292 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:18,292 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:18,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:51:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:18,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 44732 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:19,549 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:19,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213, 213] total 213 [2018-10-01 00:51:19,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-10-01 00:51:19,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-10-01 00:51:19,554 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:19,554 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 214 states. [2018-10-01 00:51:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:24,868 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2018-10-01 00:51:24,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-10-01 00:51:24,869 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 426 [2018-10-01 00:51:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:24,869 INFO L225 Difference]: With dead ends: 431 [2018-10-01 00:51:24,869 INFO L226 Difference]: Without dead ends: 429 [2018-10-01 00:51:24,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:51:24,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-01 00:51:24,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-10-01 00:51:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-10-01 00:51:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 429 transitions. [2018-10-01 00:51:24,874 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 429 transitions. Word has length 426 [2018-10-01 00:51:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:24,874 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 429 transitions. [2018-10-01 00:51:24,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-10-01 00:51:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 429 transitions. [2018-10-01 00:51:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-01 00:51:24,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:24,876 INFO L375 BasicCegarLoop]: trace histogram [213, 212, 1, 1, 1] [2018-10-01 00:51:24,876 INFO L423 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:24,876 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash -805356849, now seen corresponding path program 212 times [2018-10-01 00:51:24,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:24,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:24,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:24,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:51:24,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:27,961 INFO L134 CoverageAnalysis]: Checked inductivity of 45156 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:27,961 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:27,961 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:27,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:51:28,314 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:51:28,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:28,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 45156 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:29,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:29,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214, 214] total 214 [2018-10-01 00:51:29,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-10-01 00:51:29,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-10-01 00:51:29,219 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:29,219 INFO L87 Difference]: Start difference. First operand 429 states and 429 transitions. Second operand 215 states. [2018-10-01 00:51:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:33,800 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-10-01 00:51:33,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-01 00:51:33,801 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 428 [2018-10-01 00:51:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:33,801 INFO L225 Difference]: With dead ends: 433 [2018-10-01 00:51:33,801 INFO L226 Difference]: Without dead ends: 431 [2018-10-01 00:51:33,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 00:51:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-01 00:51:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-10-01 00:51:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-01 00:51:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-10-01 00:51:33,806 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 428 [2018-10-01 00:51:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:33,807 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-10-01 00:51:33,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-10-01 00:51:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-10-01 00:51:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-01 00:51:33,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:33,808 INFO L375 BasicCegarLoop]: trace histogram [214, 213, 1, 1, 1] [2018-10-01 00:51:33,808 INFO L423 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:33,809 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash -853766519, now seen corresponding path program 213 times [2018-10-01 00:51:33,809 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:33,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:33,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:33,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:33,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 45582 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:37,111 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:37,111 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:37,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:51:38,312 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 214 check-sat command(s) [2018-10-01 00:51:38,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:38,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 45582 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:39,186 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:39,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215, 215] total 215 [2018-10-01 00:51:39,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-10-01 00:51:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-10-01 00:51:39,190 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:39,190 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 216 states. [2018-10-01 00:51:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:42,907 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2018-10-01 00:51:42,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-01 00:51:42,908 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 430 [2018-10-01 00:51:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:42,908 INFO L225 Difference]: With dead ends: 435 [2018-10-01 00:51:42,908 INFO L226 Difference]: Without dead ends: 433 [2018-10-01 00:51:42,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:51:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-01 00:51:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-10-01 00:51:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-10-01 00:51:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 433 transitions. [2018-10-01 00:51:42,914 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 433 transitions. Word has length 430 [2018-10-01 00:51:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:42,914 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 433 transitions. [2018-10-01 00:51:42,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-10-01 00:51:42,914 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 433 transitions. [2018-10-01 00:51:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-01 00:51:42,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:42,916 INFO L375 BasicCegarLoop]: trace histogram [215, 214, 1, 1, 1] [2018-10-01 00:51:42,916 INFO L423 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:42,916 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash -130819133, now seen corresponding path program 214 times [2018-10-01 00:51:42,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:42,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:42,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 46010 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:45,875 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:45,875 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:45,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:51:46,220 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:51:46,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:46,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 46010 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:47,089 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:47,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216, 216] total 216 [2018-10-01 00:51:47,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-10-01 00:51:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-10-01 00:51:47,093 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:47,093 INFO L87 Difference]: Start difference. First operand 433 states and 433 transitions. Second operand 217 states. [2018-10-01 00:51:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:51,123 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-10-01 00:51:51,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-10-01 00:51:51,124 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 432 [2018-10-01 00:51:51,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:51,124 INFO L225 Difference]: With dead ends: 437 [2018-10-01 00:51:51,124 INFO L226 Difference]: Without dead ends: 435 [2018-10-01 00:51:51,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:51:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-10-01 00:51:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-10-01 00:51:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-01 00:51:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2018-10-01 00:51:51,131 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 432 [2018-10-01 00:51:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:51,131 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 435 transitions. [2018-10-01 00:51:51,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-10-01 00:51:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 435 transitions. [2018-10-01 00:51:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-01 00:51:51,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:51,133 INFO L375 BasicCegarLoop]: trace histogram [216, 215, 1, 1, 1] [2018-10-01 00:51:51,134 INFO L423 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:51,134 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1163083139, now seen corresponding path program 215 times [2018-10-01 00:51:51,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:51,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:51,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:51,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:51,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:51:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 46440 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:54,350 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:51:54,350 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:51:54,358 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:51:55,538 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 216 check-sat command(s) [2018-10-01 00:51:55,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:51:55,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:51:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 46440 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:51:56,631 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:51:56,632 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217, 217] total 217 [2018-10-01 00:51:56,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-10-01 00:51:56,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-10-01 00:51:56,635 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:51:56,635 INFO L87 Difference]: Start difference. First operand 435 states and 435 transitions. Second operand 218 states. [2018-10-01 00:51:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:51:59,709 INFO L93 Difference]: Finished difference Result 439 states and 439 transitions. [2018-10-01 00:51:59,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-10-01 00:51:59,709 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 434 [2018-10-01 00:51:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:51:59,710 INFO L225 Difference]: With dead ends: 439 [2018-10-01 00:51:59,710 INFO L226 Difference]: Without dead ends: 437 [2018-10-01 00:51:59,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:51:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-01 00:51:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-10-01 00:51:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-10-01 00:51:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 437 transitions. [2018-10-01 00:51:59,715 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 437 transitions. Word has length 434 [2018-10-01 00:51:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:51:59,715 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 437 transitions. [2018-10-01 00:51:59,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-10-01 00:51:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 437 transitions. [2018-10-01 00:51:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-01 00:51:59,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:51:59,717 INFO L375 BasicCegarLoop]: trace histogram [217, 216, 1, 1, 1] [2018-10-01 00:51:59,717 INFO L423 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:51:59,717 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:51:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1031347529, now seen corresponding path program 216 times [2018-10-01 00:51:59,717 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:51:59,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:51:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:51:59,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:51:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 46872 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:03,266 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:03,266 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:03,273 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:52:04,519 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 217 check-sat command(s) [2018-10-01 00:52:04,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:04,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 46872 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:05,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:05,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218, 218] total 218 [2018-10-01 00:52:05,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-10-01 00:52:05,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-10-01 00:52:05,464 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:05,464 INFO L87 Difference]: Start difference. First operand 437 states and 437 transitions. Second operand 219 states. [2018-10-01 00:52:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:11,906 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-10-01 00:52:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-01 00:52:11,906 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 436 [2018-10-01 00:52:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:11,907 INFO L225 Difference]: With dead ends: 441 [2018-10-01 00:52:11,907 INFO L226 Difference]: Without dead ends: 439 [2018-10-01 00:52:11,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:52:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-01 00:52:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-10-01 00:52:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-01 00:52:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 439 transitions. [2018-10-01 00:52:11,912 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 439 transitions. Word has length 436 [2018-10-01 00:52:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:11,912 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 439 transitions. [2018-10-01 00:52:11,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-10-01 00:52:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 439 transitions. [2018-10-01 00:52:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-01 00:52:11,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:11,914 INFO L375 BasicCegarLoop]: trace histogram [218, 217, 1, 1, 1] [2018-10-01 00:52:11,914 INFO L423 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:11,914 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1012522097, now seen corresponding path program 217 times [2018-10-01 00:52:11,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:11,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:11,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:11,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:11,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 47306 backedges. 0 proven. 47306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:15,216 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:15,216 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:15,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:15,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 47306 backedges. 0 proven. 47306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:16,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:16,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219, 219] total 219 [2018-10-01 00:52:16,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-10-01 00:52:16,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-10-01 00:52:16,620 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:16,620 INFO L87 Difference]: Start difference. First operand 439 states and 439 transitions. Second operand 220 states. [2018-10-01 00:52:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:21,883 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-10-01 00:52:21,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-01 00:52:21,883 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 438 [2018-10-01 00:52:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:21,884 INFO L225 Difference]: With dead ends: 443 [2018-10-01 00:52:21,884 INFO L226 Difference]: Without dead ends: 441 [2018-10-01 00:52:21,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:52:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-10-01 00:52:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2018-10-01 00:52:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-10-01 00:52:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 441 transitions. [2018-10-01 00:52:21,889 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 441 transitions. Word has length 438 [2018-10-01 00:52:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:21,889 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 441 transitions. [2018-10-01 00:52:21,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-10-01 00:52:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 441 transitions. [2018-10-01 00:52:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-01 00:52:21,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:21,891 INFO L375 BasicCegarLoop]: trace histogram [219, 218, 1, 1, 1] [2018-10-01 00:52:21,891 INFO L423 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:21,891 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:21,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1923788885, now seen corresponding path program 218 times [2018-10-01 00:52:21,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:21,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:21,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:52:21,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 47742 backedges. 0 proven. 47742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:25,374 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:25,374 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:25,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:52:25,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:52:25,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:25,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 47742 backedges. 0 proven. 47742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:26,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:26,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220, 220] total 220 [2018-10-01 00:52:26,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-10-01 00:52:26,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-10-01 00:52:26,614 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:26,614 INFO L87 Difference]: Start difference. First operand 441 states and 441 transitions. Second operand 221 states. [2018-10-01 00:52:30,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:30,714 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-10-01 00:52:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-01 00:52:30,715 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 440 [2018-10-01 00:52:30,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:30,715 INFO L225 Difference]: With dead ends: 445 [2018-10-01 00:52:30,715 INFO L226 Difference]: Without dead ends: 443 [2018-10-01 00:52:30,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:52:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-01 00:52:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-10-01 00:52:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-01 00:52:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-01 00:52:30,722 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 440 [2018-10-01 00:52:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:30,722 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-01 00:52:30,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-10-01 00:52:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-01 00:52:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-01 00:52:30,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:30,724 INFO L375 BasicCegarLoop]: trace histogram [220, 219, 1, 1, 1] [2018-10-01 00:52:30,724 INFO L423 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:30,724 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1925129115, now seen corresponding path program 219 times [2018-10-01 00:52:30,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:30,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:30,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:30,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:30,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 48180 backedges. 0 proven. 48180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:34,007 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:34,007 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:34,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:52:35,279 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 220 check-sat command(s) [2018-10-01 00:52:35,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:35,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 48180 backedges. 0 proven. 48180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:36,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:36,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221, 221] total 221 [2018-10-01 00:52:36,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-10-01 00:52:36,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-10-01 00:52:36,229 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:36,229 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 222 states. [2018-10-01 00:52:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:40,896 INFO L93 Difference]: Finished difference Result 447 states and 447 transitions. [2018-10-01 00:52:40,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-10-01 00:52:40,897 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 442 [2018-10-01 00:52:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:40,897 INFO L225 Difference]: With dead ends: 447 [2018-10-01 00:52:40,898 INFO L226 Difference]: Without dead ends: 445 [2018-10-01 00:52:40,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:52:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-01 00:52:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2018-10-01 00:52:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-01 00:52:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 445 transitions. [2018-10-01 00:52:40,902 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 445 transitions. Word has length 442 [2018-10-01 00:52:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:40,903 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 445 transitions. [2018-10-01 00:52:40,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-10-01 00:52:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 445 transitions. [2018-10-01 00:52:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-01 00:52:40,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:40,904 INFO L375 BasicCegarLoop]: trace histogram [221, 220, 1, 1, 1] [2018-10-01 00:52:40,905 INFO L423 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:40,905 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1081877151, now seen corresponding path program 220 times [2018-10-01 00:52:40,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:40,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:40,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 48620 backedges. 0 proven. 48620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:44,419 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:44,419 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:44,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:52:44,790 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:52:44,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:44,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 48620 backedges. 0 proven. 48620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:45,746 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:45,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [222, 222] total 222 [2018-10-01 00:52:45,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 223 states [2018-10-01 00:52:45,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2018-10-01 00:52:45,751 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:45,751 INFO L87 Difference]: Start difference. First operand 445 states and 445 transitions. Second operand 223 states. [2018-10-01 00:52:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:50,605 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-01 00:52:50,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-10-01 00:52:50,605 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 444 [2018-10-01 00:52:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:50,606 INFO L225 Difference]: With dead ends: 449 [2018-10-01 00:52:50,606 INFO L226 Difference]: Without dead ends: 447 [2018-10-01 00:52:50,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 00:52:50,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-01 00:52:50,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-10-01 00:52:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-01 00:52:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2018-10-01 00:52:50,611 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 444 [2018-10-01 00:52:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:50,611 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 447 transitions. [2018-10-01 00:52:50,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 223 states. [2018-10-01 00:52:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 447 transitions. [2018-10-01 00:52:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-10-01 00:52:50,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:50,613 INFO L375 BasicCegarLoop]: trace histogram [222, 221, 1, 1, 1] [2018-10-01 00:52:50,613 INFO L423 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:50,613 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 301908569, now seen corresponding path program 221 times [2018-10-01 00:52:50,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:50,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:50,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 49062 backedges. 0 proven. 49062 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:54,328 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:54,328 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:52:54,336 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:52:55,663 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 222 check-sat command(s) [2018-10-01 00:52:55,663 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:55,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 49062 backedges. 0 proven. 49062 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:56,594 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:56,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223, 223] total 223 [2018-10-01 00:52:56,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-10-01 00:52:56,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-10-01 00:52:56,598 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:56,598 INFO L87 Difference]: Start difference. First operand 447 states and 447 transitions. Second operand 224 states. [2018-10-01 00:53:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:01,212 INFO L93 Difference]: Finished difference Result 451 states and 451 transitions. [2018-10-01 00:53:01,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-10-01 00:53:01,212 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 446 [2018-10-01 00:53:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:01,213 INFO L225 Difference]: With dead ends: 451 [2018-10-01 00:53:01,213 INFO L226 Difference]: Without dead ends: 449 [2018-10-01 00:53:01,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 446 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 00:53:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-01 00:53:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2018-10-01 00:53:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-10-01 00:53:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 449 transitions. [2018-10-01 00:53:01,220 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 449 transitions. Word has length 446 [2018-10-01 00:53:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:01,220 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 449 transitions. [2018-10-01 00:53:01,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-10-01 00:53:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 449 transitions. [2018-10-01 00:53:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-01 00:53:01,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:01,222 INFO L375 BasicCegarLoop]: trace histogram [223, 222, 1, 1, 1] [2018-10-01 00:53:01,223 INFO L423 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:01,223 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1923589229, now seen corresponding path program 222 times [2018-10-01 00:53:01,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:01,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:01,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:01,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:01,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:53:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 49506 backedges. 0 proven. 49506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:04,455 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:53:04,455 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:53:04,462 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:53:05,764 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 223 check-sat command(s) [2018-10-01 00:53:05,765 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:53:05,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:53:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 49506 backedges. 0 proven. 49506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:53:06,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:53:06,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [224, 224] total 224 [2018-10-01 00:53:06,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 225 states [2018-10-01 00:53:06,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2018-10-01 00:53:06,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:53:06,759 INFO L87 Difference]: Start difference. First operand 449 states and 449 transitions. Second operand 225 states. [2018-10-01 00:53:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:53:13,011 INFO L93 Difference]: Finished difference Result 453 states and 453 transitions. [2018-10-01 00:53:13,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-10-01 00:53:13,011 INFO L78 Accepts]: Start accepts. Automaton has 225 states. Word has length 448 [2018-10-01 00:53:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:53:13,012 INFO L225 Difference]: With dead ends: 453 [2018-10-01 00:53:13,012 INFO L226 Difference]: Without dead ends: 451 [2018-10-01 00:53:13,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 00:53:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-10-01 00:53:13,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2018-10-01 00:53:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-01 00:53:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-01 00:53:13,017 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 448 [2018-10-01 00:53:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:53:13,018 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-01 00:53:13,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 225 states. [2018-10-01 00:53:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-01 00:53:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-01 00:53:13,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:53:13,019 INFO L375 BasicCegarLoop]: trace histogram [224, 223, 1, 1, 1] [2018-10-01 00:53:13,020 INFO L423 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:53:13,020 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:53:13,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1733259699, now seen corresponding path program 223 times [2018-10-01 00:53:13,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:53:13,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:53:13,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:13,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:53:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:53:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-01 00:53:15,408 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 00:53:15,412 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 00:53:15,413 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 12:53:15 BoogieIcfgContainer [2018-10-01 00:53:15,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 00:53:15,519 INFO L168 Benchmark]: Toolchain (without parser) took 804544.22 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -754.0 MB). Peak memory consumption was 836.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:53:15,522 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 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-10-01 00:53:15,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.49 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-10-01 00:53:15,522 INFO L168 Benchmark]: Boogie Preprocessor took 22.47 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-10-01 00:53:15,523 INFO L168 Benchmark]: RCFGBuilder took 314.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 00:53:15,523 INFO L168 Benchmark]: TraceAbstraction took 804162.03 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -775.2 MB). Peak memory consumption was 815.5 MB. Max. memory is 7.1 GB. [2018-10-01 00:53:15,527 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.25 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 39.49 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 22.47 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 314.50 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 804162.03 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -775.2 MB). Peak memory consumption was 815.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 451 with TraceHistMax 224, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 449 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 804.0s OverallTime, 224 OverallIterations, 224 TraceHistogramMax, 325.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 892 SDtfs, 0 SDslu, 33310 SDs, 0 SdLazy, 33533 SolverSat, 582 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75371 GetRequests, 50395 SyntacticMatches, 0 SemanticMatches, 24976 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 262.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=451occurred in iteration=223, 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: 0.8s AutomataMinimizationTime, 223 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 7.4s SsaConstructionTime, 143.8s SatisfiabilityAnalysisTime, 304.5s InterpolantComputationTime, 100792 NumberOfCodeBlocks, 100792 NumberOfCodeBlocksAsserted, 13025 NumberOfCheckSat, 100347 ConstructedInterpolants, 0 QuantifiedInterpolants, 89714217 SizeOfPredicates, 665 NumberOfNonLiveVariables, 300366 ConjunctsInSsa, 26303 ConjunctsInUnsatCore, 445 InterpolantComputations, 1 PerfectInterpolantSequences, 0/7392896 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/count_by_nondet.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_00-53-15-538.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_nondet.i_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_00-53-15-538.csv Completed graceful shutdown