java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:47:59,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:47:59,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:47:59,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:47:59,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:47:59,604 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:47:59,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:47:59,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:47:59,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:47:59,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:47:59,613 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:47:59,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:47:59,617 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:47:59,618 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:47:59,619 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:47:59,628 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:47:59,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:47:59,631 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:47:59,636 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:47:59,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:47:59,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:47:59,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:47:59,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:47:59,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:47:59,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:47:59,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:47:59,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:47:59,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:47:59,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:47:59,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:47:59,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:47:59,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:47:59,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:47:59,657 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:47:59,660 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:47:59,661 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:47:59,661 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-30 20:47:59,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:47:59,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:47:59,687 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:47:59,688 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:47:59,689 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:47:59,689 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:47:59,689 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:47:59,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:47:59,689 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:47:59,690 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:47:59,690 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:47:59,690 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:47:59,690 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:47:59,691 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:47:59,692 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:47:59,692 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:47:59,692 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:47:59,692 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:47:59,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:47:59,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:47:59,694 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:47:59,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:47:59,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:47:59,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:47:59,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:47:59,695 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:47:59,695 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:47:59,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:47:59,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:47:59,696 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:47:59,696 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 20:47:59,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:47:59,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:47:59,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:47:59,774 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:47:59,774 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:47:59,775 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2018-09-30 20:47:59,775 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2018-09-30 20:47:59,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:47:59,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:47:59,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:59,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:47:59,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:47:59,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... [2018-09-30 20:47:59,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... [2018-09-30 20:47:59,872 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 20:47:59,872 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 20:47:59,873 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 20:47:59,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:47:59,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:47:59,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:47:59,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:47:59,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... [2018-09-30 20:47:59,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... [2018-09-30 20:47:59,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... [2018-09-30 20:47:59,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... [2018-09-30 20:47:59,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... [2018-09-30 20:47:59,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... [2018-09-30 20:47:59,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... [2018-09-30 20:47:59,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:47:59,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:47:59,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:47:59,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:47:59,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:47:59,972 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-30 20:47:59,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 20:47:59,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 20:48:00,189 INFO L345 CfgBuilder]: Using library mode [2018-09-30 20:48:00,189 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:48:00 BoogieIcfgContainer [2018-09-30 20:48:00,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:48:00,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:48:00,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:48:00,194 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:48:00,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:47:59" (1/2) ... [2018-09-30 20:48:00,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251e3884 and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:48:00, skipping insertion in model container [2018-09-30 20:48:00,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:48:00" (2/2) ... [2018-09-30 20:48:00,201 INFO L112 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2018-09-30 20:48:00,212 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:48:00,222 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:48:00,272 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:48:00,273 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:48:00,273 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:48:00,273 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:48:00,273 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:48:00,274 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:48:00,274 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:48:00,274 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:48:00,274 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:48:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-30 20:48:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 20:48:00,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:00,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-30 20:48:00,297 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:00,304 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-09-30 20:48:00,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:00,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:00,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:00,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:48:00,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:00,473 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:48:00,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-30 20:48:00,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 20:48:00,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 20:48:00,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:00,493 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-30 20:48:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:00,703 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-09-30 20:48:00,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 20:48:00,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-30 20:48:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:00,718 INFO L225 Difference]: With dead ends: 11 [2018-09-30 20:48:00,718 INFO L226 Difference]: Without dead ends: 5 [2018-09-30 20:48:00,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 20:48:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-30 20:48:00,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-30 20:48:00,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-30 20:48:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-30 20:48:00,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-30 20:48:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:00,752 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-30 20:48:00,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 20:48:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-30 20:48:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 20:48:00,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:00,753 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 20:48:00,753 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:00,753 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:00,753 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-09-30 20:48:00,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:00,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:00,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:48:00,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:00,847 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:00,847 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:00,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:48:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:00,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:00,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:00,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-30 20:48:00,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:48:00,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:48:00,983 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:00,983 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-09-30 20:48:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:01,102 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-30 20:48:01,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:48:01,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-30 20:48:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:01,104 INFO L225 Difference]: With dead ends: 8 [2018-09-30 20:48:01,104 INFO L226 Difference]: Without dead ends: 6 [2018-09-30 20:48:01,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:48:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-30 20:48:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-30 20:48:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 20:48:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 20:48:01,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-30 20:48:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:01,109 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-30 20:48:01,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:48:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 20:48:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 20:48:01,110 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:01,110 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-30 20:48:01,110 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:01,111 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:01,111 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-09-30 20:48:01,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:01,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:01,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:01,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:48:01,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:01,255 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:01,256 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:01,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:48:01,299 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:48:01,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:01,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:01,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:01,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 20:48:01,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:48:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:48:01,365 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:01,365 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-09-30 20:48:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:01,684 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-30 20:48:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 20:48:01,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-30 20:48:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:01,686 INFO L225 Difference]: With dead ends: 9 [2018-09-30 20:48:01,687 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 20:48:01,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:48:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 20:48:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 20:48:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 20:48:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 20:48:01,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-30 20:48:01,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:01,691 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-30 20:48:01,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:48:01,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 20:48:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 20:48:01,692 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:01,692 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-30 20:48:01,693 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:01,693 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:01,693 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-09-30 20:48:01,693 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:01,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:01,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:01,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:01,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:01,873 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:01,873 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:01,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:48:01,922 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 20:48:01,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:01,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:01,980 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:01,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 20:48:01,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:48:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:48:01,982 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:01,982 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-30 20:48:02,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:02,266 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-30 20:48:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:48:02,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-30 20:48:02,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:02,268 INFO L225 Difference]: With dead ends: 10 [2018-09-30 20:48:02,268 INFO L226 Difference]: Without dead ends: 8 [2018-09-30 20:48:02,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:48:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-30 20:48:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-30 20:48:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 20:48:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-30 20:48:02,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-30 20:48:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:02,272 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-30 20:48:02,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:48:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-30 20:48:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 20:48:02,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:02,273 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-30 20:48:02,273 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:02,273 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:02,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-09-30 20:48:02,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:02,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:02,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:02,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:02,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:02,430 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:02,431 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:02,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:48:02,451 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:48:02,451 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:02,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:02,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:02,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 20:48:02,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 20:48:02,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 20:48:02,515 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:02,515 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-30 20:48:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:03,150 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 20:48:03,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 20:48:03,151 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-30 20:48:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:03,151 INFO L225 Difference]: With dead ends: 11 [2018-09-30 20:48:03,152 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 20:48:03,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:48:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 20:48:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 20:48:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 20:48:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 20:48:03,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-30 20:48:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:03,157 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 20:48:03,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 20:48:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 20:48:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:48:03,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:03,157 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-30 20:48:03,158 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:03,158 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:03,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-09-30 20:48:03,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:03,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:03,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:03,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:03,329 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:03,329 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:03,339 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:48:03,348 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-30 20:48:03,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:03,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:03,404 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:03,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 20:48:03,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 20:48:03,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 20:48:03,405 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:03,406 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-09-30 20:48:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:03,788 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-30 20:48:03,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:48:03,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-30 20:48:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:03,791 INFO L225 Difference]: With dead ends: 12 [2018-09-30 20:48:03,791 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 20:48:03,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:48:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 20:48:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-30 20:48:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-30 20:48:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-30 20:48:03,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-30 20:48:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:03,795 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-30 20:48:03,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 20:48:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-30 20:48:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 20:48:03,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:03,796 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-30 20:48:03,796 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:03,796 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-09-30 20:48:03,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:03,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:03,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:03,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:03,981 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:03,981 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:03,993 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:48:04,005 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-09-30 20:48:04,005 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:04,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:04,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:04,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-30 20:48:04,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:48:04,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:48:04,066 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:04,067 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-09-30 20:48:04,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:04,508 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-30 20:48:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:48:04,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-30 20:48:04,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:04,510 INFO L225 Difference]: With dead ends: 13 [2018-09-30 20:48:04,510 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 20:48:04,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-09-30 20:48:04,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 20:48:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 20:48:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 20:48:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 20:48:04,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-30 20:48:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:04,515 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 20:48:04,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:48:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 20:48:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:48:04,516 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:04,516 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-30 20:48:04,516 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:04,516 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-09-30 20:48:04,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:04,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:04,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:04,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:04,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:04,716 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:04,716 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:04,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:48:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:04,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:04,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:04,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-09-30 20:48:04,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:48:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:48:04,842 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:04,843 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-09-30 20:48:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:05,268 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-30 20:48:05,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 20:48:05,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-30 20:48:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:05,270 INFO L225 Difference]: With dead ends: 14 [2018-09-30 20:48:05,271 INFO L226 Difference]: Without dead ends: 12 [2018-09-30 20:48:05,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:48:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-30 20:48:05,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-30 20:48:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 20:48:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-30 20:48:05,275 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-30 20:48:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:05,276 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-30 20:48:05,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:48:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-30 20:48:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 20:48:05,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:05,276 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-30 20:48:05,277 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:05,277 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:05,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-09-30 20:48:05,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:05,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:05,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:05,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:48:05,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:05,662 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:05,662 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:05,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:48:05,693 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:48:05,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:05,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-30 20:48:06,366 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:06,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-09-30 20:48:06,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 20:48:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 20:48:06,367 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:06,367 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 19 states. [2018-09-30 20:48:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:09,493 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-09-30 20:48:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 20:48:09,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2018-09-30 20:48:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:09,495 INFO L225 Difference]: With dead ends: 35 [2018-09-30 20:48:09,495 INFO L226 Difference]: Without dead ends: 32 [2018-09-30 20:48:09,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-09-30 20:48:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-30 20:48:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-09-30 20:48:09,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 20:48:09,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-09-30 20:48:09,501 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2018-09-30 20:48:09,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:09,501 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-09-30 20:48:09,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 20:48:09,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-09-30 20:48:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:48:09,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:09,502 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-30 20:48:09,503 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:09,503 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:09,503 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-09-30 20:48:09,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:09,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:09,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:09,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:09,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:09,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:09,729 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:09,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:48:09,755 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 20:48:09,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:09,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:09,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:09,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-09-30 20:48:09,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 20:48:09,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 20:48:09,880 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:09,880 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 12 states. [2018-09-30 20:48:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:10,558 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-09-30 20:48:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 20:48:10,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-30 20:48:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:10,562 INFO L225 Difference]: With dead ends: 23 [2018-09-30 20:48:10,562 INFO L226 Difference]: Without dead ends: 21 [2018-09-30 20:48:10,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:48:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-30 20:48:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-30 20:48:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 20:48:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-09-30 20:48:10,568 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2018-09-30 20:48:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:10,568 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-09-30 20:48:10,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 20:48:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-09-30 20:48:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 20:48:10,569 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:10,569 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-30 20:48:10,569 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:10,569 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-09-30 20:48:10,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:10,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:10,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:10,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:10,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:10,919 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:10,919 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:10,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:48:10,953 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:48:10,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:10,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:11,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:11,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-09-30 20:48:11,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:48:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:48:11,252 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:11,252 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 13 states. [2018-09-30 20:48:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:12,112 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-09-30 20:48:12,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 20:48:12,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-30 20:48:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:12,113 INFO L225 Difference]: With dead ends: 24 [2018-09-30 20:48:12,114 INFO L226 Difference]: Without dead ends: 22 [2018-09-30 20:48:12,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-09-30 20:48:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-30 20:48:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-30 20:48:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-30 20:48:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-09-30 20:48:12,119 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-09-30 20:48:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:12,119 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-09-30 20:48:12,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:48:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-09-30 20:48:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:48:12,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:12,120 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-30 20:48:12,120 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:12,120 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-09-30 20:48:12,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:12,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:12,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:12,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:12,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:12,435 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:12,435 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:12,444 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:48:12,456 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-30 20:48:12,456 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:12,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:12,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:12,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-09-30 20:48:12,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 20:48:12,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 20:48:12,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:12,548 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 14 states. [2018-09-30 20:48:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:13,292 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-09-30 20:48:13,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:48:13,292 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-30 20:48:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:13,293 INFO L225 Difference]: With dead ends: 25 [2018-09-30 20:48:13,294 INFO L226 Difference]: Without dead ends: 23 [2018-09-30 20:48:13,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-09-30 20:48:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-30 20:48:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-30 20:48:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 20:48:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-09-30 20:48:13,299 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2018-09-30 20:48:13,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:13,299 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-09-30 20:48:13,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 20:48:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-09-30 20:48:13,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 20:48:13,300 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:13,300 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-30 20:48:13,300 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:13,301 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:13,301 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-09-30 20:48:13,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:13,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:13,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:13,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:13,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:13,581 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:13,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:48:13,601 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 20:48:13,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:13,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:13,668 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:13,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-09-30 20:48:13,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 20:48:13,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 20:48:13,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:13,669 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 15 states. [2018-09-30 20:48:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:14,680 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-09-30 20:48:14,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:48:14,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-30 20:48:14,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:14,681 INFO L225 Difference]: With dead ends: 26 [2018-09-30 20:48:14,681 INFO L226 Difference]: Without dead ends: 24 [2018-09-30 20:48:14,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-09-30 20:48:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-30 20:48:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-30 20:48:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-30 20:48:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-09-30 20:48:14,687 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2018-09-30 20:48:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:14,687 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-09-30 20:48:14,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 20:48:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-09-30 20:48:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:48:14,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:14,688 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-09-30 20:48:14,688 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:14,689 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-09-30 20:48:14,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:14,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:14,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:14,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:15,153 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:15,153 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:15,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:48:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:15,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:15,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:15,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-09-30 20:48:15,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:48:15,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:48:15,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:15,278 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 16 states. [2018-09-30 20:48:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:16,349 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-09-30 20:48:16,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 20:48:16,350 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-09-30 20:48:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:16,350 INFO L225 Difference]: With dead ends: 27 [2018-09-30 20:48:16,351 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 20:48:16,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-09-30 20:48:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 20:48:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-30 20:48:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 20:48:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-09-30 20:48:16,355 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-09-30 20:48:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:16,356 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-09-30 20:48:16,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:48:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-09-30 20:48:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 20:48:16,356 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:16,356 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-09-30 20:48:16,357 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:16,357 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-09-30 20:48:16,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:16,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:16,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:16,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:48:16,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:16,928 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:16,929 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:16,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:48:16,963 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:48:16,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:16,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:17,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:17,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-09-30 20:48:17,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 20:48:17,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 20:48:17,133 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:17,133 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2018-09-30 20:48:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:18,659 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-09-30 20:48:18,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:48:18,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-09-30 20:48:18,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:18,662 INFO L225 Difference]: With dead ends: 28 [2018-09-30 20:48:18,663 INFO L226 Difference]: Without dead ends: 26 [2018-09-30 20:48:18,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-09-30 20:48:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-30 20:48:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-30 20:48:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-30 20:48:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-09-30 20:48:18,668 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2018-09-30 20:48:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:18,668 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-09-30 20:48:18,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 20:48:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-09-30 20:48:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:48:18,669 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:18,669 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-09-30 20:48:18,669 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:18,669 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-09-30 20:48:18,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:18,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:18,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:19,684 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:19,684 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:19,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:48:19,706 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-09-30 20:48:19,706 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:19,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:19,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:19,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-09-30 20:48:19,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:48:19,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:48:19,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:19,790 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2018-09-30 20:48:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:21,172 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-09-30 20:48:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:48:21,173 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-30 20:48:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:21,173 INFO L225 Difference]: With dead ends: 29 [2018-09-30 20:48:21,174 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 20:48:21,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-09-30 20:48:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 20:48:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-30 20:48:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 20:48:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-09-30 20:48:21,179 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2018-09-30 20:48:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:21,179 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-09-30 20:48:21,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:48:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-09-30 20:48:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 20:48:21,180 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:21,180 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-09-30 20:48:21,180 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:21,180 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:21,180 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 16 times [2018-09-30 20:48:21,181 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:21,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:21,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:22,480 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:22,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:22,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:48:22,523 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:48:22,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:22,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:22,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:22,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-09-30 20:48:22,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 20:48:22,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 20:48:22,622 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:22,622 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 20 states. [2018-09-30 20:48:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:24,326 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-09-30 20:48:24,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 20:48:24,326 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-30 20:48:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:24,327 INFO L225 Difference]: With dead ends: 31 [2018-09-30 20:48:24,327 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 20:48:24,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-09-30 20:48:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 20:48:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-30 20:48:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 20:48:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-09-30 20:48:24,333 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2018-09-30 20:48:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:24,334 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-09-30 20:48:24,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 20:48:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-09-30 20:48:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 20:48:24,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:24,335 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-09-30 20:48:24,335 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:24,335 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 17 times [2018-09-30 20:48:24,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:24,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:24,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:25,000 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:48:25,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:48:25,008 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:48:25,025 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-09-30 20:48:25,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:48:25,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:48:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:48:25,150 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:48:25,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-09-30 20:48:25,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 20:48:25,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 20:48:25,151 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 20:48:25,151 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 21 states. [2018-09-30 20:48:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:48:29,091 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-09-30 20:48:29,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 20:48:29,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-30 20:48:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:48:29,092 INFO L225 Difference]: With dead ends: 32 [2018-09-30 20:48:29,092 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 20:48:29,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-09-30 20:48:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 20:48:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-30 20:48:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 20:48:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-09-30 20:48:29,097 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 21 [2018-09-30 20:48:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:48:29,098 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-09-30 20:48:29,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 20:48:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-09-30 20:48:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:48:29,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:48:29,099 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-09-30 20:48:29,099 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:48:29,099 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 20:48:29,099 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 18 times [2018-09-30 20:48:29,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:48:29,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:48:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:29,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:48:29,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:48:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:48:31,693 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationGraph.internImplication(ImplicationGraph.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationGraph.unifyPredicate(ImplicationGraph.java:111) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:246) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:209) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-09-30 20:48:31,697 INFO L168 Benchmark]: Toolchain (without parser) took 31869.18 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 188.2 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 125.9 MB). Peak memory consumption was 314.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:48:31,699 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:48:31,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:48:31,700 INFO L168 Benchmark]: Boogie Preprocessor took 26.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 20:48:31,701 INFO L168 Benchmark]: RCFGBuilder took 287.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 20:48:31,702 INFO L168 Benchmark]: TraceAbstraction took 31505.69 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 188.2 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 104.7 MB). Peak memory consumption was 292.9 MB. Max. memory is 7.1 GB. [2018-09-30 20:48:31,706 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.22 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.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 287.56 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31505.69 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 188.2 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 104.7 MB). Peak memory consumption was 292.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationGraph.internImplication(ImplicationGraph.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/AnnoyingVillain.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-48-31-717.csv Received shutdown request...