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 [2018-10-04 12:53:58,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:53:58,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:53:58,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:53:58,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:53:58,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:53:58,465 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:53:58,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:53:58,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:53:58,471 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:53:58,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:53:58,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:53:58,475 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:53:58,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:53:58,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:53:58,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:53:58,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:53:58,485 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:53:58,497 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:53:58,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:53:58,499 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:53:58,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:53:58,505 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:53:58,508 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:53:58,508 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:53:58,509 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:53:58,510 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:53:58,512 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:53:58,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:53:58,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:53:58,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:53:58,518 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:53:58,518 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:53:58,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:53:58,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:53:58,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:53:58,522 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 12:53:58,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:53:58,546 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:53:58,547 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:53:58,547 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:53:58,548 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:53:58,549 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:53:58,549 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:53:58,549 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:53:58,549 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:53:58,550 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:53:58,551 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:53:58,551 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:53:58,551 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:53:58,552 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:53:58,552 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:53:58,552 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:53:58,552 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:53:58,553 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:53:58,553 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:53:58,553 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:53:58,553 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:53:58,553 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:53:58,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:58,554 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:53:58,554 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:53:58,554 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:53:58,554 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:53:58,554 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:53:58,555 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:53:58,556 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:53:58,556 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:53:58,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:53:58,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:53:58,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:53:58,637 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:53:58,638 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:53:58,639 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2018-10-04 12:53:58,639 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2018-10-04 12:53:58,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:53:58,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:53:58,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:58,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:53:58,703 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:53:58,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... [2018-10-04 12:53:58,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... [2018-10-04 12:53:58,750 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:53:58,750 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:53:58,751 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:53:58,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:53:58,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:53:58,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:53:58,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:53:58,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... [2018-10-04 12:53:58,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... [2018-10-04 12:53:58,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... [2018-10-04 12:53:58,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... [2018-10-04 12:53:58,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... [2018-10-04 12:53:58,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... [2018-10-04 12:53:58,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... [2018-10-04 12:53:58,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:53:58,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:53:58,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:53:58,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:53:58,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:53:58,875 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:53:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:53:58,876 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:53:59,115 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:53:59,116 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:59 BoogieIcfgContainer [2018-10-04 12:53:59,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:53:59,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:53:59,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:53:59,122 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:53:59,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:53:58" (1/2) ... [2018-10-04 12:53:59,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38549f8 and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:53:59, skipping insertion in model container [2018-10-04 12:53:59,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:53:59" (2/2) ... [2018-10-04 12:53:59,127 INFO L112 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2018-10-04 12:53:59,138 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:53:59,149 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:53:59,204 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:53:59,205 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:53:59,205 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:53:59,205 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:53:59,205 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:53:59,206 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:53:59,206 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:53:59,206 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:53:59,206 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:53:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 12:53:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:53:59,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:59,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:53:59,232 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:59,239 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-10-04 12:53:59,242 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:59,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:59,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:59,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:59,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:59,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:53:59,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-04 12:53:59,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:53:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:53:59,482 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:59,485 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 12:53:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:59,551 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-10-04 12:53:59,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:53:59,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:53:59,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:59,565 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:53:59,565 INFO L226 Difference]: Without dead ends: 5 [2018-10-04 12:53:59,568 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 12:53:59,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-04 12:53:59,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-04 12:53:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-04 12:53:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-04 12:53:59,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-04 12:53:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:59,604 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-04 12:53:59,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:53:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-04 12:53:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:53:59,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:59,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:53:59,606 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:59,606 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:59,606 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-10-04 12:53:59,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:59,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:59,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:59,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:53:59,803 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:53:59,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:53:59,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:53:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:53:59,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:53:59,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:53:59,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:53:59,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:53:59,926 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:53:59,926 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-10-04 12:53:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:53:59,984 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-04 12:53:59,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:53:59,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-10-04 12:53:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:53:59,985 INFO L225 Difference]: With dead ends: 8 [2018-10-04 12:53:59,985 INFO L226 Difference]: Without dead ends: 6 [2018-10-04 12:53:59,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 2 [2018-10-04 12:53:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-04 12:53:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-04 12:53:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:53:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-04 12:53:59,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-04 12:53:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:53:59,989 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-04 12:53:59,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:53:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-04 12:53:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:53:59,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:53:59,990 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-10-04 12:53:59,990 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:53:59,991 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:53:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-10-04 12:53:59,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:53:59,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:53:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:53:59,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:53:59,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:00,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:00,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:00,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:00,147 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:00,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:00,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:00,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:00,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:54:00,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:54:00,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:54:00,226 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:00,226 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-10-04 12:54:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:00,273 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-04 12:54:00,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:54:00,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 12:54:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:00,275 INFO L225 Difference]: With dead ends: 9 [2018-10-04 12:54:00,276 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:54:00,276 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 12:54:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:54:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 12:54:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 12:54:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-04 12:54:00,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-04 12:54:00,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:00,280 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-04 12:54:00,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:54:00,280 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-04 12:54:00,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:54:00,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:00,281 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-10-04 12:54:00,281 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:00,282 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:00,282 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-10-04 12:54:00,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:00,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:00,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:00,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:00,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:00,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:00,448 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:00,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:00,507 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:54:00,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:00,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:00,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:00,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:54:00,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:54:00,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:54:00,578 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:00,579 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-10-04 12:54:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:00,786 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-04 12:54:00,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:54:00,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-10-04 12:54:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:00,788 INFO L225 Difference]: With dead ends: 10 [2018-10-04 12:54:00,788 INFO L226 Difference]: Without dead ends: 8 [2018-10-04 12:54:00,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 4 [2018-10-04 12:54:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-04 12:54:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-04 12:54:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:54:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-04 12:54:00,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-04 12:54:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:00,793 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-04 12:54:00,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:54:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-04 12:54:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:54:00,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:00,794 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-10-04 12:54:00,795 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:00,795 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-10-04 12:54:00,795 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:00,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:00,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:00,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:01,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:01,054 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:01,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:01,078 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:01,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:01,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:01,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:01,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:54:01,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:54:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:54:01,146 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:01,147 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-10-04 12:54:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:01,249 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-04 12:54:01,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:54:01,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-10-04 12:54:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:01,250 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:54:01,251 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:54:01,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 5 [2018-10-04 12:54:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:54:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:54:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:54:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-04 12:54:01,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-04 12:54:01,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:01,255 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-04 12:54:01,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:54:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-04 12:54:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 12:54:01,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:01,256 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-10-04 12:54:01,256 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:01,256 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:01,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-10-04 12:54:01,256 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:01,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:01,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:01,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:01,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:01,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:01,565 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:01,574 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:54:01,592 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:54:01,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:01,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:01,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:01,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:54:01,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:54:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:54:01,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:01,650 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-10-04 12:54:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:01,722 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-04 12:54:01,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:54:01,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-10-04 12:54:01,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:01,723 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:54:01,723 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:54:01,725 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 12:54:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:54:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-04 12:54:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:54:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-04 12:54:01,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-04 12:54:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:01,729 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-04 12:54:01,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:54:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-04 12:54:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:54:01,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:01,730 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-10-04 12:54:01,730 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:01,731 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:01,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-10-04 12:54:01,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:01,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:01,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:02,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:02,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:02,119 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:54:02,187 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:54:02,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:02,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:02,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:02,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:54:02,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:54:02,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:54:02,477 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:02,477 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-10-04 12:54:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:02,579 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-04 12:54:02,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:54:02,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-10-04 12:54:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:02,580 INFO L225 Difference]: With dead ends: 13 [2018-10-04 12:54:02,580 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:54:02,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 7 [2018-10-04 12:54:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:54:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-04 12:54:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-04 12:54:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-04 12:54:02,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-04 12:54:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:02,584 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-04 12:54:02,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:54:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-04 12:54:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 12:54:02,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:02,585 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-10-04 12:54:02,586 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:02,586 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-10-04 12:54:02,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:02,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:02,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:02,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:02,786 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:02,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:02,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:02,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:02,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:54:02,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:54:02,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:54:02,876 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:02,876 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-10-04 12:54:03,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:03,019 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-04 12:54:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:54:03,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-10-04 12:54:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:03,020 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:54:03,020 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:54:03,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 8 [2018-10-04 12:54:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:54:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 12:54:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:54:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:54:03,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-04 12:54:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:03,024 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:54:03,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:54:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:54:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:54:03,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:03,025 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-10-04 12:54:03,025 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:03,026 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:03,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-10-04 12:54:03,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:03,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:03,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:03,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:03,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:03,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:03,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 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 12:54:03,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:03,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:03,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:03,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 12:54:04,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:04,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 18 [2018-10-04 12:54:04,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 12:54:04,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 12:54:04,305 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:04,305 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 19 states. [2018-10-04 12:54:04,526 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 13 [2018-10-04 12:54:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:05,368 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-10-04 12:54:05,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:54:05,368 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2018-10-04 12:54:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:05,370 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:54:05,370 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:54:05,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.4s impTime 24 [2018-10-04 12:54:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:54:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-10-04 12:54:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-04 12:54:05,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2018-10-04 12:54:05,377 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2018-10-04 12:54:05,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:05,377 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2018-10-04 12:54:05,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 12:54:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2018-10-04 12:54:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 12:54:05,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:05,378 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-10-04 12:54:05,378 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:05,378 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:05,379 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-10-04 12:54:05,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:05,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:05,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:05,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:05,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:05,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:05,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:05,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:05,683 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:54:05,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:05,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:05,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:05,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 12:54:05,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:54:05,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:54:05,752 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:05,752 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 12 states. [2018-10-04 12:54:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:05,909 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2018-10-04 12:54:05,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:54:05,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-10-04 12:54:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:05,913 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:54:05,914 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:54:05,914 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 12:54:05,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:54:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-04 12:54:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-04 12:54:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-10-04 12:54:05,921 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2018-10-04 12:54:05,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:05,922 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-10-04 12:54:05,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:54:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2018-10-04 12:54:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:54:05,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:05,923 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-10-04 12:54:05,923 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:05,923 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:05,923 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-10-04 12:54:05,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:05,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:05,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:06,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:06,214 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:06,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:06,251 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:06,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:06,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:06,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:06,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-04 12:54:06,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:54:06,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:54:06,380 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:06,380 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 13 states. [2018-10-04 12:54:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:06,615 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-10-04 12:54:06,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:54:06,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-10-04 12:54:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:06,616 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:54:06,616 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:54:06,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 11 [2018-10-04 12:54:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:54:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 12:54:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:54:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-10-04 12:54:06,622 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2018-10-04 12:54:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:06,622 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-10-04 12:54:06,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:54:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2018-10-04 12:54:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 12:54:06,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:06,623 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-10-04 12:54:06,624 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:06,624 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:06,624 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-10-04 12:54:06,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:06,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:06,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:06,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:06,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:07,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:07,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:07,319 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:54:07,342 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:54:07,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:07,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:07,402 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:07,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:07,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 12:54:07,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:54:07,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:54:07,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:07,424 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 14 states. [2018-10-04 12:54:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:07,680 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-10-04 12:54:07,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:54:07,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-10-04 12:54:07,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:07,682 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:54:07,682 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:54:07,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 12 [2018-10-04 12:54:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:54:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-04 12:54:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-04 12:54:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-10-04 12:54:07,688 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2018-10-04 12:54:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:07,688 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2018-10-04 12:54:07,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:54:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2018-10-04 12:54:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:54:07,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:07,689 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-10-04 12:54:07,689 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:07,689 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-10-04 12:54:07,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:07,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:07,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:07,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:07,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:08,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:08,312 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:08,320 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:54:08,332 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:54:08,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:08,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:08,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:08,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 12:54:08,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:54:08,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:54:08,432 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:08,432 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 15 states. [2018-10-04 12:54:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:08,719 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-10-04 12:54:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:54:08,721 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-10-04 12:54:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:08,721 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:54:08,722 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:54:08,722 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 12:54:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:54:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-04 12:54:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:54:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2018-10-04 12:54:08,727 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2018-10-04 12:54:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:08,727 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2018-10-04 12:54:08,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:54:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-10-04 12:54:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:54:08,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:08,728 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-10-04 12:54:08,729 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:08,729 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:08,729 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-10-04 12:54:08,729 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:08,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:08,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:08,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:08,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:09,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:09,118 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:09,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:09,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:09,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:09,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-04 12:54:09,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:54:09,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:54:09,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:09,364 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 16 states. [2018-10-04 12:54:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:09,625 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2018-10-04 12:54:09,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:54:09,628 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-10-04 12:54:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:09,628 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:54:09,628 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:54:09,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 14 [2018-10-04 12:54:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:54:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-04 12:54:09,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-04 12:54:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2018-10-04 12:54:09,635 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2018-10-04 12:54:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:09,636 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2018-10-04 12:54:09,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:54:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-10-04 12:54:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:54:09,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:09,637 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-10-04 12:54:09,637 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:09,637 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:09,637 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-10-04 12:54:09,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:09,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:09,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:09,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:54:09,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:10,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:10,009 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:10,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:54:10,032 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:54:10,032 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:10,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:10,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:10,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 12:54:10,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:54:10,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:54:10,114 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:10,114 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand 17 states. [2018-10-04 12:54:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:10,427 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-10-04 12:54:10,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:54:10,428 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-10-04 12:54:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:10,429 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:54:10,429 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:54:10,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 15 [2018-10-04 12:54:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:54:10,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-04 12:54:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:54:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-10-04 12:54:10,434 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2018-10-04 12:54:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:10,435 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-10-04 12:54:10,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:54:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-10-04 12:54:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 12:54:10,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:10,436 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-10-04 12:54:10,436 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:10,436 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-10-04 12:54:10,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:10,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:10,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:10,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:10,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:11,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:11,248 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:11,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:54:11,277 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:54:11,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:11,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:11,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:11,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 12:54:11,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:54:11,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:54:11,373 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:11,373 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 18 states. [2018-10-04 12:54:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:11,847 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-10-04 12:54:11,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:54:11,848 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-10-04 12:54:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:11,849 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:54:11,849 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:54:11,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 16 [2018-10-04 12:54:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:54:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-04 12:54:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:54:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-10-04 12:54:11,854 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2018-10-04 12:54:11,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:11,854 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-10-04 12:54:11,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:54:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2018-10-04 12:54:11,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 12:54:11,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:11,855 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-10-04 12:54:11,855 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:11,855 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 16 times [2018-10-04 12:54:11,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:11,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:11,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:13,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:54:13,213 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:54:13,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:54:13,234 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:54:13,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:54:13,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:54:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:54:13,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:54:13,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 12:54:13,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:54:13,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:54:13,395 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:54:13,395 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 20 states. [2018-10-04 12:54:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:54:15,958 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2018-10-04 12:54:15,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:54:15,959 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-10-04 12:54:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:54:15,959 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:54:15,959 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:54:15,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 18 [2018-10-04 12:54:15,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:54:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:54:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:54:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-10-04 12:54:15,965 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 20 [2018-10-04 12:54:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:54:15,965 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-10-04 12:54:15,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:54:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-10-04 12:54:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:54:15,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:54:15,966 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-10-04 12:54:15,967 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:54:15,967 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:54:15,967 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 17 times [2018-10-04 12:54:15,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:54:15,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:54:15,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:15,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:54:15,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:54:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:54:18,921 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 12:54:18,925 INFO L168 Benchmark]: Toolchain (without parser) took 20226.00 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 65.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 371.3 MB). Peak memory consumption was 436.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:54:18,928 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:54:18,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:54:18,932 INFO L168 Benchmark]: Boogie Preprocessor took 30.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:54:18,932 INFO L168 Benchmark]: RCFGBuilder took 331.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:54:18,933 INFO L168 Benchmark]: TraceAbstraction took 19806.72 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 65.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 350.2 MB). Peak memory consumption was 415.7 MB. Max. memory is 7.1 GB. [2018-10-04 12:54:18,939 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.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 331.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19806.72 ms. Allocated memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 65.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 350.2 MB). Peak memory consumption was 415.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Cannot handle case were solver cannot decide implication of predicates: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.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_12-54-18-956.csv Received shutdown request...