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-133090d [2018-10-04 09:22:53,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:22:53,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:22:53,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:22:53,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:22:53,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:22:53,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:22:53,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:22:53,708 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:22:53,709 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:22:53,710 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:22:53,710 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:22:53,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:22:53,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:22:53,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:22:53,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:22:53,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:22:53,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:22:53,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:22:53,723 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:22:53,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:22:53,728 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:22:53,734 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:22:53,734 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:22:53,734 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:22:53,735 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:22:53,737 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:22:53,738 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:22:53,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:22:53,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:22:53,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:22:53,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:22:53,744 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:22:53,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:22:53,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:22:53,749 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:22:53,749 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 09:22:53,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:22:53,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:22:53,775 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:22:53,775 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:22:53,775 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:22:53,776 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:22:53,776 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:22:53,776 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:22:53,776 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:22:53,776 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:22:53,777 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:22:53,777 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:22:53,777 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:22:53,777 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:22:53,777 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:22:53,778 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:22:53,778 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:22:53,778 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:22:53,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:22:53,778 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:22:53,779 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:22:53,779 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:22:53,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:22:53,779 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:22:53,779 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:22:53,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:22:53,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:22:53,780 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:22:53,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:22:53,780 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:22:53,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:22:53,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:22:53,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:22:53,852 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:22:53,853 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:22:53,854 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 09:22:53,855 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2018-10-04 09:22:53,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:22:53,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:22:53,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:53,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:22:53,909 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:22:53,930 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 09:22:53" (1/1) ... [2018-10-04 09:22:53,942 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 09:22:53" (1/1) ... [2018-10-04 09:22:53,947 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 09:22:53,947 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 09:22:53,948 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 09:22:53,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:22:53,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:22:53,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:22:53,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:22:53,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:53" (1/1) ... [2018-10-04 09:22:53,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:53" (1/1) ... [2018-10-04 09:22:53,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:53" (1/1) ... [2018-10-04 09:22:53,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:53" (1/1) ... [2018-10-04 09:22:53,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:53" (1/1) ... [2018-10-04 09:22:53,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:53" (1/1) ... [2018-10-04 09:22:53,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:53" (1/1) ... [2018-10-04 09:22:53,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:22:53,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:22:53,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:22:53,982 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:22:53,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:53" (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 09:22:54,049 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 09:22:54,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 09:22:54,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 09:22:54,238 INFO L338 CfgBuilder]: Using library mode [2018-10-04 09:22:54,239 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:22:54 BoogieIcfgContainer [2018-10-04 09:22:54,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:22:54,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:22:54,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:22:54,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:22:54,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:22:53" (1/2) ... [2018-10-04 09:22:54,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca65da9 and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:22:54, skipping insertion in model container [2018-10-04 09:22:54,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:22:54" (2/2) ... [2018-10-04 09:22:54,248 INFO L112 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2018-10-04 09:22:54,258 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:22:54,266 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:22:54,317 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:22:54,317 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:22:54,318 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:22:54,318 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:22:54,318 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:22:54,318 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:22:54,319 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:22:54,319 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:22:54,319 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:22:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 09:22:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 09:22:54,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:54,343 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 09:22:54,344 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:54,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:54,350 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-10-04 09:22:54,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:54,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:54,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:54,526 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 09:22:54,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:22:54,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 09:22:54,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:22:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:22:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:22:54,549 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 09:22:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:54,611 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-10-04 09:22:54,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:22:54,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 09:22:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:54,623 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:22:54,623 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 09:22:54,627 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 09:22:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 09:22:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 09:22:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 09:22:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 09:22:54,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 09:22:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:54,663 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 09:22:54,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:22:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 09:22:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 09:22:54,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:54,664 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 09:22:54,665 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:54,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-10-04 09:22:54,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:54,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:54,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:54,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:54,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:54,865 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 09:22:54,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:54,866 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 09:22:54,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:54,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:54,981 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 09:22:55,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:55,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 09:22:55,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:22:55,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:22:55,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:22:55,018 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-04 09:22:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:55,125 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 09:22:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:22:55,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-04 09:22:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:55,126 INFO L225 Difference]: With dead ends: 8 [2018-10-04 09:22:55,126 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 09:22:55,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:22:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 09:22:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 09:22:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 09:22:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 09:22:55,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 09:22:55,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:55,131 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 09:22:55,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:22:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 09:22:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:22:55,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:55,132 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-04 09:22:55,132 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:55,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:55,133 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-10-04 09:22:55,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:55,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:55,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:55,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:55,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:55,438 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 09:22:55,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:55,439 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) [2018-10-04 09:22:55,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:22:55,488 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:22:55,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:55,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:55,553 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 09:22:55,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:55,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:22:55,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:22:55,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:22:55,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:22:55,575 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-04 09:22:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:55,627 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 09:22:55,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:22:55,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 09:22:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:55,629 INFO L225 Difference]: With dead ends: 9 [2018-10-04 09:22:55,629 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 09:22:55,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:22:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 09:22:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 09:22:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 09:22:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 09:22:55,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 09:22:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:55,633 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 09:22:55,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:22:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 09:22:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:22:55,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:55,634 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-04 09:22:55,635 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:55,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:55,635 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-10-04 09:22:55,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:55,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:55,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:55,889 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 09:22:55,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:55,889 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 09:22:55,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:22:55,923 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 09:22:55,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:55,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:55,948 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 09:22:55,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:55,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 09:22:55,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 09:22:55,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 09:22:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-04 09:22:55,971 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-04 09:22:56,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:56,190 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 09:22:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:22:56,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-04 09:22:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:56,193 INFO L225 Difference]: With dead ends: 10 [2018-10-04 09:22:56,194 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 09:22:56,194 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 09:22:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 09:22:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 09:22:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 09:22:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 09:22:56,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 09:22:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:56,199 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 09:22:56,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 09:22:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 09:22:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 09:22:56,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:56,200 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-04 09:22:56,200 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:56,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-10-04 09:22:56,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:56,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:56,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:56,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:56,335 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 09:22:56,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:56,336 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 09:22:56,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:22:56,353 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:22:56,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:56,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:56,381 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 09:22:56,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:56,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 09:22:56,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 09:22:56,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 09:22:56,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:22:56,410 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-04 09:22:56,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:56,492 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 09:22:56,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:22:56,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 09:22:56,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:56,494 INFO L225 Difference]: With dead ends: 11 [2018-10-04 09:22:56,494 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 09:22:56,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-04 09:22:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 09:22:56,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 09:22:56,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 09:22:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 09:22:56,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 09:22:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:56,498 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 09:22:56,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 09:22:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 09:22:56,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 09:22:56,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:56,499 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-04 09:22:56,499 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:56,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-10-04 09:22:56,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:56,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:56,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:56,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:56,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:56,764 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 09:22:56,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:56,765 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 09:22:56,774 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:22:56,784 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 09:22:56,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:56,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:56,803 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 09:22:56,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:56,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 09:22:56,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:22:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:22:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:22:56,826 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-04 09:22:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:56,927 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 09:22:56,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:22:56,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 09:22:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:56,928 INFO L225 Difference]: With dead ends: 12 [2018-10-04 09:22:56,928 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 09:22:56,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:22:56,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 09:22:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 09:22:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 09:22:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 09:22:56,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 09:22:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:56,933 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 09:22:56,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:22:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 09:22:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:22:56,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:56,934 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-04 09:22:56,935 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:56,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-10-04 09:22:56,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:56,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:56,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:56,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:56,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:57,213 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 09:22:57,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:57,213 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 09:22:57,221 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:22:57,290 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 09:22:57,290 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:57,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:57,379 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 09:22:57,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:57,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 09:22:57,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 09:22:57,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 09:22:57,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:22:57,414 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-04 09:22:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:57,656 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 09:22:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:22:57,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 09:22:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:57,658 INFO L225 Difference]: With dead ends: 13 [2018-10-04 09:22:57,658 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:22:57,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-04 09:22:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:22:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 09:22:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 09:22:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 09:22:57,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 09:22:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:57,662 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 09:22:57,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 09:22:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 09:22:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 09:22:57,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:57,664 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-04 09:22:57,664 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:57,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-10-04 09:22:57,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:57,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:57,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:57,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:57,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:57,838 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 09:22:57,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:57,838 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 09:22:57,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:57,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:57,901 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 09:22:57,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:57,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 09:22:57,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:22:57,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:22:57,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-04 09:22:57,923 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-04 09:22:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:58,050 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 09:22:58,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:22:58,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-04 09:22:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:58,052 INFO L225 Difference]: With dead ends: 14 [2018-10-04 09:22:58,052 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 09:22:58,052 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 09:22:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 09:22:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 09:22:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:22:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 09:22:58,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 09:22:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:58,056 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 09:22:58,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:22:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 09:22:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:22:58,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:58,057 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-04 09:22:58,058 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:58,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:58,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-10-04 09:22:58,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:58,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:58,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:58,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:22:58,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:22:58,280 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 09:22:58,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:22:58,281 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:22:58,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:22:58,312 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:22:58,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:22:58,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:22:58,714 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 09:22:58,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:22:58,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-04 09:22:58,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 09:22:58,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 09:22:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:22:58,749 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 19 states. [2018-10-04 09:22:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:22:59,648 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-10-04 09:22:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 09:22:59,649 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2018-10-04 09:22:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:22:59,650 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:22:59,650 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 09:22:59,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-04 09:22:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 09:22:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-10-04 09:22:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 09:22:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-04 09:22:59,657 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2018-10-04 09:22:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:22:59,657 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-04 09:22:59,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 09:22:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-04 09:22:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 09:22:59,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:22:59,658 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-04 09:22:59,658 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:22:59,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:22:59,659 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-10-04 09:22:59,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:22:59,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:22:59,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:59,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:22:59,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:22:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:00,032 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 09:23:00,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:00,032 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 09:23:00,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:23:00,058 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 09:23:00,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:00,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:00,081 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 09:23:00,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:00,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 09:23:00,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 09:23:00,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 09:23:00,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-04 09:23:00,103 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 12 states. [2018-10-04 09:23:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:00,275 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-10-04 09:23:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:23:00,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-04 09:23:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:00,280 INFO L225 Difference]: With dead ends: 23 [2018-10-04 09:23:00,280 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 09:23:00,281 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 09:23:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 09:23:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 09:23:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 09:23:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-10-04 09:23:00,287 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2018-10-04 09:23:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:00,287 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-10-04 09:23:00,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 09:23:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-10-04 09:23:00,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 09:23:00,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:00,288 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-10-04 09:23:00,289 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:00,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:00,289 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-10-04 09:23:00,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:00,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:00,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:00,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:00,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:00,587 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 09:23:00,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:00,588 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:23:00,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:23:00,621 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:23:00,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:00,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:00,670 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 09:23:00,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:00,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 09:23:00,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 09:23:00,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 09:23:00,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-04 09:23:00,691 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 13 states. [2018-10-04 09:23:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:00,885 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-10-04 09:23:00,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:23:00,887 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-04 09:23:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:00,888 INFO L225 Difference]: With dead ends: 24 [2018-10-04 09:23:00,888 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 09:23:00,889 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 09:23:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 09:23:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 09:23:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:23:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-10-04 09:23:00,902 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-10-04 09:23:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:00,903 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-10-04 09:23:00,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 09:23:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-10-04 09:23:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 09:23:00,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:00,904 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-10-04 09:23:00,905 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:00,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-10-04 09:23:00,906 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:00,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:00,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:01,331 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 09:23:01,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:01,332 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 09:23:01,339 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:23:01,354 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 09:23:01,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:01,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:01,379 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 09:23:01,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:01,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 09:23:01,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 09:23:01,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 09:23:01,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-04 09:23:01,401 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 14 states. [2018-10-04 09:23:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:01,715 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-10-04 09:23:01,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:23:01,716 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 09:23:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:01,717 INFO L225 Difference]: With dead ends: 25 [2018-10-04 09:23:01,717 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 09:23:01,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-04 09:23:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 09:23:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 09:23:01,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 09:23:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-10-04 09:23:01,723 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2018-10-04 09:23:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:01,723 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-10-04 09:23:01,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 09:23:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-10-04 09:23:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:23:01,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:01,724 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-10-04 09:23:01,724 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:01,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-10-04 09:23:01,725 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:01,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:01,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:01,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:01,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:02,246 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 09:23:02,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:02,247 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:23:02,254 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:23:02,272 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:23:02,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:02,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:02,303 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 09:23:02,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:02,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 09:23:02,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 09:23:02,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 09:23:02,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-04 09:23:02,328 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 15 states. [2018-10-04 09:23:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:02,557 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-10-04 09:23:02,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:23:02,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 09:23:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:02,559 INFO L225 Difference]: With dead ends: 26 [2018-10-04 09:23:02,559 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 09:23:02,560 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 09:23:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 09:23:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 09:23:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 09:23:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-10-04 09:23:02,564 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2018-10-04 09:23:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:02,565 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-10-04 09:23:02,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 09:23:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-10-04 09:23:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:23:02,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:02,566 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-10-04 09:23:02,566 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:02,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-10-04 09:23:02,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:02,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:02,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:02,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:02,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:02,908 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 09:23:02,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:02,908 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 09:23:02,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:02,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:02,974 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 09:23:02,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:02,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 09:23:02,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 09:23:02,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 09:23:02,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-04 09:23:02,995 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 16 states. [2018-10-04 09:23:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:03,446 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-10-04 09:23:03,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:23:03,451 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-10-04 09:23:03,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:03,452 INFO L225 Difference]: With dead ends: 27 [2018-10-04 09:23:03,452 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:23:03,452 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 09:23:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:23:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 09:23:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 09:23:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-10-04 09:23:03,457 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-10-04 09:23:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:03,458 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-10-04 09:23:03,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 09:23:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-10-04 09:23:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 09:23:03,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:03,459 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-10-04 09:23:03,459 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:03,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:03,459 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-10-04 09:23:03,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:03,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:03,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:03,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:03,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:03,794 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 09:23:03,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:03,795 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 09:23:03,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:23:03,817 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:23:03,817 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:03,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:03,831 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 09:23:03,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:03,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 09:23:03,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 09:23:03,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 09:23:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-04 09:23:03,853 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2018-10-04 09:23:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:04,202 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-10-04 09:23:04,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:23:04,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-10-04 09:23:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:04,203 INFO L225 Difference]: With dead ends: 28 [2018-10-04 09:23:04,203 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 09:23:04,204 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 09:23:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 09:23:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 09:23:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 09:23:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-04 09:23:04,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2018-10-04 09:23:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:04,209 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-04 09:23:04,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 09:23:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-10-04 09:23:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 09:23:04,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:04,210 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-10-04 09:23:04,210 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:04,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-10-04 09:23:04,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:04,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:04,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:04,592 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 09:23:04,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:04,592 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 09:23:04,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:23:04,616 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 09:23:04,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:04,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:04,644 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 09:23:04,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:04,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 09:23:04,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 09:23:04,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 09:23:04,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-04 09:23:04,669 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2018-10-04 09:23:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:04,967 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-10-04 09:23:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:23:04,967 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 09:23:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:04,968 INFO L225 Difference]: With dead ends: 29 [2018-10-04 09:23:04,968 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 09:23:04,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-04 09:23:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 09:23:04,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 09:23:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 09:23:04,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-10-04 09:23:04,974 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2018-10-04 09:23:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:04,974 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-10-04 09:23:04,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 09:23:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-10-04 09:23:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 09:23:04,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:04,975 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-10-04 09:23:04,976 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:04,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 16 times [2018-10-04 09:23:04,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:04,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:04,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:04,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:04,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:07,753 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 09:23:07,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:07,754 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 09:23:07,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:23:07,795 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:23:07,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:07,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:07,866 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 09:23:07,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:07,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 09:23:07,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 09:23:07,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 09:23:07,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=342, Unknown=1, NotChecked=0, Total=380 [2018-10-04 09:23:07,901 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 20 states. [2018-10-04 09:23:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:10,491 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-10-04 09:23:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 09:23:10,492 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-10-04 09:23:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:10,492 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:23:10,492 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 09:23:10,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=37, Invalid=342, Unknown=1, NotChecked=0, Total=380 [2018-10-04 09:23:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 09:23:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 09:23:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 09:23:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-10-04 09:23:10,498 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2018-10-04 09:23:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:10,498 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-10-04 09:23:10,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 09:23:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-10-04 09:23:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 09:23:10,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:10,499 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-10-04 09:23:10,500 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:10,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:10,500 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 17 times [2018-10-04 09:23:10,500 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:10,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:10,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:10,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:10,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 170 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:13,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:13,089 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 09:23:13,096 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:23:13,111 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-04 09:23:13,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:13,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 170 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:13,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:13,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 09:23:13,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 09:23:13,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 09:23:13,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=380, Unknown=1, NotChecked=0, Total=420 [2018-10-04 09:23:13,149 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 21 states. [2018-10-04 09:23:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:15,723 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-10-04 09:23:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:23:15,723 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-10-04 09:23:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:15,724 INFO L225 Difference]: With dead ends: 32 [2018-10-04 09:23:15,724 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 09:23:15,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=39, Invalid=380, Unknown=1, NotChecked=0, Total=420 [2018-10-04 09:23:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 09:23:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-04 09:23:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 09:23:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-10-04 09:23:15,729 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 21 [2018-10-04 09:23:15,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:15,730 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-10-04 09:23:15,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 09:23:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-10-04 09:23:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 09:23:15,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:15,730 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-10-04 09:23:15,731 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:15,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:15,731 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 18 times [2018-10-04 09:23:15,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:15,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:15,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:18,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:18,556 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:23:18,572 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:23:18,600 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-10-04 09:23:18,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:18,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:18,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:18,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-04 09:23:18,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 09:23:18,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 09:23:18,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=420, Unknown=1, NotChecked=0, Total=462 [2018-10-04 09:23:18,638 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 22 states. [2018-10-04 09:23:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:19,148 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-10-04 09:23:19,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:23:19,149 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-10-04 09:23:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:19,150 INFO L225 Difference]: With dead ends: 33 [2018-10-04 09:23:19,151 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 09:23:19,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=41, Invalid=420, Unknown=1, NotChecked=0, Total=462 [2018-10-04 09:23:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 09:23:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-04 09:23:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-04 09:23:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-10-04 09:23:19,157 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 22 [2018-10-04 09:23:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:19,157 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-10-04 09:23:19,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 09:23:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-10-04 09:23:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 09:23:19,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:19,158 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-10-04 09:23:19,159 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:19,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 19 times [2018-10-04 09:23:19,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:19,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:19,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:19,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:19,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 209 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:23,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:23,150 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 09:23:23,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:23,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 209 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:23,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:23,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 09:23:23,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 09:23:23,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 09:23:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=462, Unknown=1, NotChecked=0, Total=506 [2018-10-04 09:23:23,240 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 23 states. [2018-10-04 09:23:23,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:23,792 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-10-04 09:23:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:23:23,793 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-10-04 09:23:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:23,794 INFO L225 Difference]: With dead ends: 34 [2018-10-04 09:23:23,794 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 09:23:23,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=43, Invalid=462, Unknown=1, NotChecked=0, Total=506 [2018-10-04 09:23:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 09:23:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 09:23:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:23:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-10-04 09:23:23,800 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 23 [2018-10-04 09:23:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:23,800 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-10-04 09:23:23,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 09:23:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-10-04 09:23:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 09:23:23,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:23,801 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-10-04 09:23:23,801 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:23,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 20 times [2018-10-04 09:23:23,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:23,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:23,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:23:23,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 228 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:34,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:34,533 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:23:34,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:23:34,568 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:23:34,568 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:34,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 228 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:34,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:34,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 09:23:34,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 09:23:34,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 09:23:34,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=502, Unknown=5, NotChecked=0, Total=552 [2018-10-04 09:23:34,655 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 24 states. [2018-10-04 09:23:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:37,392 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-10-04 09:23:37,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:23:37,392 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-10-04 09:23:37,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:37,393 INFO L225 Difference]: With dead ends: 35 [2018-10-04 09:23:37,393 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 09:23:37,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=45, Invalid=502, Unknown=5, NotChecked=0, Total=552 [2018-10-04 09:23:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 09:23:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-04 09:23:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-04 09:23:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-10-04 09:23:37,399 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 24 [2018-10-04 09:23:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:37,399 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-10-04 09:23:37,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 09:23:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-10-04 09:23:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 09:23:37,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:37,400 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-10-04 09:23:37,401 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:37,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 21 times [2018-10-04 09:23:37,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:37,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:37,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 252 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:44,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:44,484 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 09:23:44,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:23:44,511 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 09:23:44,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:44,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 252 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:44,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:44,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-04 09:23:44,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 09:23:44,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 09:23:44,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=550, Unknown=3, NotChecked=0, Total=600 [2018-10-04 09:23:44,566 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 25 states. [2018-10-04 09:23:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:23:48,439 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-10-04 09:23:48,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:23:48,440 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-10-04 09:23:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:23:48,441 INFO L225 Difference]: With dead ends: 36 [2018-10-04 09:23:48,441 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 09:23:48,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=47, Invalid=550, Unknown=3, NotChecked=0, Total=600 [2018-10-04 09:23:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 09:23:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 09:23:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:23:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-10-04 09:23:48,447 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 25 [2018-10-04 09:23:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:23:48,447 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-10-04 09:23:48,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 09:23:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-10-04 09:23:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:23:48,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:23:48,448 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-10-04 09:23:48,449 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:23:48,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:23:48,449 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 22 times [2018-10-04 09:23:48,449 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:23:48,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:23:48,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:48,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:23:48,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:23:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:23:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 273 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:59,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:23:59,447 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 09:23:59,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:23:59,487 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:23:59,487 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:23:59,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:23:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 273 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:23:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:23:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 09:23:59,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 09:23:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 09:23:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=596, Unknown=5, NotChecked=0, Total=650 [2018-10-04 09:23:59,568 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 26 states. [2018-10-04 09:24:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:02,681 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-10-04 09:24:02,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 09:24:02,682 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-10-04 09:24:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:02,683 INFO L225 Difference]: With dead ends: 37 [2018-10-04 09:24:02,683 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:24:02,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=49, Invalid=596, Unknown=5, NotChecked=0, Total=650 [2018-10-04 09:24:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:24:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-04 09:24:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-04 09:24:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-10-04 09:24:02,688 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 26 [2018-10-04 09:24:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:02,688 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-10-04 09:24:02,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 09:24:02,689 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-10-04 09:24:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 09:24:02,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:02,690 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-10-04 09:24:02,690 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:02,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:02,690 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 23 times [2018-10-04 09:24:02,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:02,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:02,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:02,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:02,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:24:03,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:03,830 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 09:24:03,838 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:24:03,860 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-10-04 09:24:03,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:03,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:24:03,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:03,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-04 09:24:03,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 09:24:03,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 09:24:03,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-04 09:24:03,923 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 28 states. [2018-10-04 09:24:04,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:04,912 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-10-04 09:24:04,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:24:04,912 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-10-04 09:24:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:04,913 INFO L225 Difference]: With dead ends: 39 [2018-10-04 09:24:04,913 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 09:24:04,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-04 09:24:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 09:24:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-04 09:24:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 09:24:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-10-04 09:24:04,920 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 28 [2018-10-04 09:24:04,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:04,920 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-04 09:24:04,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 09:24:04,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-10-04 09:24:04,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-04 09:24:04,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:04,921 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-10-04 09:24:04,922 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:04,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 24 times [2018-10-04 09:24:04,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:04,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:04,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:04,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:04,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:12,931 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 09:24:12,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:12,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:24:12,938 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:24:12,971 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-10-04 09:24:12,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:12,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:13,009 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 09:24:13,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:13,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 09:24:13,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 09:24:13,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 09:24:13,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=754, Unknown=3, NotChecked=0, Total=812 [2018-10-04 09:24:13,035 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 29 states. [2018-10-04 09:24:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:24,101 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-10-04 09:24:24,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 09:24:24,102 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-10-04 09:24:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:24,103 INFO L225 Difference]: With dead ends: 40 [2018-10-04 09:24:24,103 INFO L226 Difference]: Without dead ends: 38 [2018-10-04 09:24:24,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=55, Invalid=754, Unknown=3, NotChecked=0, Total=812 [2018-10-04 09:24:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-04 09:24:24,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-04 09:24:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 09:24:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-10-04 09:24:24,108 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 29 [2018-10-04 09:24:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:24,108 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-10-04 09:24:24,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 09:24:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2018-10-04 09:24:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:24:24,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:24,109 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-10-04 09:24:24,109 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:24,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:24,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 25 times [2018-10-04 09:24:24,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:24,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:24,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:24,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:24,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 376 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:24:29,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:29,759 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 09:24:29,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:29,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 376 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:24:29,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:29,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 09:24:29,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 09:24:29,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 09:24:29,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=811, Unknown=2, NotChecked=0, Total=870 [2018-10-04 09:24:29,833 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 30 states. [2018-10-04 09:24:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:39,005 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-10-04 09:24:39,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:24:39,006 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-10-04 09:24:39,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:39,006 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:24:39,006 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 09:24:39,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=57, Invalid=811, Unknown=2, NotChecked=0, Total=870 [2018-10-04 09:24:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 09:24:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-04 09:24:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-04 09:24:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-10-04 09:24:39,011 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 30 [2018-10-04 09:24:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:39,012 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-10-04 09:24:39,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 09:24:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-10-04 09:24:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 09:24:39,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:39,013 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-10-04 09:24:39,013 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:39,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:39,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 26 times [2018-10-04 09:24:39,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:39,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:39,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:39,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:24:39,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:24:47,375 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 09:24:47,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:24:47,376 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 09:24:47,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:24:47,405 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:24:47,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:24:47,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:24:47,422 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 09:24:47,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:24:47,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 09:24:47,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 09:24:47,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 09:24:47,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=868, Unknown=3, NotChecked=0, Total=930 [2018-10-04 09:24:47,444 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 31 states. [2018-10-04 09:24:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:24:56,555 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-10-04 09:24:56,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 09:24:56,557 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-10-04 09:24:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:24:56,557 INFO L225 Difference]: With dead ends: 42 [2018-10-04 09:24:56,558 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 09:24:56,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=59, Invalid=868, Unknown=3, NotChecked=0, Total=930 [2018-10-04 09:24:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 09:24:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 09:24:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 09:24:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-10-04 09:24:56,563 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 31 [2018-10-04 09:24:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:24:56,563 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-10-04 09:24:56,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 09:24:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-10-04 09:24:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-04 09:24:56,564 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:24:56,564 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-10-04 09:24:56,564 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:24:56,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:24:56,565 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 27 times [2018-10-04 09:24:56,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:24:56,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:24:56,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:56,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:24:56,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:24:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:05,523 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 09:25:05,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:05,524 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 09:25:05,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:25:05,566 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 09:25:05,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:05,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:05,594 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 09:25:05,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:05,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 09:25:05,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 09:25:05,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 09:25:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=928, Unknown=3, NotChecked=0, Total=992 [2018-10-04 09:25:05,626 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 32 states. [2018-10-04 09:25:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:15,658 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-10-04 09:25:15,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 09:25:15,658 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-10-04 09:25:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:15,659 INFO L225 Difference]: With dead ends: 43 [2018-10-04 09:25:15,659 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 09:25:15,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=61, Invalid=928, Unknown=3, NotChecked=0, Total=992 [2018-10-04 09:25:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 09:25:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 09:25:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 09:25:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-10-04 09:25:15,666 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 32 [2018-10-04 09:25:15,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:15,666 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-10-04 09:25:15,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 09:25:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-10-04 09:25:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-04 09:25:15,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:15,668 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-10-04 09:25:15,668 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:15,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 28 times [2018-10-04 09:25:15,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:15,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:15,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:15,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:17,727 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:25:17,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:17,727 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:25:17,735 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:25:17,752 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:25:17,752 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:17,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:25:17,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:17,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 09:25:17,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 09:25:17,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 09:25:17,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 09:25:17,822 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 33 states. [2018-10-04 09:25:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:27,177 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-10-04 09:25:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 09:25:27,178 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-10-04 09:25:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:27,179 INFO L225 Difference]: With dead ends: 44 [2018-10-04 09:25:27,179 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 09:25:27,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-04 09:25:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 09:25:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 09:25:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 09:25:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-10-04 09:25:27,185 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 33 [2018-10-04 09:25:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:27,185 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-10-04 09:25:27,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 09:25:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-10-04 09:25:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-04 09:25:27,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:27,186 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-10-04 09:25:27,186 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:27,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 29 times [2018-10-04 09:25:27,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:27,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:27,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:27,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:27,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 495 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:25:31,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:31,350 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:25:31,358 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:25:31,382 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-10-04 09:25:31,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:31,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 495 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:25:31,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:31,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-04 09:25:31,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 09:25:31,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 09:25:31,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1056, Unknown=1, NotChecked=0, Total=1122 [2018-10-04 09:25:31,447 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 34 states. [2018-10-04 09:25:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:36,972 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-10-04 09:25:36,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 09:25:36,973 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-10-04 09:25:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:36,974 INFO L225 Difference]: With dead ends: 45 [2018-10-04 09:25:36,974 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 09:25:36,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=65, Invalid=1056, Unknown=1, NotChecked=0, Total=1122 [2018-10-04 09:25:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 09:25:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-04 09:25:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-04 09:25:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-10-04 09:25:36,979 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 34 [2018-10-04 09:25:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:36,979 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-10-04 09:25:36,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 09:25:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-10-04 09:25:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:25:36,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:36,980 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-10-04 09:25:36,980 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:36,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 30 times [2018-10-04 09:25:36,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:36,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:36,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:36,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:36,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 559 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:25:46,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:46,428 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 09:25:46,437 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:25:46,465 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-10-04 09:25:46,465 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:25:46,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 559 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:25:46,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:46,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 09:25:46,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 09:25:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 09:25:46,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1188, Unknown=3, NotChecked=0, Total=1260 [2018-10-04 09:25:46,504 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 36 states. [2018-10-04 09:25:52,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:25:52,349 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-10-04 09:25:52,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 09:25:52,349 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-10-04 09:25:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:25:52,350 INFO L225 Difference]: With dead ends: 47 [2018-10-04 09:25:52,350 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:25:52,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=69, Invalid=1188, Unknown=3, NotChecked=0, Total=1260 [2018-10-04 09:25:52,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:25:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-04 09:25:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-04 09:25:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-10-04 09:25:52,355 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 36 [2018-10-04 09:25:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:25:52,355 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-10-04 09:25:52,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 09:25:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-10-04 09:25:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 09:25:52,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:25:52,356 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-10-04 09:25:52,357 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:25:52,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:25:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 31 times [2018-10-04 09:25:52,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:25:52,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:25:52,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:52,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:25:52,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:25:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:25:55,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:25:55,378 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 09:25:55,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:25:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:25:55,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:25:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:25:55,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:25:55,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 09:25:55,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 09:25:55,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 09:25:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 09:25:55,456 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 37 states. [2018-10-04 09:26:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:07,742 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-10-04 09:26:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 09:26:07,743 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-10-04 09:26:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:07,744 INFO L225 Difference]: With dead ends: 48 [2018-10-04 09:26:07,744 INFO L226 Difference]: Without dead ends: 46 [2018-10-04 09:26:07,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 09:26:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-04 09:26:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-04 09:26:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-04 09:26:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-10-04 09:26:07,750 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 37 [2018-10-04 09:26:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:07,750 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-10-04 09:26:07,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 09:26:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-10-04 09:26:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-04 09:26:07,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:07,751 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-10-04 09:26:07,751 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:07,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 32 times [2018-10-04 09:26:07,752 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:07,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:07,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:26:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:18,634 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 09:26:18,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:18,635 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:26:18,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:26:18,664 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:26:18,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:18,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:18,679 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 09:26:18,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:18,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 09:26:18,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 09:26:18,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 09:26:18,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1330, Unknown=3, NotChecked=0, Total=1406 [2018-10-04 09:26:18,701 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 38 states. [2018-10-04 09:26:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:28,274 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-10-04 09:26:28,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 09:26:28,275 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-10-04 09:26:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:28,276 INFO L225 Difference]: With dead ends: 49 [2018-10-04 09:26:28,276 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 09:26:28,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=73, Invalid=1330, Unknown=3, NotChecked=0, Total=1406 [2018-10-04 09:26:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 09:26:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-04 09:26:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 09:26:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-10-04 09:26:28,281 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 38 [2018-10-04 09:26:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:28,282 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-10-04 09:26:28,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 09:26:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-10-04 09:26:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 09:26:28,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:28,282 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-10-04 09:26:28,283 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:28,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:28,283 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 33 times [2018-10-04 09:26:28,283 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:28,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:28,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:26:28,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:26:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 661 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:26:46,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:26:46,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 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 09:26:46,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:26:46,772 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-10-04 09:26:46,772 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:26:46,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:26:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 661 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:26:46,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:26:46,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 09:26:46,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 09:26:46,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 09:26:46,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1400, Unknown=7, NotChecked=0, Total=1482 [2018-10-04 09:26:46,808 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 39 states. [2018-10-04 09:26:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:26:54,809 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-10-04 09:26:54,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 09:26:54,809 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-10-04 09:26:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:26:54,810 INFO L225 Difference]: With dead ends: 50 [2018-10-04 09:26:54,810 INFO L226 Difference]: Without dead ends: 48 [2018-10-04 09:26:54,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=75, Invalid=1400, Unknown=7, NotChecked=0, Total=1482 [2018-10-04 09:26:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-04 09:26:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-04 09:26:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-04 09:26:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-10-04 09:26:54,816 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 39 [2018-10-04 09:26:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:26:54,816 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-10-04 09:26:54,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 09:26:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-10-04 09:26:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 09:26:54,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:26:54,817 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-10-04 09:26:54,817 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:26:54,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:26:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 34 times [2018-10-04 09:26:54,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:26:54,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:26:54,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:54,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:26:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:26:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:27:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 700 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:27:09,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:27:09,972 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:27:09,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:27:10,006 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:27:10,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:27:10,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:27:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 700 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:27:10,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:27:10,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 09:27:10,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 09:27:10,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 09:27:10,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1477, Unknown=6, NotChecked=0, Total=1560 [2018-10-04 09:27:10,042 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 40 states. [2018-10-04 09:27:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:27:28,850 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-10-04 09:27:28,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 09:27:28,850 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-10-04 09:27:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:27:28,851 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:27:28,851 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 09:27:28,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=77, Invalid=1477, Unknown=6, NotChecked=0, Total=1560 [2018-10-04 09:27:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 09:27:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-04 09:27:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-04 09:27:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-10-04 09:27:28,856 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 40 [2018-10-04 09:27:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:27:28,856 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-10-04 09:27:28,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 09:27:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-10-04 09:27:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:27:28,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:27:28,857 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-10-04 09:27:28,857 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:27:28,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:27:28,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 35 times [2018-10-04 09:27:28,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:27:28,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:27:28,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:28,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:27:28,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:27:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-04 09:27:34,327 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 09:27:34,331 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 09:27:34,332 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:27:34 BoogieIcfgContainer [2018-10-04 09:27:34,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:27:34,333 INFO L168 Benchmark]: Toolchain (without parser) took 280425.56 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 121.1 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 359.4 MB). Peak memory consumption was 480.5 MB. Max. memory is 7.1 GB. [2018-10-04 09:27:34,334 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.95 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 09:27:34,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:27:34,335 INFO L168 Benchmark]: Boogie Preprocessor took 29.76 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 09:27:34,335 INFO L168 Benchmark]: RCFGBuilder took 258.75 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 09:27:34,336 INFO L168 Benchmark]: TraceAbstraction took 280091.54 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 121.1 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 459.4 MB. Max. memory is 7.1 GB. [2018-10-04 09:27:34,339 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.95 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 41.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.76 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 258.75 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 280091.54 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 121.1 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 338.2 MB). Peak memory consumption was 459.4 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 42 with TraceHistMax 38, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 280.0s OverallTime, 36 OverallIterations, 38 TraceHistogramMax, 129.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 113 SDtfs, 57 SDslu, 682 SDs, 0 SdLazy, 18510 SolverSat, 42 SolverUnsat, 50 SolverUnknown, 0 SolverNotchecked, 125.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1415 GetRequests, 692 SyntacticMatches, 33 SemanticMatches, 690 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 140.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=35, 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, 35 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 142.0s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 236 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 384474 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2830 ConjunctsInSsa, 1330 ConjunctsInUnsatCore, 69 InterpolantComputations, 1 PerfectInterpolantSequences, 1/16350 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_09-27-34-349.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_09-27-34-349.csv Completed graceful shutdown