java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:28:38,646 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:28:38,648 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:28:38,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:28:38,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:28:38,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:28:38,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:28:38,667 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:28:38,668 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:28:38,669 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:28:38,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:28:38,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:28:38,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:28:38,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:28:38,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:28:38,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:28:38,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:28:38,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:28:38,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:28:38,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:28:38,682 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:28:38,683 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:28:38,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:28:38,685 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:28:38,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:28:38,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:28:38,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:28:38,688 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:28:38,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:28:38,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:28:38,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:28:38,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:28:38,691 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:28:38,692 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:28:38,693 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:28:38,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:28:38,694 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:28:38,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:28:38,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:28:38,710 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:28:38,710 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:28:38,711 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:28:38,711 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:28:38,711 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:28:38,711 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:28:38,712 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:28:38,712 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:28:38,712 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:28:38,712 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:28:38,712 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:28:38,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:28:38,713 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:28:38,713 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:28:38,713 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:28:38,713 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:28:38,713 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:28:38,714 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:28:38,714 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:28:38,714 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:28:38,714 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:28:38,714 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:28:38,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:28:38,715 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:28:38,715 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:28:38,715 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:28:38,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:28:38,715 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:28:38,758 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:28:38,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:28:38,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:28:38,783 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:28:38,783 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:28:38,784 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2018-10-04 12:28:38,784 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2018-10-04 12:28:38,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:28:38,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:28:38,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:38,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:28:38,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:28:38,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/1) ... [2018-10-04 12:28:38,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/1) ... [2018-10-04 12:28:38,871 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:28:38,871 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:28:38,872 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:28:38,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:38,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:28:38,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:28:38,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:28:38,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/1) ... [2018-10-04 12:28:38,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/1) ... [2018-10-04 12:28:38,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/1) ... [2018-10-04 12:28:38,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/1) ... [2018-10-04 12:28:38,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/1) ... [2018-10-04 12:28:38,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/1) ... [2018-10-04 12:28:38,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/1) ... [2018-10-04 12:28:38,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:28:38,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:28:38,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:28:38,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:28:38,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (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-04 12:28:38,958 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:28:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:28:38,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:28:39,194 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:28:39,194 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:39 BoogieIcfgContainer [2018-10-04 12:28:39,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:28:39,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:28:39,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:28:39,199 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:28:39,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:28:38" (1/2) ... [2018-10-04 12:28:39,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec0af70 and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:28:39, skipping insertion in model container [2018-10-04 12:28:39,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:28:39" (2/2) ... [2018-10-04 12:28:39,202 INFO L112 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2018-10-04 12:28:39,213 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:28:39,220 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:28:39,270 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:28:39,271 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:28:39,271 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:28:39,271 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:28:39,271 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:28:39,272 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:28:39,272 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:28:39,272 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:28:39,272 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:28:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 12:28:39,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:28:39,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:39,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:28:39,294 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:39,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:39,301 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-10-04 12:28:39,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:39,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:39,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:39,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:39,447 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-04 12:28:39,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:39,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:28:39,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:39,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:39,468 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 12:28:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:39,545 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-10-04 12:28:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:39,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:28:39,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:39,557 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:28:39,557 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 12:28:39,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 12:28:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 12:28:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 12:28:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 12:28:39,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 12:28:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:39,593 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 12:28:39,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 12:28:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:28:39,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:39,594 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:28:39,594 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:39,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:39,594 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-10-04 12:28:39,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:39,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:39,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:39,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:39,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:39,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:39,729 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-04 12:28:39,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:39,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:39,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:39,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:28:39,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:28:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:28:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:28:39,884 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-04 12:28:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:39,933 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 12:28:39,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:28:39,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-04 12:28:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:39,934 INFO L225 Difference]: With dead ends: 8 [2018-10-04 12:28:39,935 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 12:28:39,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:28:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 12:28:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 12:28:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:28:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 12:28:39,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 12:28:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:39,939 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 12:28:39,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:28:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 12:28:39,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:28:39,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:39,940 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-04 12:28:39,940 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:39,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:39,941 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-10-04 12:28:39,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:39,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:39,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:39,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:39,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:40,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:40,064 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-04 12:28:40,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:28:40,115 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:28:40,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:40,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:40,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:40,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:28:40,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:28:40,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:28:40,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:40,153 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-04 12:28:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:40,189 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:28:40,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:28:40,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:28:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:40,190 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:28:40,191 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:28:40,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:28:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:28:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:28:40,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:28:40,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 12:28:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:40,195 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:28:40,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:28:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:28:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:28:40,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:40,196 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-04 12:28:40,196 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:40,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-10-04 12:28:40,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:40,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:40,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:40,420 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-04 12:28:40,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:40,420 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-04 12:28:40,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:28:40,482 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:28:40,482 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:40,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:40,563 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-04 12:28:40,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:40,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:28:40,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:28:40,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:28:40,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:28:40,593 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-04 12:28:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:40,701 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 12:28:40,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:28:40,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-04 12:28:40,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:40,703 INFO L225 Difference]: With dead ends: 10 [2018-10-04 12:28:40,703 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 12:28:40,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:28:40,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 12:28:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 12:28:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:28:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 12:28:40,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 12:28:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:40,707 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 12:28:40,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:28:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 12:28:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:28:40,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:40,708 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-04 12:28:40,708 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:40,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:40,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-10-04 12:28:40,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:40,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:40,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:40,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:40,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:40,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:40,837 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-04 12:28:40,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:28:40,853 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:28:40,853 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:40,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:40,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:40,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:28:40,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:28:40,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:28:40,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:28:40,894 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-04 12:28:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:41,012 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:28:41,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:28:41,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 12:28:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:41,014 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:28:41,014 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:28:41,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:28:41,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:28:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:28:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:28:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:28:41,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 12:28:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:41,019 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:28:41,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:28:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:28:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:28:41,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:41,020 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-04 12:28:41,020 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:41,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-10-04 12:28:41,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:41,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:41,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:41,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:41,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:41,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:41,222 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-04 12:28:41,234 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:28:41,260 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:28:41,260 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:41,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:41,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:41,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:28:41,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:28:41,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:28:41,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:28:41,309 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-04 12:28:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:41,438 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 12:28:41,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:28:41,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:28:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:41,440 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:28:41,440 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:28:41,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:28:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:28:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 12:28:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:28:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 12:28:41,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 12:28:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:41,444 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 12:28:41,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:28:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 12:28:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:28:41,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:41,446 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-04 12:28:41,446 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:41,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:41,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-10-04 12:28:41,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:41,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:41,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:41,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:41,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:41,622 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-04 12:28:41,632 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:28:41,699 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:28:41,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:41,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:41,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:41,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:28:41,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:28:41,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:28:41,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:28:41,811 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-04 12:28:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:42,036 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:28:42,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:28:42,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:28:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:42,038 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:28:42,038 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:28:42,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:28:42,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:28:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:28:42,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:28:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:28:42,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 12:28:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:42,043 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:28:42,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:28:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:28:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:28:42,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:42,044 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-04 12:28:42,044 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:42,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:42,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-10-04 12:28:42,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:42,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:42,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:42,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:42,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:42,233 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-04 12:28:42,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:42,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:42,274 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:42,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:42,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:28:42,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:28:42,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:28:42,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:28:42,298 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-04 12:28:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:42,488 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:28:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:28:42,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-04 12:28:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:42,489 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:28:42,489 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:28:42,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:28:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:28:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 12:28:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:28:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:28:42,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 12:28:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:42,494 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:28:42,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:28:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:28:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:28:42,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:42,495 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-04 12:28:42,495 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:42,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-10-04 12:28:42,496 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:42,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:42,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:42,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:42,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 12:28:42,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:42,712 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:28:42,712 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:42,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:28:43,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:43,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-04 12:28:43,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:28:43,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:28:43,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:28:43,143 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 19 states. [2018-10-04 12:28:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:43,999 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-10-04 12:28:44,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:28:44,000 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2018-10-04 12:28:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:44,001 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:28:44,002 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:28:44,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 12:28:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:28:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-10-04 12:28:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:28:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-04 12:28:44,009 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2018-10-04 12:28:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:44,009 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-04 12:28:44,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:28:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-04 12:28:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:28:44,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:44,010 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-04 12:28:44,010 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:44,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-10-04 12:28:44,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:44,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:44,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:44,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:44,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:44,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:44,386 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-04 12:28:44,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:28:44,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:28:44,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:44,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:44,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 12:28:44,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:28:44,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:28:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:28:44,472 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 12 states. [2018-10-04 12:28:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:44,640 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-10-04 12:28:44,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:28:44,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-04 12:28:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:44,643 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:28:44,643 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:28:44,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:28:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:28:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:28:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:28:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-10-04 12:28:44,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2018-10-04 12:28:44,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:44,651 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-10-04 12:28:44,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:28:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-10-04 12:28:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:28:44,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:44,652 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-10-04 12:28:44,652 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:44,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:44,652 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-10-04 12:28:44,653 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:44,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:44,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:44,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:44,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:44,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:44,921 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-04 12:28:44,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:28:44,947 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:28:44,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:44,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:45,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:45,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 12:28:45,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:28:45,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:28:45,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:28:45,006 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 13 states. [2018-10-04 12:28:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:45,355 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-10-04 12:28:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:28:45,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-04 12:28:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:45,357 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:28:45,357 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:28:45,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:28:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:28:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 12:28:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:28:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-10-04 12:28:45,364 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-10-04 12:28:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:45,364 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-10-04 12:28:45,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:28:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-10-04 12:28:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:28:45,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:45,365 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-10-04 12:28:45,366 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:45,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:45,366 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-10-04 12:28:45,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:45,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:45,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:45,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:45,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:45,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:45,682 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-04 12:28:45,692 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:28:45,720 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:28:45,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:45,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:45,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:45,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 12:28:45,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:28:45,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:28:45,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:28:45,766 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 14 states. [2018-10-04 12:28:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:46,034 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-10-04 12:28:46,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:28:46,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 12:28:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:46,036 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:28:46,036 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:28:46,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:28:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:28:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:28:46,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:28:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-10-04 12:28:46,041 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2018-10-04 12:28:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:46,042 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-10-04 12:28:46,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:28:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-10-04 12:28:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:28:46,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:46,043 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-10-04 12:28:46,043 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:46,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-10-04 12:28:46,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:46,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:46,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:46,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:46,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:46,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:46,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 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-04 12:28:46,456 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:28:46,470 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:28:46,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:46,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:46,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:46,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 12:28:46,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:28:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:28:46,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:28:46,555 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 15 states. [2018-10-04 12:28:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:46,777 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-10-04 12:28:46,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:28:46,783 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 12:28:46,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:46,783 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:28:46,784 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:28:46,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-04 12:28:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:28:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 12:28:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:28:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-10-04 12:28:46,790 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2018-10-04 12:28:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:46,791 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-10-04 12:28:46,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:28:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-10-04 12:28:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:28:46,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:46,792 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-10-04 12:28:46,792 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:46,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-10-04 12:28:46,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:46,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:46,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:46,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:46,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:47,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:47,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 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-04 12:28:47,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:47,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:47,212 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:47,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:47,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 12:28:47,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:28:47,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:28:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:28:47,233 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 16 states. [2018-10-04 12:28:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:47,777 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-10-04 12:28:47,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:28:47,779 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-10-04 12:28:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:47,780 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:28:47,780 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:28:47,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:28:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:28:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:28:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:28:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-10-04 12:28:47,788 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-10-04 12:28:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:47,789 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-10-04 12:28:47,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:28:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-10-04 12:28:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:28:47,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:47,790 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-10-04 12:28:47,790 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:47,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:47,790 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-10-04 12:28:47,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:47,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:47,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:47,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:47,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:48,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:48,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 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-04 12:28:48,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:28:48,151 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:28:48,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:48,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:48,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:48,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 12:28:48,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:28:48,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:28:48,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:28:48,198 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2018-10-04 12:28:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:48,563 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-10-04 12:28:48,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:28:48,564 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-10-04 12:28:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:48,565 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:28:48,565 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:28:48,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-04 12:28:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:28:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 12:28:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:28:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-04 12:28:48,571 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2018-10-04 12:28:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:48,572 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-04 12:28:48,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:28:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-10-04 12:28:48,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:28:48,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:48,573 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-10-04 12:28:48,573 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:48,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:48,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-10-04 12:28:48,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:48,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:48,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:48,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:49,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:49,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 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-04 12:28:49,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:28:49,350 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:28:49,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:49,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:49,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:49,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 12:28:49,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:28:49,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:28:49,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:28:49,386 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2018-10-04 12:28:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:49,682 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-10-04 12:28:49,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:28:49,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 12:28:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:49,683 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:28:49,683 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:28:49,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:28:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:28:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:28:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:28:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-10-04 12:28:49,688 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2018-10-04 12:28:49,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:49,688 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-10-04 12:28:49,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:28:49,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-10-04 12:28:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:28:49,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:49,689 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-10-04 12:28:49,690 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:49,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:49,690 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 16 times [2018-10-04 12:28:49,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:49,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:49,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:49,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:49,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:54,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:54,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 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-04 12:28:54,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:28:54,274 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:28:54,274 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:54,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:54,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:54,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 12:28:54,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:28:54,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:28:54,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=341, Unknown=2, NotChecked=0, Total=380 [2018-10-04 12:28:54,328 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 20 states. [2018-10-04 12:28:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:56,861 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-10-04 12:28:56,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:28:56,862 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-10-04 12:28:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:56,863 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:28:56,863 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:28:56,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=37, Invalid=341, Unknown=2, NotChecked=0, Total=380 [2018-10-04 12:28:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:28:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:28:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:28:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-10-04 12:28:56,868 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2018-10-04 12:28:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:56,868 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-10-04 12:28:56,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:28:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-10-04 12:28:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:28:56,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:56,869 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-10-04 12:28:56,870 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:56,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:56,870 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 17 times [2018-10-04 12:28:56,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:56,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:56,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:56,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:28:56,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:57,629 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:57,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:57,629 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-04 12:28:57,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:28:57,700 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 12:28:57,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:28:57,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:28:57,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:57,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 12:28:57,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:28:57,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:28:57,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:28:57,756 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 21 states. [2018-10-04 12:29:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:00,258 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-10-04 12:29:00,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:29:00,259 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-10-04 12:29:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:00,259 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:29:00,260 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:29:00,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-04 12:29:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:29:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 12:29:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:29:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-10-04 12:29:00,265 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 21 [2018-10-04 12:29:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:00,265 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-10-04 12:29:00,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:29:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-10-04 12:29:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 12:29:00,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:00,266 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-10-04 12:29:00,266 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:00,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 18 times [2018-10-04 12:29:00,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:00,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:00,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:00,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 189 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:03,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:03,366 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-04 12:29:03,381 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:29:03,409 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-10-04 12:29:03,409 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:03,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 189 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:03,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:03,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 12:29:03,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:29:03,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:29:03,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=420, Unknown=1, NotChecked=0, Total=462 [2018-10-04 12:29:03,447 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 22 states. [2018-10-04 12:29:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:08,088 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-10-04 12:29:08,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:29:08,090 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-10-04 12:29:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:08,091 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:29:08,091 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:29:08,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=41, Invalid=420, Unknown=1, NotChecked=0, Total=462 [2018-10-04 12:29:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:29:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 12:29:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 12:29:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-10-04 12:29:08,097 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 22 [2018-10-04 12:29:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:08,097 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-10-04 12:29:08,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:29:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-10-04 12:29:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:29:08,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:08,099 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-10-04 12:29:08,099 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:08,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:08,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 19 times [2018-10-04 12:29:08,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:08,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:08,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:08,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:08,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:08,828 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-04 12:29:08,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:08,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 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-04 12:29:08,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:08,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:08,905 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-04 12:29:08,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:08,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 12:29:08,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:29:08,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:29:08,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:29:08,927 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 23 states. [2018-10-04 12:29:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:11,533 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-10-04 12:29:11,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:29:11,537 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-10-04 12:29:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:11,538 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:29:11,538 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:29:11,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-04 12:29:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:29:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 12:29:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:29:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-10-04 12:29:11,544 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 23 [2018-10-04 12:29:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:11,544 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-10-04 12:29:11,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:29:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-10-04 12:29:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 12:29:11,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:11,545 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-10-04 12:29:11,545 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:11,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 20 times [2018-10-04 12:29:11,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:11,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:11,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:11,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:29:11,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 230 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:14,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:14,338 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-04 12:29:14,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:29:14,378 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:29:14,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:14,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 230 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:14,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:14,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 12:29:14,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:29:14,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:29:14,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=506, Unknown=1, NotChecked=0, Total=552 [2018-10-04 12:29:14,465 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 24 states. [2018-10-04 12:29:19,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:19,142 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-10-04 12:29:19,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:29:19,142 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-10-04 12:29:19,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:19,143 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:29:19,143 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:29:19,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=45, Invalid=506, Unknown=1, NotChecked=0, Total=552 [2018-10-04 12:29:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:29:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 12:29:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 12:29:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-10-04 12:29:19,150 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2018-10-04 12:29:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:19,151 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-10-04 12:29:19,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:29:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-10-04 12:29:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:29:19,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:19,152 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-10-04 12:29:19,152 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:19,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 21 times [2018-10-04 12:29:19,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:19,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:19,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:19,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 251 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:24,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:24,154 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-04 12:29:24,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:29:24,179 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 12:29:24,180 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:24,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 251 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:24,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:24,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 12:29:24,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:29:24,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:29:24,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=551, Unknown=2, NotChecked=0, Total=600 [2018-10-04 12:29:24,254 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 25 states. [2018-10-04 12:29:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:29,267 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-10-04 12:29:29,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:29:29,268 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-10-04 12:29:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:29,269 INFO L225 Difference]: With dead ends: 36 [2018-10-04 12:29:29,269 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:29:29,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=47, Invalid=551, Unknown=2, NotChecked=0, Total=600 [2018-10-04 12:29:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:29:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 12:29:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:29:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-10-04 12:29:29,275 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 25 [2018-10-04 12:29:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:29,275 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-10-04 12:29:29,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 12:29:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-10-04 12:29:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:29:29,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:29,276 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-10-04 12:29:29,277 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:29,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 22 times [2018-10-04 12:29:29,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:29,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:29,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 275 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:32,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:32,802 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-04 12:29:32,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:29:32,845 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:29:32,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:32,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 275 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:32,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:32,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 12:29:32,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:29:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:29:32,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=600, Unknown=1, NotChecked=0, Total=650 [2018-10-04 12:29:32,949 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 26 states. [2018-10-04 12:29:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:36,159 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-10-04 12:29:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:29:36,159 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-10-04 12:29:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:36,160 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:29:36,160 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:29:36,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=49, Invalid=600, Unknown=1, NotChecked=0, Total=650 [2018-10-04 12:29:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:29:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 12:29:36,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 12:29:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-10-04 12:29:36,166 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2018-10-04 12:29:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:36,166 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-10-04 12:29:36,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:29:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-10-04 12:29:36,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:29:36,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:36,170 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-10-04 12:29:36,170 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:36,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:36,170 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 23 times [2018-10-04 12:29:36,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:36,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:36,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:36,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:36,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 324 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:39,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:39,415 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-04 12:29:39,423 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:29:39,443 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-10-04 12:29:39,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:39,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 324 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:39,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:39,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 12:29:39,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:29:39,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:29:39,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=702, Unknown=1, NotChecked=0, Total=756 [2018-10-04 12:29:39,499 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 28 states. [2018-10-04 12:29:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:40,434 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-10-04 12:29:40,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:29:40,435 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-10-04 12:29:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:40,436 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:29:40,436 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:29:40,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=53, Invalid=702, Unknown=1, NotChecked=0, Total=756 [2018-10-04 12:29:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:29:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 12:29:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:29:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-10-04 12:29:40,443 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 28 [2018-10-04 12:29:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:40,443 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-04 12:29:40,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:29:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-10-04 12:29:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 12:29:40,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:40,444 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-10-04 12:29:40,444 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:40,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:40,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 24 times [2018-10-04 12:29:40,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:40,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:40,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:40,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:40,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:29:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 350 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:46,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:29:46,701 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-04 12:29:46,709 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:29:46,733 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-10-04 12:29:46,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:29:46,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:29:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 350 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:29:46,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:29:46,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 12:29:46,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:29:46,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:29:46,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=755, Unknown=2, NotChecked=0, Total=812 [2018-10-04 12:29:46,787 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 29 states. [2018-10-04 12:29:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:29:50,215 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-10-04 12:29:50,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:29:50,215 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-10-04 12:29:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:29:50,216 INFO L225 Difference]: With dead ends: 40 [2018-10-04 12:29:50,216 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 12:29:50,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=55, Invalid=755, Unknown=2, NotChecked=0, Total=812 [2018-10-04 12:29:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 12:29:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 12:29:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 12:29:50,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-10-04 12:29:50,220 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 29 [2018-10-04 12:29:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:29:50,220 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-10-04 12:29:50,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:29:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-10-04 12:29:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:29:50,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:29:50,221 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-10-04 12:29:50,221 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:29:50,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:29:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 25 times [2018-10-04 12:29:50,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:29:50,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:29:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:50,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:29:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:29:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 375 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:01,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:01,959 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-04 12:30:01,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:30:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:01,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 375 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:02,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:02,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 12:30:02,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:30:02,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:30:02,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=809, Unknown=4, NotChecked=0, Total=870 [2018-10-04 12:30:02,040 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 30 states. [2018-10-04 12:30:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:09,166 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-10-04 12:30:09,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:30:09,167 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-10-04 12:30:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:09,168 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:30:09,168 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:30:09,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=57, Invalid=809, Unknown=4, NotChecked=0, Total=870 [2018-10-04 12:30:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:30:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 12:30:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 12:30:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-10-04 12:30:09,172 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 30 [2018-10-04 12:30:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:09,173 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-10-04 12:30:09,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:30:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-10-04 12:30:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:30:09,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:09,174 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-10-04 12:30:09,174 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:09,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 26 times [2018-10-04 12:30:09,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:09,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:09,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:30:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 404 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:14,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:14,740 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-04 12:30:14,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:30:14,769 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:30:14,769 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:14,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:14,799 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 404 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:14,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:14,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 12:30:14,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 12:30:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 12:30:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=869, Unknown=2, NotChecked=0, Total=930 [2018-10-04 12:30:14,821 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 31 states. [2018-10-04 12:30:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:21,335 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-10-04 12:30:21,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:30:21,336 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-10-04 12:30:21,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:21,336 INFO L225 Difference]: With dead ends: 42 [2018-10-04 12:30:21,337 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 12:30:21,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=59, Invalid=869, Unknown=2, NotChecked=0, Total=930 [2018-10-04 12:30:21,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 12:30:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 12:30:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 12:30:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-10-04 12:30:21,341 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 31 [2018-10-04 12:30:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:21,342 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-10-04 12:30:21,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 12:30:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-10-04 12:30:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 12:30:21,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:21,342 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-10-04 12:30:21,343 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:21,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 27 times [2018-10-04 12:30:21,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:21,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 433 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:31,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:31,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 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-04 12:30:31,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:30:31,097 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:30:31,097 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:31,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 433 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:31,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:31,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 12:30:31,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:30:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:30:31,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=928, Unknown=3, NotChecked=0, Total=992 [2018-10-04 12:30:31,166 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 32 states. [2018-10-04 12:30:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:36,511 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-10-04 12:30:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:30:36,512 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-10-04 12:30:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:36,513 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:30:36,514 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:30:36,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=61, Invalid=928, Unknown=3, NotChecked=0, Total=992 [2018-10-04 12:30:36,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:30:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 12:30:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:30:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-10-04 12:30:36,520 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 32 [2018-10-04 12:30:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:36,520 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-04 12:30:36,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:30:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-10-04 12:30:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 12:30:36,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:36,521 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-10-04 12:30:36,521 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:36,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 28 times [2018-10-04 12:30:36,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:36,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:36,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:36,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:36,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:30:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 464 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:45,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:30:45,005 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-04 12:30:45,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:30:45,034 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:30:45,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:30:45,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:30:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 464 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:30:45,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:30:45,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 12:30:45,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:30:45,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:30:45,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=990, Unknown=3, NotChecked=0, Total=1056 [2018-10-04 12:30:45,095 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 33 states. [2018-10-04 12:30:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:30:53,565 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-10-04 12:30:53,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:30:53,566 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-10-04 12:30:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:30:53,566 INFO L225 Difference]: With dead ends: 44 [2018-10-04 12:30:53,566 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 12:30:53,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=63, Invalid=990, Unknown=3, NotChecked=0, Total=1056 [2018-10-04 12:30:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 12:30:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 12:30:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 12:30:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-10-04 12:30:53,571 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 33 [2018-10-04 12:30:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:30:53,571 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-10-04 12:30:53,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:30:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-10-04 12:30:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 12:30:53,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:30:53,572 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-10-04 12:30:53,572 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:30:53,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:30:53,572 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 29 times [2018-10-04 12:30:53,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:30:53,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:30:53,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:53,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:30:53,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:30:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 494 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:02,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:02,436 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-04 12:31:02,443 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:31:02,466 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-10-04 12:31:02,466 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:02,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 494 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:02,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:02,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 12:31:02,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 12:31:02,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 12:31:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1054, Unknown=3, NotChecked=0, Total=1122 [2018-10-04 12:31:02,529 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 34 states. [2018-10-04 12:31:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:09,763 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-10-04 12:31:09,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:31:09,764 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-10-04 12:31:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:09,765 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:31:09,765 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:31:09,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=65, Invalid=1054, Unknown=3, NotChecked=0, Total=1122 [2018-10-04 12:31:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:31:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 12:31:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 12:31:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-10-04 12:31:09,770 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2018-10-04 12:31:09,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:09,771 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-10-04 12:31:09,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 12:31:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-10-04 12:31:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:31:09,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:09,772 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-10-04 12:31:09,772 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:09,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:09,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 30 times [2018-10-04 12:31:09,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:09,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:09,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:09,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:09,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 557 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:22,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:22,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 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-04 12:31:22,464 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:31:22,492 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-10-04 12:31:22,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:31:22,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 557 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:22,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:22,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 12:31:22,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:31:22,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:31:22,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1186, Unknown=5, NotChecked=0, Total=1260 [2018-10-04 12:31:22,530 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 36 states. [2018-10-04 12:31:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:27,882 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-10-04 12:31:27,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:31:27,882 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-10-04 12:31:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:27,883 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:31:27,883 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:31:27,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=69, Invalid=1186, Unknown=5, NotChecked=0, Total=1260 [2018-10-04 12:31:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:31:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 12:31:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 12:31:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-10-04 12:31:27,889 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 36 [2018-10-04 12:31:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:27,889 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-10-04 12:31:27,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:31:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-10-04 12:31:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:31:27,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:27,889 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-10-04 12:31:27,890 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:27,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:27,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 31 times [2018-10-04 12:31:27,890 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:27,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:27,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:31:27,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 593 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:36,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:31:36,474 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-04 12:31:36,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:31:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:31:36,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:31:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 593 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:31:36,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:31:36,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 12:31:36,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 12:31:36,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 12:31:36,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1259, Unknown=2, NotChecked=0, Total=1332 [2018-10-04 12:31:36,557 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 37 states. [2018-10-04 12:31:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:31:51,039 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-10-04 12:31:51,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:31:51,040 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-10-04 12:31:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:31:51,041 INFO L225 Difference]: With dead ends: 48 [2018-10-04 12:31:51,041 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 12:31:51,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=71, Invalid=1259, Unknown=2, NotChecked=0, Total=1332 [2018-10-04 12:31:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 12:31:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 12:31:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 12:31:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-10-04 12:31:51,047 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 37 [2018-10-04 12:31:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:31:51,047 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-10-04 12:31:51,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 12:31:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-10-04 12:31:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 12:31:51,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:31:51,048 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-10-04 12:31:51,048 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:31:51,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:31:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 32 times [2018-10-04 12:31:51,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:31:51,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:31:51,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:51,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:31:51,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:31:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 627 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:05,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:05,733 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-04 12:32:05,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:05,761 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:05,761 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:05,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 627 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:05,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:05,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 12:32:05,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:32:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:32:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1328, Unknown=5, NotChecked=0, Total=1406 [2018-10-04 12:32:05,799 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 38 states. [2018-10-04 12:32:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:18,285 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-10-04 12:32:18,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:32:18,285 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-10-04 12:32:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:18,286 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:32:18,286 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:32:18,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=73, Invalid=1328, Unknown=5, NotChecked=0, Total=1406 [2018-10-04 12:32:18,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:32:18,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 12:32:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 12:32:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-10-04 12:32:18,291 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 38 [2018-10-04 12:32:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:18,292 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-10-04 12:32:18,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:32:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-10-04 12:32:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 12:32:18,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:18,292 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-10-04 12:32:18,293 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:18,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 33 times [2018-10-04 12:32:18,293 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:18,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:18,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:18,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:18,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 660 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:42,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:42,045 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-04 12:32:42,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:42,083 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-10-04 12:32:42,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:42,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 660 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:42,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:42,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 12:32:42,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 12:32:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 12:32:42,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1398, Unknown=9, NotChecked=0, Total=1482 [2018-10-04 12:32:42,120 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 39 states. [2018-10-04 12:33:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:00,103 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-10-04 12:33:00,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:33:00,103 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-10-04 12:33:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:00,104 INFO L225 Difference]: With dead ends: 50 [2018-10-04 12:33:00,104 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 12:33:00,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=75, Invalid=1398, Unknown=9, NotChecked=0, Total=1482 [2018-10-04 12:33:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 12:33:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-04 12:33:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 12:33:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-10-04 12:33:00,109 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 39 [2018-10-04 12:33:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:00,110 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-10-04 12:33:00,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 12:33:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-10-04 12:33:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 12:33:00,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:00,110 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-10-04 12:33:00,111 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:00,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 34 times [2018-10-04 12:33:00,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:00,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:00,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-04 12:33:16,830 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:33:16,835 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:33:16,836 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:33:16 BoogieIcfgContainer [2018-10-04 12:33:16,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:33:16,837 INFO L168 Benchmark]: Toolchain (without parser) took 278003.59 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 109.1 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 136.0 MB). Peak memory consumption was 245.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:33:16,838 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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-04 12:33:16,839 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.33 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-04 12:33:16,839 INFO L168 Benchmark]: Boogie Preprocessor took 22.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:33:16,840 INFO L168 Benchmark]: RCFGBuilder took 297.07 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-04 12:33:16,840 INFO L168 Benchmark]: TraceAbstraction took 277640.31 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 109.1 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 114.9 MB). Peak memory consumption was 223.9 MB. Max. memory is 7.1 GB. [2018-10-04 12:33:16,844 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.18 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.33 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.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 297.07 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 277640.31 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 109.1 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 114.9 MB). Peak memory consumption was 223.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 24). Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 37, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 277.5s OverallTime, 35 OverallIterations, 37 TraceHistogramMax, 118.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 56 SDslu, 645 SDs, 0 SdLazy, 16996 SolverSat, 41 SolverUnsat, 45 SolverUnknown, 0 SolverNotchecked, 114.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1337 GetRequests, 653 SyntacticMatches, 32 SemanticMatches, 652 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 138.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=34, 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.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 139.4s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 233 NumberOfCheckSat, 1322 ConstructedInterpolants, 0 QuantifiedInterpolants, 352104 SizeOfPredicates, 32 NumberOfNonLiveVariables, 2673 ConjunctsInSsa, 1254 ConjunctsInUnsatCore, 67 InterpolantComputations, 1 PerfectInterpolantSequences, 1/14944 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/AnnoyingVillain.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-33-16-855.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/AnnoyingVillain.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-33-16-855.csv Completed graceful shutdown