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-10-01 00:57:29,236 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:57:29,238 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:57:29,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:57:29,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:57:29,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:57:29,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:57:29,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:57:29,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:57:29,256 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:57:29,257 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:57:29,257 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:57:29,258 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:57:29,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:57:29,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:57:29,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:57:29,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:57:29,264 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:57:29,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:57:29,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:57:29,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:57:29,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:57:29,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:57:29,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:57:29,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:57:29,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:57:29,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:57:29,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:57:29,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:57:29,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:57:29,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:57:29,278 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:57:29,278 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:57:29,278 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:57:29,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:57:29,280 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:57:29,280 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:57:29,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:57:29,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:57:29,296 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:57:29,297 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:57:29,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:57:29,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:57:29,297 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:57:29,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:57:29,298 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:57:29,298 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:57:29,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:57:29,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:57:29,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:57:29,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:57:29,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:57:29,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:57:29,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:57:29,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:57:29,300 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:57:29,300 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:57:29,300 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:57:29,300 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:57:29,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:57:29,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:57:29,301 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:57:29,301 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:57:29,301 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:57:29,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:57:29,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:57:29,302 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:57:29,302 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:57:29,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:57:29,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:57:29,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:57:29,367 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:57:29,367 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:57:29,368 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2018-10-01 00:57:29,368 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2018-10-01 00:57:29,415 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:57:29,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:57:29,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:57:29,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:57:29,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:57:29,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... [2018-10-01 00:57:29,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... [2018-10-01 00:57:29,458 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:57:29,458 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:57:29,459 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:57:29,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:57:29,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:57:29,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:57:29,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:57:29,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... [2018-10-01 00:57:29,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... [2018-10-01 00:57:29,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... [2018-10-01 00:57:29,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... [2018-10-01 00:57:29,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... [2018-10-01 00:57:29,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... [2018-10-01 00:57:29,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... [2018-10-01 00:57:29,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:57:29,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:57:29,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:57:29,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:57:29,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:57:29,547 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-01 00:57:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-01 00:57:29,548 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-01 00:57:29,753 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:57:29,754 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:57:29 BoogieIcfgContainer [2018-10-01 00:57:29,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:57:29,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:57:29,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:57:29,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:57:29,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:57:29" (1/2) ... [2018-10-01 00:57:29,760 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 01.10 12:57:29, skipping insertion in model container [2018-10-01 00:57:29,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:57:29" (2/2) ... [2018-10-01 00:57:29,763 INFO L112 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2018-10-01 00:57:29,773 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:57:29,782 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:57:29,834 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:57:29,835 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:57:29,835 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:57:29,836 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:57:29,836 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:57:29,836 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:57:29,836 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:57:29,836 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:57:29,837 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:57:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-01 00:57:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 00:57:29,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:29,860 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-01 00:57:29,861 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:29,869 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:29,869 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-10-01 00:57:29,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:29,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:29,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:29,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:29,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:30,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:30,108 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:57:30,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-01 00:57:30,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:57:30,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:57:30,130 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:30,133 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-01 00:57:30,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:30,447 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-10-01 00:57:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:57:30,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-01 00:57:30,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:30,466 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:57:30,466 INFO L226 Difference]: Without dead ends: 5 [2018-10-01 00:57:30,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:57:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-01 00:57:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-01 00:57:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-01 00:57:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-01 00:57:30,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-01 00:57:30,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:30,507 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-01 00:57:30,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:57:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-01 00:57:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:57:30,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:30,508 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:57:30,508 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:30,508 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:30,509 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-10-01 00:57:30,509 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:30,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:30,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:30,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:30,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:30,612 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:30,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:30,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:30,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:30,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:30,814 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:57:30,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:57:30,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:57:30,815 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:30,818 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-01 00:57:31,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:31,181 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-01 00:57:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:57:31,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-01 00:57:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:31,185 INFO L225 Difference]: With dead ends: 8 [2018-10-01 00:57:31,185 INFO L226 Difference]: Without dead ends: 6 [2018-10-01 00:57:31,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:57:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-01 00:57:31,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-01 00:57:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-01 00:57:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-01 00:57:31,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-01 00:57:31,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:31,197 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-01 00:57:31,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:57:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-01 00:57:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:57:31,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:31,198 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-01 00:57:31,198 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:31,201 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-10-01 00:57:31,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:31,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:31,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:31,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:31,316 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:31,317 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:31,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:57:31,363 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:57:31,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:31,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:31,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:31,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:57:31,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:57:31,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:57:31,434 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:31,434 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-01 00:57:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:31,745 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-01 00:57:31,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:57:31,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-01 00:57:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:31,749 INFO L225 Difference]: With dead ends: 9 [2018-10-01 00:57:31,749 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:57:31,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:57:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:57:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:57:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:57:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 00:57:31,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-01 00:57:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:31,753 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-01 00:57:31,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:57:31,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 00:57:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:57:31,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:31,754 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-01 00:57:31,755 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:31,755 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:31,755 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-10-01 00:57:31,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:31,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:31,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:31,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:31,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:31,920 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:31,921 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:31,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:57:31,953 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-01 00:57:31,954 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:31,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:31,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:32,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:32,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:57:32,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:57:32,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:57:32,006 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:32,006 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-01 00:57:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:32,322 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-01 00:57:32,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:57:32,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-01 00:57:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:32,323 INFO L225 Difference]: With dead ends: 10 [2018-10-01 00:57:32,323 INFO L226 Difference]: Without dead ends: 8 [2018-10-01 00:57:32,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:57:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-01 00:57:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-01 00:57:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-01 00:57:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-01 00:57:32,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-01 00:57:32,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:32,328 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-01 00:57:32,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:57:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-01 00:57:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:57:32,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:32,328 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-01 00:57:32,329 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:32,329 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:32,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-10-01 00:57:32,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:32,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:32,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:32,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:32,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:32,499 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:32,499 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:32,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:57:32,516 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:57:32,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:32,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:32,579 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:32,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:57:32,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:57:32,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:57:32,580 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:32,580 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-01 00:57:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:33,208 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-01 00:57:33,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:57:33,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-01 00:57:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:33,210 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:57:33,210 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:57:33,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:57:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:57:33,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:57:33,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:57:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 00:57:33,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-01 00:57:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:33,214 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 00:57:33,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:57:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 00:57:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:57:33,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:33,215 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-01 00:57:33,216 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:33,216 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:33,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-10-01 00:57:33,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:33,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:33,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:33,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:33,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-10-01 00:57:33,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:33,385 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:57:33,416 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-01 00:57:33,417 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:33,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:33,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:33,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:57:33,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:57:33,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:57:33,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:33,470 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-01 00:57:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:33,899 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-01 00:57:33,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:57:33,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-01 00:57:33,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:33,901 INFO L225 Difference]: With dead ends: 12 [2018-10-01 00:57:33,901 INFO L226 Difference]: Without dead ends: 10 [2018-10-01 00:57:33,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:57:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-01 00:57:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-01 00:57:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-01 00:57:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-01 00:57:33,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-01 00:57:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:33,905 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-01 00:57:33,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:57:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-01 00:57:33,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:57:33,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:33,906 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-01 00:57:33,906 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:33,907 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:33,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-10-01 00:57:33,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:33,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:33,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:33,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:33,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:34,157 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:34,157 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:34,170 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:57:34,181 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-01 00:57:34,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:34,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:34,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:34,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:57:34,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:57:34,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:57:34,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:34,236 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-01 00:57:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:34,702 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-01 00:57:34,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:57:34,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-01 00:57:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:34,704 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:57:34,704 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:57:34,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:57:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:57:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:57:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:57:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 00:57:34,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-01 00:57:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:34,709 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 00:57:34,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:57:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 00:57:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:57:34,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:34,710 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-01 00:57:34,710 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:34,710 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-10-01 00:57:34,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:34,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:34,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:34,886 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:34,886 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:34,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:34,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:34,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:34,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:34,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:57:34,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:57:34,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:57:34,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:34,955 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-01 00:57:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:35,383 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-01 00:57:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:57:35,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-01 00:57:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:35,391 INFO L225 Difference]: With dead ends: 14 [2018-10-01 00:57:35,391 INFO L226 Difference]: Without dead ends: 12 [2018-10-01 00:57:35,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:57:35,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-01 00:57:35,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-01 00:57:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-01 00:57:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-01 00:57:35,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-01 00:57:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:35,395 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-01 00:57:35,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:57:35,395 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-01 00:57:35,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:57:35,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:35,396 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-01 00:57:35,396 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:35,396 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:35,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-10-01 00:57:35,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:35,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:35,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:35,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:35,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:35,795 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:35,795 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:35,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:57:35,825 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:57:35,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:35,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-01 00:57:36,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:36,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-01 00:57:36,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:57:36,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:57:36,457 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:36,457 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 19 states. [2018-10-01 00:57:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:39,761 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-10-01 00:57:39,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:57:39,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2018-10-01 00:57:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:39,762 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:57:39,763 INFO L226 Difference]: Without dead ends: 32 [2018-10-01 00:57:39,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 00:57:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-01 00:57:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-10-01 00:57:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:57:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-01 00:57:39,769 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2018-10-01 00:57:39,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:39,769 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-01 00:57:39,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:57:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-01 00:57:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:57:39,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:39,770 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-01 00:57:39,771 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:39,771 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-10-01 00:57:39,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:39,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:39,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:39,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:39,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:39,984 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:39,985 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:39,985 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:39,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:57:40,007 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-01 00:57:40,007 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:40,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:40,138 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:40,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:57:40,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:57:40,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:57:40,138 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:40,139 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 12 states. [2018-10-01 00:57:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:40,793 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-10-01 00:57:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:57:40,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-01 00:57:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:40,797 INFO L225 Difference]: With dead ends: 23 [2018-10-01 00:57:40,797 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 00:57:40,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:57:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 00:57:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-01 00:57:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:57:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-10-01 00:57:40,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2018-10-01 00:57:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:40,804 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-10-01 00:57:40,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:57:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-10-01 00:57:40,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:57:40,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:40,804 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-10-01 00:57:40,805 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:40,805 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:40,805 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-10-01 00:57:40,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:40,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:40,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:40,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:40,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:41,172 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:41,172 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:41,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:57:41,208 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:57:41,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:41,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:41,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:41,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:57:41,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:57:41,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:57:41,496 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:41,496 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 13 states. [2018-10-01 00:57:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:42,198 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-10-01 00:57:42,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:57:42,200 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-01 00:57:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:42,201 INFO L225 Difference]: With dead ends: 24 [2018-10-01 00:57:42,201 INFO L226 Difference]: Without dead ends: 22 [2018-10-01 00:57:42,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:57:42,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-01 00:57:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-01 00:57:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-01 00:57:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-10-01 00:57:42,206 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-10-01 00:57:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:42,207 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-10-01 00:57:42,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:57:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-10-01 00:57:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:57:42,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:42,207 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-10-01 00:57:42,208 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:42,208 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-10-01 00:57:42,208 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:42,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:42,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:42,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:42,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:42,499 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:42,499 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:42,509 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:57:42,520 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-01 00:57:42,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:42,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:42,602 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:42,602 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:57:42,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:57:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:57:42,603 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:42,603 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 14 states. [2018-10-01 00:57:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:43,418 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-10-01 00:57:43,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:57:43,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-01 00:57:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:43,419 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:57:43,419 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:57:43,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:57:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:57:43,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 00:57:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:57:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-10-01 00:57:43,426 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2018-10-01 00:57:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:43,426 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-10-01 00:57:43,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:57:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-10-01 00:57:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:57:43,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:43,427 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-10-01 00:57:43,427 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:43,427 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-10-01 00:57:43,428 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:43,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:43,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:43,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:43,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:43,696 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:43,696 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:43,705 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:57:43,720 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:57:43,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:43,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:43,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:43,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:57:43,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:57:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:57:43,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:43,790 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 15 states. [2018-10-01 00:57:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:44,809 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-10-01 00:57:44,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:57:44,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-01 00:57:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:44,811 INFO L225 Difference]: With dead ends: 26 [2018-10-01 00:57:44,811 INFO L226 Difference]: Without dead ends: 24 [2018-10-01 00:57:44,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:57:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-01 00:57:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-01 00:57:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-01 00:57:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-10-01 00:57:44,816 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2018-10-01 00:57:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:44,817 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-10-01 00:57:44,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:57:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-10-01 00:57:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:57:44,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:44,818 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-10-01 00:57:44,818 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:44,818 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-10-01 00:57:44,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:44,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:44,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:44,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:44,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:45,268 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:45,268 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:45,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:45,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:45,384 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:45,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:57:45,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:57:45,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:57:45,385 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:45,386 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 16 states. [2018-10-01 00:57:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:46,355 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-10-01 00:57:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:57:46,358 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-10-01 00:57:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:46,358 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:57:46,358 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:57:46,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:57:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:57:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-01 00:57:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:57:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-10-01 00:57:46,363 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-10-01 00:57:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:46,363 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-10-01 00:57:46,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:57:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-10-01 00:57:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:57:46,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:46,364 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-10-01 00:57:46,364 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:46,364 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:46,365 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-10-01 00:57:46,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:46,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:46,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:57:46,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:46,883 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:46,884 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:46,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:57:46,907 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:57:46,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:46,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:46,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:46,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:57:46,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:57:46,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:57:46,998 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:46,998 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2018-10-01 00:57:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:48,514 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-10-01 00:57:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:57:48,516 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-10-01 00:57:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:48,517 INFO L225 Difference]: With dead ends: 28 [2018-10-01 00:57:48,517 INFO L226 Difference]: Without dead ends: 26 [2018-10-01 00:57:48,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:57:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-01 00:57:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-01 00:57:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-01 00:57:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-01 00:57:48,522 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2018-10-01 00:57:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:48,522 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-01 00:57:48,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:57:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-10-01 00:57:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:57:48,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:48,523 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-10-01 00:57:48,523 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:48,524 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-10-01 00:57:48,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:48,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:48,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:48,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:49,460 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:49,460 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:49,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:57:49,483 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-01 00:57:49,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:49,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:49,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:49,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:57:49,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:57:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:57:49,559 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:49,559 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2018-10-01 00:57:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:50,888 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-10-01 00:57:50,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:57:50,889 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-01 00:57:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:50,890 INFO L225 Difference]: With dead ends: 29 [2018-10-01 00:57:50,890 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:57:50,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:57:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:57:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 00:57:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:57:50,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-10-01 00:57:50,897 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2018-10-01 00:57:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:50,897 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-10-01 00:57:50,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:57:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-10-01 00:57:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:57:50,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:50,898 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-10-01 00:57:50,898 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:50,899 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 16 times [2018-10-01 00:57:50,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:50,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:50,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:50,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:50,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:51,819 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:51,819 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:51,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:57:51,860 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:57:51,861 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:51,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:51,966 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:51,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:57:51,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:57:51,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:57:51,967 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:51,967 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 20 states. [2018-10-01 00:57:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:57:53,645 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-10-01 00:57:53,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:57:53,646 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-10-01 00:57:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:57:53,647 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:57:53,647 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 00:57:53,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:57:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 00:57:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-01 00:57:53,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:57:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-10-01 00:57:53,653 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2018-10-01 00:57:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:57:53,653 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-10-01 00:57:53,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:57:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-10-01 00:57:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-01 00:57:53,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:57:53,654 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-10-01 00:57:53,654 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:57:53,654 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:57:53,655 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 17 times [2018-10-01 00:57:53,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:57:53,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:57:53,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:53,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:57:53,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:57:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:57:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:54,658 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:57:54,659 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:57:54,668 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:57:54,684 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-01 00:57:54,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:57:54,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:57:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:57:54,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:57:54,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-01 00:57:54,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:57:54,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:57:54,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:57:54,824 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 21 states. [2018-10-01 00:58:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:00,617 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-10-01 00:58:00,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:58:00,617 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-10-01 00:58:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:00,618 INFO L225 Difference]: With dead ends: 32 [2018-10-01 00:58:00,618 INFO L226 Difference]: Without dead ends: 30 [2018-10-01 00:58:00,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:58:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-01 00:58:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-01 00:58:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-01 00:58:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-10-01 00:58:00,623 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 21 [2018-10-01 00:58:00,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:00,624 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-10-01 00:58:00,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:58:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-10-01 00:58:00,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:58:00,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:00,625 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-10-01 00:58:00,625 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:00,625 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:00,625 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 18 times [2018-10-01 00:58:00,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:00,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:00,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:00,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:03,234 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:126) 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-10-01 00:58:03,237 INFO L168 Benchmark]: Toolchain (without parser) took 33821.24 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 224.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 59.9 MB). Peak memory consumption was 284.8 MB. Max. memory is 7.1 GB. [2018-10-01 00:58:03,240 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:58:03,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:58:03,241 INFO L168 Benchmark]: Boogie Preprocessor took 21.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 00:58:03,241 INFO L168 Benchmark]: RCFGBuilder took 270.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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-10-01 00:58:03,242 INFO L168 Benchmark]: TraceAbstraction took 33481.64 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 224.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 38.8 MB). Peak memory consumption was 263.7 MB. Max. memory is 7.1 GB. [2018-10-01 00:58:03,247 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.56 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 270.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 33481.64 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 224.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 38.8 MB). Peak memory consumption was 263.7 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-10-01_00-58-03-258.csv Received shutdown request...