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-9f4048f-m [2018-10-04 14:33:10,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:33:10,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:33:10,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:33:10,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:33:10,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:33:10,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:33:10,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:33:10,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:33:10,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:33:10,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:33:10,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:33:10,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:33:10,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:33:10,611 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:33:10,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:33:10,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:33:10,615 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:33:10,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:33:10,621 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:33:10,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:33:10,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:33:10,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:33:10,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:33:10,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:33:10,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:33:10,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:33:10,636 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:33:10,638 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:33:10,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:33:10,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:33:10,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:33:10,642 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:33:10,642 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:33:10,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:33:10,646 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:33:10,646 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-04 14:33:10,671 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:33:10,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:33:10,673 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:33:10,673 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:33:10,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:33:10,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:33:10,674 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:33:10,674 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:33:10,674 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:33:10,674 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:33:10,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:33:10,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:33:10,678 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:33:10,678 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:33:10,679 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:33:10,679 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:33:10,679 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:33:10,679 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:33:10,679 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:33:10,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:33:10,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:33:10,681 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:33:10,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:33:10,682 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:33:10,682 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:33:10,682 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:33:10,682 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:33:10,682 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:33:10,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:33:10,683 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:33:10,683 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:33:10,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:33:10,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:33:10,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:33:10,758 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:33:10,759 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:33:10,760 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2018-10-04 14:33:10,760 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2018-10-04 14:33:10,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:33:10,814 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:33:10,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:33:10,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:33:10,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:33:10,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... [2018-10-04 14:33:10,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... [2018-10-04 14:33:10,853 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 14:33:10,853 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 14:33:10,853 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 14:33:10,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:33:10,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:33:10,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:33:10,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:33:10,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... [2018-10-04 14:33:10,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... [2018-10-04 14:33:10,868 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... [2018-10-04 14:33:10,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... [2018-10-04 14:33:10,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... [2018-10-04 14:33:10,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... [2018-10-04 14:33:10,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... [2018-10-04 14:33:10,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:33:10,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:33:10,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:33:10,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:33:10,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:33:10,956 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 14:33:10,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 14:33:10,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 14:33:11,165 INFO L338 CfgBuilder]: Using library mode [2018-10-04 14:33:11,165 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:33:11 BoogieIcfgContainer [2018-10-04 14:33:11,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:33:11,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:33:11,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:33:11,170 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:33:11,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:33:10" (1/2) ... [2018-10-04 14:33:11,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321ff546 and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:33:11, skipping insertion in model container [2018-10-04 14:33:11,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:33:11" (2/2) ... [2018-10-04 14:33:11,174 INFO L112 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2018-10-04 14:33:11,183 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:33:11,191 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:33:11,239 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:33:11,239 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:33:11,240 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:33:11,240 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:33:11,240 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:33:11,240 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:33:11,240 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:33:11,241 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:33:11,241 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:33:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 14:33:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:33:11,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:11,262 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:33:11,263 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:11,269 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:11,269 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-10-04 14:33:11,271 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:11,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:11,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:11,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:33:11,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 14:33:11,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:33:11,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:33:11,428 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:11,430 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 14:33:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:11,504 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-10-04 14:33:11,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:33:11,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 14:33:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:11,518 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:33:11,518 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 14:33:11,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 14:33:11,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 14:33:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 14:33:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 14:33:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 14:33:11,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 14:33:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:11,555 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 14:33:11,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:33:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 14:33:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 14:33:11,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:11,556 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 14:33:11,556 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:11,557 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-10-04 14:33:11,557 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:11,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:11,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:11,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:11,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:11,744 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:11,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:11,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:11,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:11,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 14:33:11,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 14:33:11,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 14:33:11,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:11,917 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-04 14:33:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:11,975 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 14:33:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 14:33:11,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-04 14:33:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:11,977 INFO L225 Difference]: With dead ends: 8 [2018-10-04 14:33:11,977 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 14:33:11,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 2 [2018-10-04 14:33:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 14:33:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 14:33:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 14:33:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 14:33:11,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 14:33:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:11,982 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 14:33:11,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 14:33:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 14:33:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:33:11,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:11,983 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-04 14:33:11,983 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:11,983 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-10-04 14:33:11,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:11,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:11,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:11,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:11,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:12,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:12,139 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 14:33:12,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:12,161 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:33:12,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:12,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:12,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:12,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:33:12,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:33:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:33:12,229 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:12,230 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-04 14:33:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:12,270 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 14:33:12,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:33:12,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:33:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:12,271 INFO L225 Difference]: With dead ends: 9 [2018-10-04 14:33:12,272 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:33:12,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:33:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:33:12,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 14:33:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 14:33:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 14:33:12,275 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 14:33:12,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:12,275 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 14:33:12,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:33:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 14:33:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 14:33:12,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:12,277 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-04 14:33:12,277 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:12,277 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:12,277 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-10-04 14:33:12,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:12,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:12,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:12,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:12,434 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:12,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:33:12,484 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 14:33:12,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:12,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:12,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:12,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:33:12,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:33:12,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:33:12,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:12,551 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-04 14:33:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:12,756 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 14:33:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:33:12,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-04 14:33:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:12,757 INFO L225 Difference]: With dead ends: 10 [2018-10-04 14:33:12,757 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 14:33:12,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 4 [2018-10-04 14:33:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 14:33:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 14:33:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 14:33:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 14:33:12,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 14:33:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:12,761 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 14:33:12,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:33:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 14:33:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 14:33:12,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:12,762 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-04 14:33:12,763 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:12,763 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-10-04 14:33:12,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:12,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:12,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:12,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:12,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:12,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:12,965 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:12,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:33:12,998 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:33:12,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:12,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:13,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:13,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 14:33:13,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 14:33:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 14:33:13,066 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:13,066 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-04 14:33:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:13,160 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 14:33:13,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 14:33:13,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 14:33:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:13,161 INFO L225 Difference]: With dead ends: 11 [2018-10-04 14:33:13,162 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 14:33:13,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 5 [2018-10-04 14:33:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 14:33:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 14:33:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 14:33:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 14:33:13,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 14:33:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:13,165 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 14:33:13,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 14:33:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 14:33:13,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 14:33:13,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:13,166 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-04 14:33:13,167 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:13,167 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:13,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-10-04 14:33:13,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:13,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:13,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:13,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:13,420 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:13,429 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:33:13,447 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 14:33:13,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:13,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:13,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:13,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:33:13,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:33:13,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:33:13,501 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:13,501 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-04 14:33:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:13,572 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 14:33:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:33:13,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 14:33:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:13,574 INFO L225 Difference]: With dead ends: 12 [2018-10-04 14:33:13,574 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 14:33:13,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 6 [2018-10-04 14:33:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 14:33:13,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 14:33:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:33:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 14:33:13,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 14:33:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:13,578 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 14:33:13,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:33:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 14:33:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:33:13,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:13,579 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-04 14:33:13,579 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:13,579 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-10-04 14:33:13,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:13,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:13,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:13,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:13,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:13,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:13,849 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:33:13,917 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 14:33:13,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:13,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:14,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:14,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:33:14,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:33:14,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:33:14,226 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:14,226 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-04 14:33:14,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:14,333 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 14:33:14,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:33:14,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 14:33:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:14,335 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:33:14,335 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:33:14,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 7 [2018-10-04 14:33:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:33:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 14:33:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 14:33:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 14:33:14,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 14:33:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:14,339 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 14:33:14,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:33:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 14:33:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 14:33:14,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:14,340 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-04 14:33:14,341 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:14,341 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:14,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-10-04 14:33:14,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:14,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:14,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:14,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:14,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:14,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:14,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:14,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:14,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:14,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:14,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 14:33:14,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 14:33:14,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 14:33:14,673 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:14,675 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-04 14:33:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:14,868 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 14:33:14,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 14:33:14,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-04 14:33:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:14,870 INFO L225 Difference]: With dead ends: 14 [2018-10-04 14:33:14,870 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 14:33:14,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 8 [2018-10-04 14:33:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 14:33:14,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 14:33:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:33:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 14:33:14,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 14:33:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:14,874 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 14:33:14,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 14:33:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 14:33:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:33:14,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:14,874 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-04 14:33:14,875 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:14,875 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-10-04 14:33:14,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:14,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:14,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:15,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:15,293 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:15,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:33:15,330 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:33:15,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:15,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:33:16,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:16,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-04 14:33:16,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:33:16,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:33:16,232 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:16,232 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 19 states. [2018-10-04 14:33:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:17,360 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-10-04 14:33:17,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:33:17,360 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2018-10-04 14:33:17,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:17,361 INFO L225 Difference]: With dead ends: 35 [2018-10-04 14:33:17,362 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 14:33:17,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.5s impTime 31 [2018-10-04 14:33:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 14:33:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-10-04 14:33:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 14:33:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-04 14:33:17,368 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2018-10-04 14:33:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:17,368 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-04 14:33:17,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:33:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-04 14:33:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 14:33:17,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:17,370 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-04 14:33:17,370 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:17,370 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:17,370 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-10-04 14:33:17,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:17,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:17,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:17,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:17,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:17,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:17,608 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:33:17,634 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 14:33:17,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:17,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:17,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:17,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:33:17,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:33:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:33:17,747 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:17,747 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 12 states. [2018-10-04 14:33:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:17,892 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-10-04 14:33:17,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:33:17,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-04 14:33:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:17,896 INFO L225 Difference]: With dead ends: 23 [2018-10-04 14:33:17,896 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 14:33:17,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 10 [2018-10-04 14:33:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 14:33:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 14:33:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 14:33:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-10-04 14:33:17,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2018-10-04 14:33:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:17,903 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-10-04 14:33:17,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:33:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-10-04 14:33:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:33:17,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:17,904 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-10-04 14:33:17,904 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:17,904 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:17,904 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-10-04 14:33:17,905 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:17,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:17,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:18,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:18,257 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:18,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:33:18,294 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:33:18,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:18,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:18,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:18,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 14:33:18,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 14:33:18,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 14:33:18,598 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:18,598 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 13 states. [2018-10-04 14:33:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:18,924 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-10-04 14:33:18,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 14:33:18,926 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-04 14:33:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:18,926 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:33:18,926 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 14:33:18,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 11 [2018-10-04 14:33:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 14:33:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 14:33:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:33:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-10-04 14:33:18,935 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-10-04 14:33:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:18,935 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-10-04 14:33:18,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 14:33:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-10-04 14:33:18,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 14:33:18,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:18,936 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-10-04 14:33:18,936 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:18,936 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:18,937 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-10-04 14:33:18,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:18,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:18,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:18,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:18,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:19,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:19,271 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:19,300 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:33:19,316 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 14:33:19,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:19,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:19,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:19,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:33:19,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:33:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:33:19,383 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:19,384 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 14 states. [2018-10-04 14:33:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:19,655 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-10-04 14:33:19,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:33:19,655 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 14:33:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:19,656 INFO L225 Difference]: With dead ends: 25 [2018-10-04 14:33:19,656 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 14:33:19,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 12 [2018-10-04 14:33:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 14:33:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 14:33:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 14:33:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-10-04 14:33:19,662 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2018-10-04 14:33:19,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:19,662 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-10-04 14:33:19,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:33:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-10-04 14:33:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 14:33:19,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:19,663 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-10-04 14:33:19,664 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:19,664 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:19,664 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-10-04 14:33:19,664 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:19,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:19,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:19,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:19,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:20,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:20,290 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:20,299 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:33:20,316 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 14:33:20,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:20,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:20,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:20,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:33:20,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:33:20,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:33:20,388 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:20,389 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 15 states. [2018-10-04 14:33:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:20,640 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-10-04 14:33:20,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:33:20,641 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 14:33:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:20,641 INFO L225 Difference]: With dead ends: 26 [2018-10-04 14:33:20,641 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 14:33:20,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.5s impTime 13 [2018-10-04 14:33:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 14:33:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 14:33:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 14:33:20,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-10-04 14:33:20,648 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2018-10-04 14:33:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:20,648 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-10-04 14:33:20,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:33:20,648 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-10-04 14:33:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 14:33:20,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:20,649 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-10-04 14:33:20,650 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:20,650 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-10-04 14:33:20,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:20,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:20,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:20,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:21,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:21,254 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:21,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:21,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:21,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:21,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 14:33:21,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 14:33:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 14:33:21,356 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:21,357 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 16 states. [2018-10-04 14:33:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:21,622 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-10-04 14:33:21,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 14:33:21,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-10-04 14:33:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:21,626 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:33:21,626 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 14:33:21,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 14 [2018-10-04 14:33:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 14:33:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 14:33:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 14:33:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-10-04 14:33:21,632 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-10-04 14:33:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:21,632 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-10-04 14:33:21,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 14:33:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-10-04 14:33:21,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:33:21,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:21,633 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-10-04 14:33:21,633 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:21,633 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-10-04 14:33:21,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:21,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:33:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:22,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:22,289 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:22,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:33:22,311 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:33:22,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:22,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:22,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:22,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:33:22,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:33:22,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:33:22,442 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:22,442 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2018-10-04 14:33:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:22,752 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-10-04 14:33:22,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:33:22,753 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-10-04 14:33:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:22,754 INFO L225 Difference]: With dead ends: 28 [2018-10-04 14:33:22,754 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 14:33:22,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 15 [2018-10-04 14:33:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 14:33:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 14:33:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 14:33:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-04 14:33:22,759 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2018-10-04 14:33:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:22,760 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-04 14:33:22,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:33:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-10-04 14:33:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 14:33:22,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:22,761 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-10-04 14:33:22,761 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:22,761 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-10-04 14:33:22,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:22,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:22,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:22,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:22,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:23,420 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:23,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:23,420 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:23,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:33:23,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 14:33:23,449 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:23,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:23,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:23,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:33:23,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:33:23,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:33:23,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:23,536 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2018-10-04 14:33:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:24,021 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-10-04 14:33:24,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:33:24,022 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 14:33:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:24,023 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:33:24,023 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 14:33:24,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 16 [2018-10-04 14:33:24,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 14:33:24,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 14:33:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 14:33:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-10-04 14:33:24,030 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2018-10-04 14:33:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:24,030 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-10-04 14:33:24,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:33:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-10-04 14:33:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 14:33:24,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:24,031 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-10-04 14:33:24,031 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:24,031 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:24,032 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 16 times [2018-10-04 14:33:24,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:24,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:24,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:24,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:24,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:33:24,557 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 14:33:24,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:33:24,577 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:33:24,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:33:24,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:33:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:33:24,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:33:24,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:33:24,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:33:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:33:24,705 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:33:24,705 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 20 states. [2018-10-04 14:33:27,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:33:27,200 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-10-04 14:33:27,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:33:27,201 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-10-04 14:33:27,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:33:27,202 INFO L225 Difference]: With dead ends: 31 [2018-10-04 14:33:27,202 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 14:33:27,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 18 [2018-10-04 14:33:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 14:33:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 14:33:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 14:33:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-10-04 14:33:27,209 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2018-10-04 14:33:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:33:27,209 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-10-04 14:33:27,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:33:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-10-04 14:33:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:33:27,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:33:27,210 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-10-04 14:33:27,210 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:33:27,211 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:33:27,211 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 17 times [2018-10-04 14:33:27,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:33:27,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:33:27,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:27,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:33:27,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:33:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:33:30,746 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.ImplicationMap.internImplication(ImplicationMap.java:190) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.ImplicationMap.unifyPredicate(ImplicationMap.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:234) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:218) 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:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-04 14:33:30,750 INFO L168 Benchmark]: Toolchain (without parser) took 19936.49 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 31.5 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 406.9 MB). Peak memory consumption was 438.3 MB. Max. memory is 7.1 GB. [2018-10-04 14:33:30,752 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:33:30,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:33:30,753 INFO L168 Benchmark]: Boogie Preprocessor took 23.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 14:33:30,754 INFO L168 Benchmark]: RCFGBuilder took 285.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 14:33:30,754 INFO L168 Benchmark]: TraceAbstraction took 19582.51 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 31.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 385.7 MB). Peak memory consumption was 417.2 MB. Max. memory is 7.1 GB. [2018-10-04 14:33:30,759 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.65 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 285.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19582.51 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 31.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 385.7 MB). Peak memory consumption was 417.2 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.ImplicationMap.internImplication(ImplicationMap.java:190) 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-04_14-33-30-771.csv Received shutdown request...