java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:51:54,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:51:54,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:51:54,542 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:51:54,542 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:51:54,543 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:51:54,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:51:54,549 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:51:54,550 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:51:54,552 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:51:54,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:51:54,553 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:51:54,554 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:51:54,557 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:51:54,558 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:51:54,558 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:51:54,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:51:54,569 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:51:54,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:51:54,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:51:54,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:51:54,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:51:54,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:51:54,578 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:51:54,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:51:54,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:51:54,580 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:51:54,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:51:54,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:51:54,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:51:54,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:51:54,585 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:51:54,585 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:51:54,585 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:51:54,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:51:54,589 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:51:54,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:51:54,609 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:51:54,612 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:51:54,612 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:51:54,613 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:51:54,613 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:51:54,614 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:51:54,614 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:51:54,614 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:51:54,614 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:51:54,614 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:51:54,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:51:54,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:51:54,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:51:54,615 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:51:54,615 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:51:54,615 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:51:54,616 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:51:54,618 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:51:54,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:51:54,619 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:51:54,620 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:51:54,620 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:51:54,668 INFO ]: Repository-Root is: /tmp [2018-06-25 09:51:54,687 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:51:54,693 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:51:54,694 INFO ]: Initializing SmtParser... [2018-06-25 09:51:54,694 INFO ]: SmtParser initialized [2018-06-25 09:51:54,695 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 [2018-06-25 09:51:54,697 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:51:54,791 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@36086dbc [2018-06-25 09:51:54,934 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__barthe2.smt2 [2018-06-25 09:51:54,939 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:51:54,947 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:51:54,948 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:51:54,948 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:51:54,948 INFO ]: ChcToBoogie initialized [2018-06-25 09:51:54,951 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:51:54" (1/1) ... [2018-06-25 09:51:55,005 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55 Unit [2018-06-25 09:51:55,006 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:51:55,007 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:51:55,007 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:51:55,007 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:51:55,028 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55" (1/1) ... [2018-06-25 09:51:55,028 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55" (1/1) ... [2018-06-25 09:51:55,038 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55" (1/1) ... [2018-06-25 09:51:55,038 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55" (1/1) ... [2018-06-25 09:51:55,041 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55" (1/1) ... [2018-06-25 09:51:55,043 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55" (1/1) ... [2018-06-25 09:51:55,044 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55" (1/1) ... [2018-06-25 09:51:55,046 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:51:55,046 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:51:55,046 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:51:55,046 INFO ]: RCFGBuilder initialized [2018-06-25 09:51:55,047 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:51:55,065 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:51:55,065 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:51:55,065 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:51:55,065 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:51:55,065 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:51:55,065 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:51:55,322 INFO ]: Using library mode [2018-06-25 09:51:55,322 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:51:55 BoogieIcfgContainer [2018-06-25 09:51:55,322 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:51:55,323 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:51:55,323 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:51:55,327 INFO ]: TraceAbstraction initialized [2018-06-25 09:51:55,328 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:51:54" (1/3) ... [2018-06-25 09:51:55,328 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44305b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:51:55, skipping insertion in model container [2018-06-25 09:51:55,329 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:51:55" (2/3) ... [2018-06-25 09:51:55,329 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44305b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:51:55, skipping insertion in model container [2018-06-25 09:51:55,329 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:51:55" (3/3) ... [2018-06-25 09:51:55,331 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:51:55,341 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:51:55,350 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:51:55,387 INFO ]: Using default assertion order modulation [2018-06-25 09:51:55,388 INFO ]: Interprodecural is true [2018-06-25 09:51:55,388 INFO ]: Hoare is false [2018-06-25 09:51:55,388 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:51:55,388 INFO ]: Backedges is TWOTRACK [2018-06-25 09:51:55,388 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:51:55,388 INFO ]: Difference is false [2018-06-25 09:51:55,388 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:51:55,388 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:51:55,399 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:51:55,410 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:51:55,410 INFO ]: Found error trace [2018-06-25 09:51:55,411 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:55,411 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:55,415 INFO ]: Analyzing trace with hash -204604396, now seen corresponding path program 1 times [2018-06-25 09:51:55,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:55,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:55,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:55,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:55,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:55,504 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:55,562 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:55,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:51:55,563 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:51:55,564 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:51:55,575 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:51:55,575 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:55,577 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:51:55,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:55,689 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-25 09:51:55,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:51:55,691 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:51:55,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:55,700 INFO ]: With dead ends: 9 [2018-06-25 09:51:55,700 INFO ]: Without dead ends: 9 [2018-06-25 09:51:55,702 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:55,735 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:51:55,758 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:51:55,759 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:51:55,760 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:51:55,761 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-25 09:51:55,761 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:55,761 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:51:55,761 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:51:55,761 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:51:55,761 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:51:55,762 INFO ]: Found error trace [2018-06-25 09:51:55,762 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:55,762 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:55,762 INFO ]: Analyzing trace with hash -2057039604, now seen corresponding path program 1 times [2018-06-25 09:51:55,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:55,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:55,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:55,763 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:55,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:55,795 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:56,012 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:56,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:56,012 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:51:56,019 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:56,043 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:56,054 INFO ]: Computing forward predicates... [2018-06-25 09:51:56,246 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:56,280 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:56,280 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 09:51:56,280 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:51:56,280 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:51:56,280 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:51:56,281 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2018-06-25 09:51:56,572 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:56,572 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-25 09:51:56,573 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:51:56,573 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 09:51:56,573 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:56,573 INFO ]: With dead ends: 11 [2018-06-25 09:51:56,573 INFO ]: Without dead ends: 11 [2018-06-25 09:51:56,574 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:51:56,574 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:51:56,575 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-25 09:51:56,575 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:51:56,575 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:51:56,575 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 8 [2018-06-25 09:51:56,575 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:56,575 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:51:56,575 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:51:56,575 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:51:56,575 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:51:56,575 INFO ]: Found error trace [2018-06-25 09:51:56,576 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:56,576 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:56,576 INFO ]: Analyzing trace with hash -2053345520, now seen corresponding path program 1 times [2018-06-25 09:51:56,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:56,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:56,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:56,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:56,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:56,592 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:56,628 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:56,628 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:51:56,628 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:51:56,628 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:51:56,629 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:51:56,629 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:56,629 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-25 09:51:56,651 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:56,651 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-25 09:51:56,651 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:51:56,651 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:51:56,652 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:56,652 INFO ]: With dead ends: 10 [2018-06-25 09:51:56,652 INFO ]: Without dead ends: 9 [2018-06-25 09:51:56,652 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:51:56,652 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:51:56,653 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:51:56,654 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:51:56,654 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-25 09:51:56,654 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-25 09:51:56,654 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:56,654 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-25 09:51:56,654 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:51:56,654 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-25 09:51:56,654 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:51:56,654 INFO ]: Found error trace [2018-06-25 09:51:56,654 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:56,655 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:56,655 INFO ]: Analyzing trace with hash -2049651436, now seen corresponding path program 1 times [2018-06-25 09:51:56,655 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:56,655 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:56,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:56,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:56,656 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:56,680 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:56,837 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:56,838 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:56,838 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:51:56,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:56,876 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:56,878 INFO ]: Computing forward predicates... [2018-06-25 09:51:57,001 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:57,022 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:57,022 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:51:57,022 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:51:57,022 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:51:57,023 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:51:57,023 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-25 09:51:57,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:57,055 INFO ]: Finished difference Result 12 states and 16 transitions. [2018-06-25 09:51:57,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:51:57,056 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:51:57,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:57,056 INFO ]: With dead ends: 12 [2018-06-25 09:51:57,056 INFO ]: Without dead ends: 12 [2018-06-25 09:51:57,057 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:51:57,057 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:51:57,058 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:51:57,058 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:51:57,059 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-06-25 09:51:57,059 INFO ]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 8 [2018-06-25 09:51:57,059 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:57,059 INFO ]: Abstraction has 12 states and 16 transitions. [2018-06-25 09:51:57,059 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:51:57,059 INFO ]: Start isEmpty. Operand 12 states and 16 transitions. [2018-06-25 09:51:57,059 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:51:57,059 INFO ]: Found error trace [2018-06-25 09:51:57,059 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:57,060 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:57,060 INFO ]: Analyzing trace with hash 654399260, now seen corresponding path program 1 times [2018-06-25 09:51:57,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:57,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:57,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:57,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:57,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:57,079 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:57,240 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:57,240 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:57,240 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:51:57,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:57,277 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:57,279 INFO ]: Computing forward predicates... [2018-06-25 09:51:57,403 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:57,430 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:57,430 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 09:51:57,430 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:51:57,430 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:51:57,430 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:51:57,430 INFO ]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2018-06-25 09:51:57,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:57,806 INFO ]: Finished difference Result 14 states and 20 transitions. [2018-06-25 09:51:57,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:51:57,806 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 09:51:57,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:57,807 INFO ]: With dead ends: 14 [2018-06-25 09:51:57,807 INFO ]: Without dead ends: 14 [2018-06-25 09:51:57,807 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:51:57,807 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:51:57,809 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-25 09:51:57,809 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:51:57,809 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2018-06-25 09:51:57,809 INFO ]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 9 [2018-06-25 09:51:57,809 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:57,809 INFO ]: Abstraction has 13 states and 18 transitions. [2018-06-25 09:51:57,809 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:51:57,809 INFO ]: Start isEmpty. Operand 13 states and 18 transitions. [2018-06-25 09:51:57,809 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:51:57,809 INFO ]: Found error trace [2018-06-25 09:51:57,810 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:57,810 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:57,810 INFO ]: Analyzing trace with hash -1419375084, now seen corresponding path program 2 times [2018-06-25 09:51:57,810 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:57,810 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:57,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:57,810 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:51:57,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:57,827 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:57,939 INFO ]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:57,939 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:57,939 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:51:57,950 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:57,977 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:57,977 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:57,979 INFO ]: Computing forward predicates... [2018-06-25 09:51:58,233 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:58,254 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:58,254 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-06-25 09:51:58,254 INFO ]: Interpolant automaton has 9 states [2018-06-25 09:51:58,254 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 09:51:58,254 INFO ]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 09:51:58,255 INFO ]: Start difference. First operand 13 states and 18 transitions. Second operand 9 states. [2018-06-25 09:51:58,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:58,342 INFO ]: Finished difference Result 24 states and 40 transitions. [2018-06-25 09:51:58,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:51:58,342 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-25 09:51:58,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:58,344 INFO ]: With dead ends: 24 [2018-06-25 09:51:58,344 INFO ]: Without dead ends: 17 [2018-06-25 09:51:58,344 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:51:58,344 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:51:58,345 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-25 09:51:58,345 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:51:58,346 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-25 09:51:58,347 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 10 [2018-06-25 09:51:58,347 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:58,347 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-25 09:51:58,347 INFO ]: Interpolant automaton has 9 states. [2018-06-25 09:51:58,347 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-25 09:51:58,347 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:51:58,347 INFO ]: Found error trace [2018-06-25 09:51:58,347 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:58,347 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:58,348 INFO ]: Analyzing trace with hash -1190341876, now seen corresponding path program 3 times [2018-06-25 09:51:58,348 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:58,348 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:58,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:58,348 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:58,348 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:58,365 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:58,703 WARN ]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-25 09:51:58,704 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:58,704 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:58,704 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:51:58,713 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:51:58,728 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:51:58,728 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:58,731 INFO ]: Computing forward predicates... [2018-06-25 09:51:58,870 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:58,896 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:58,896 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-25 09:51:58,896 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:51:58,896 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:51:58,897 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:51:58,897 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 10 states. [2018-06-25 09:51:59,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:59,202 INFO ]: Finished difference Result 15 states and 19 transitions. [2018-06-25 09:51:59,202 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:51:59,202 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-25 09:51:59,202 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:59,202 INFO ]: With dead ends: 15 [2018-06-25 09:51:59,202 INFO ]: Without dead ends: 15 [2018-06-25 09:51:59,203 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:51:59,203 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:51:59,204 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:51:59,204 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:51:59,205 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-25 09:51:59,205 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2018-06-25 09:51:59,205 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:59,205 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-25 09:51:59,205 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:51:59,205 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-25 09:51:59,205 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:51:59,205 INFO ]: Found error trace [2018-06-25 09:51:59,205 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:59,205 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:59,206 INFO ]: Analyzing trace with hash 1607332108, now seen corresponding path program 4 times [2018-06-25 09:51:59,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:59,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:59,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:59,206 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:59,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:59,217 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:59,265 INFO ]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:59,265 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:51:59,265 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:51:59,266 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:51:59,266 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:51:59,266 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:51:59,266 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 4 states. [2018-06-25 09:51:59,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:59,272 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-25 09:51:59,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:51:59,273 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-25 09:51:59,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:59,273 INFO ]: With dead ends: 15 [2018-06-25 09:51:59,273 INFO ]: Without dead ends: 15 [2018-06-25 09:51:59,273 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:51:59,273 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:51:59,275 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-06-25 09:51:59,275 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:51:59,275 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-25 09:51:59,275 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-25 09:51:59,275 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:59,275 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-25 09:51:59,275 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:51:59,275 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-25 09:51:59,276 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:51:59,276 INFO ]: Found error trace [2018-06-25 09:51:59,276 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:59,276 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:59,276 INFO ]: Analyzing trace with hash 1614720276, now seen corresponding path program 2 times [2018-06-25 09:51:59,276 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:59,276 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:59,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:59,277 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:59,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:59,288 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:59,346 INFO ]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:51:59,347 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:59,347 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:51:59,352 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:51:59,366 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:51:59,366 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:59,367 INFO ]: Computing forward predicates... [2018-06-25 09:51:59,402 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:59,421 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:59,421 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-06-25 09:51:59,421 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:51:59,422 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:51:59,422 INFO ]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:51:59,422 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2018-06-25 09:51:59,455 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:59,455 INFO ]: Finished difference Result 16 states and 17 transitions. [2018-06-25 09:51:59,456 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:51:59,456 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-25 09:51:59,456 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:59,456 INFO ]: With dead ends: 16 [2018-06-25 09:51:59,456 INFO ]: Without dead ends: 12 [2018-06-25 09:51:59,456 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:51:59,456 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:51:59,457 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:51:59,457 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:51:59,458 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-25 09:51:59,458 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-25 09:51:59,458 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:59,458 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-25 09:51:59,458 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:51:59,458 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-25 09:51:59,458 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:51:59,458 INFO ]: Found error trace [2018-06-25 09:51:59,460 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:59,460 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:59,460 INFO ]: Analyzing trace with hash 1752225052, now seen corresponding path program 5 times [2018-06-25 09:51:59,460 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:59,460 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:59,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:59,461 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:59,461 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:59,476 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:59,601 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:59,601 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:51:59,601 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:51:59,611 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:51:59,628 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:51:59,628 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:51:59,630 INFO ]: Computing forward predicates... [2018-06-25 09:51:59,658 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:51:59,686 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:51:59,686 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-25 09:51:59,686 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:51:59,686 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:51:59,686 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:51:59,686 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-06-25 09:51:59,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:51:59,715 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-25 09:51:59,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:51:59,716 INFO ]: Start accepts. Automaton has 8 states. Word has length 11 [2018-06-25 09:51:59,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:51:59,716 INFO ]: With dead ends: 13 [2018-06-25 09:51:59,716 INFO ]: Without dead ends: 13 [2018-06-25 09:51:59,716 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:51:59,716 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:51:59,717 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:51:59,717 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:51:59,717 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-25 09:51:59,718 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-25 09:51:59,718 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:51:59,718 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-25 09:51:59,718 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:51:59,718 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-25 09:51:59,718 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:51:59,718 INFO ]: Found error trace [2018-06-25 09:51:59,718 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:51:59,718 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:51:59,718 INFO ]: Analyzing trace with hash -1517480692, now seen corresponding path program 6 times [2018-06-25 09:51:59,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:51:59,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:51:59,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:59,719 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:51:59,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:51:59,737 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:00,108 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:00,109 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:00,109 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:00,116 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:52:00,156 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:52:00,156 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:00,159 INFO ]: Computing forward predicates... [2018-06-25 09:52:07,400 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:07,420 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:07,420 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-25 09:52:07,420 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:52:07,421 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:52:07,421 INFO ]: CoverageRelationStatistics Valid=29, Invalid=148, Unknown=5, NotChecked=0, Total=182 [2018-06-25 09:52:07,421 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 14 states. [2018-06-25 09:52:09,530 WARN ]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-25 09:52:10,150 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:10,150 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-25 09:52:10,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:52:10,151 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-25 09:52:10,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:10,151 INFO ]: With dead ends: 14 [2018-06-25 09:52:10,151 INFO ]: Without dead ends: 14 [2018-06-25 09:52:10,151 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=37, Invalid=198, Unknown=5, NotChecked=0, Total=240 [2018-06-25 09:52:10,151 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:52:10,153 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:52:10,153 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:52:10,154 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-25 09:52:10,154 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-25 09:52:10,154 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:10,154 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-25 09:52:10,154 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:52:10,154 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-25 09:52:10,154 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:52:10,154 INFO ]: Found error trace [2018-06-25 09:52:10,154 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:10,154 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:10,154 INFO ]: Analyzing trace with hash 200856348, now seen corresponding path program 7 times [2018-06-25 09:52:10,155 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:10,155 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:10,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:10,155 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:10,155 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:10,175 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:10,723 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:10,723 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:10,723 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:10,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:10,747 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:10,750 INFO ]: Computing forward predicates... [2018-06-25 09:52:10,793 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:10,822 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:10,822 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-25 09:52:10,822 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:52:10,822 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:52:10,823 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:52:10,823 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2018-06-25 09:52:10,960 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:10,960 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-25 09:52:10,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:52:10,961 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-25 09:52:10,961 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:10,961 INFO ]: With dead ends: 15 [2018-06-25 09:52:10,961 INFO ]: Without dead ends: 15 [2018-06-25 09:52:10,961 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:52:10,961 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:52:10,962 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:52:10,962 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:52:10,962 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-25 09:52:10,962 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-25 09:52:10,962 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:10,962 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-25 09:52:10,962 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:52:10,962 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-25 09:52:10,963 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:52:10,963 INFO ]: Found error trace [2018-06-25 09:52:10,963 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:10,963 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:10,963 INFO ]: Analyzing trace with hash 1929697036, now seen corresponding path program 8 times [2018-06-25 09:52:10,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:10,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:10,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:10,964 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:10,964 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:10,992 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:11,184 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:11,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:11,184 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:11,190 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:52:11,244 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:52:11,244 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:11,248 INFO ]: Computing forward predicates... [2018-06-25 09:52:11,545 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:11,565 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:11,565 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-25 09:52:11,565 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:52:11,566 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:52:11,566 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:52:11,566 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 18 states. [2018-06-25 09:52:11,724 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:11,724 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-25 09:52:11,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:52:11,726 INFO ]: Start accepts. Automaton has 18 states. Word has length 14 [2018-06-25 09:52:11,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:11,726 INFO ]: With dead ends: 16 [2018-06-25 09:52:11,726 INFO ]: Without dead ends: 16 [2018-06-25 09:52:11,727 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:52:11,727 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:52:11,728 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 09:52:11,728 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:52:11,728 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-25 09:52:11,728 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-25 09:52:11,728 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:11,728 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-25 09:52:11,728 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:52:11,728 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-25 09:52:11,729 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:52:11,729 INFO ]: Found error trace [2018-06-25 09:52:11,729 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:11,729 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:11,729 INFO ]: Analyzing trace with hash -310816484, now seen corresponding path program 9 times [2018-06-25 09:52:11,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:11,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:11,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:11,730 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:11,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:11,747 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:11,942 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:11,942 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:11,942 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:11,947 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:52:11,985 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 09:52:11,985 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:11,990 INFO ]: Computing forward predicates... [2018-06-25 09:52:12,476 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:12,502 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:12,502 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-25 09:52:12,502 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:52:12,502 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:52:12,502 INFO ]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:52:12,503 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 20 states. [2018-06-25 09:52:12,831 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:12,831 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-25 09:52:12,834 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:52:12,834 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-25 09:52:12,834 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:12,834 INFO ]: With dead ends: 17 [2018-06-25 09:52:12,834 INFO ]: Without dead ends: 17 [2018-06-25 09:52:12,835 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:52:12,835 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:52:12,836 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:52:12,836 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:52:12,837 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-25 09:52:12,837 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-25 09:52:12,837 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:12,837 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-25 09:52:12,837 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:52:12,837 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-25 09:52:12,837 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:52:12,837 INFO ]: Found error trace [2018-06-25 09:52:12,837 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:12,837 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:12,838 INFO ]: Analyzing trace with hash -1047258868, now seen corresponding path program 10 times [2018-06-25 09:52:12,838 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:12,838 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:12,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:12,841 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:12,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:12,891 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:13,237 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:13,237 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:13,237 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:13,244 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:52:13,273 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:52:13,273 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:13,277 INFO ]: Computing forward predicates... [2018-06-25 09:52:13,360 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:13,379 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:13,379 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-25 09:52:13,379 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:52:13,379 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:52:13,379 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:52:13,380 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 13 states. [2018-06-25 09:52:13,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:13,461 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-25 09:52:13,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:52:13,464 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-25 09:52:13,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:13,465 INFO ]: With dead ends: 18 [2018-06-25 09:52:13,465 INFO ]: Without dead ends: 18 [2018-06-25 09:52:13,465 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:52:13,465 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:52:13,466 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:52:13,466 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:52:13,467 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-25 09:52:13,467 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-25 09:52:13,467 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:13,467 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-25 09:52:13,467 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:52:13,467 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-25 09:52:13,469 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:52:13,469 INFO ]: Found error trace [2018-06-25 09:52:13,469 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:13,469 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:13,469 INFO ]: Analyzing trace with hash 1892831004, now seen corresponding path program 11 times [2018-06-25 09:52:13,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:13,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:13,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:13,470 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:13,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:13,494 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:14,070 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:14,070 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:14,070 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:14,076 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:52:14,106 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-25 09:52:14,106 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:14,110 INFO ]: Computing forward predicates... [2018-06-25 09:52:14,168 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:14,188 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:14,188 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-25 09:52:14,188 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:52:14,188 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:52:14,188 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:52:14,189 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 14 states. [2018-06-25 09:52:14,286 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:14,286 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-25 09:52:14,286 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:52:14,286 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-25 09:52:14,286 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:14,286 INFO ]: With dead ends: 19 [2018-06-25 09:52:14,286 INFO ]: Without dead ends: 19 [2018-06-25 09:52:14,287 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:52:14,287 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:52:14,288 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:52:14,288 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:52:14,288 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-25 09:52:14,288 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-25 09:52:14,288 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:14,288 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-25 09:52:14,288 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:52:14,289 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-25 09:52:14,289 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:52:14,289 INFO ]: Found error trace [2018-06-25 09:52:14,289 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:14,289 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:14,289 INFO ]: Analyzing trace with hash -1453663476, now seen corresponding path program 12 times [2018-06-25 09:52:14,289 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:14,289 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:14,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:14,290 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:14,290 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:14,314 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:14,600 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:14,600 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:14,600 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:14,610 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:52:14,645 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-25 09:52:14,645 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:14,650 INFO ]: Computing forward predicates... [2018-06-25 09:52:15,507 WARN ]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-25 09:52:30,409 WARN ]: unable to prove that (exists ((v_gotoProc_hbv_INV_MAIN_1_2_Int_76 Int) (v_gotoProc_hhv_INV_MAIN_1_2_Int_72 Int)) (let ((.cse2 (+ v_gotoProc_hbv_INV_MAIN_1_2_Int_76 8)) (.cse1 (+ v_gotoProc_hhv_INV_MAIN_1_2_Int_72 7)) (.cse0 (+ c_gotoProc_hhv_INV_MAIN_1_1_Int (* 2 c_gotoProc_hhv_INV_MAIN_1_0_Int) c_gotoProc_hhv_INV_MAIN_1_2_Int))) (and (not (= (* 9 v_gotoProc_hhv_INV_MAIN_1_2_Int_72) (+ c_gotoProc_hhv_INV_MAIN_1_5_Int (* 16 c_gotoProc_hhv_INV_MAIN_1_0_Int) c_gotoProc_hhv_INV_MAIN_1_3_Int (* 9 v_gotoProc_hbv_INV_MAIN_1_2_Int_76) (* 8 c_gotoProc_hhv_INV_MAIN_1_2_Int) 8))) (<= .cse0 .cse1) (<= c_gotoProc_hhv_INV_MAIN_1_4_Int .cse2) (<= .cse2 c_gotoProc_hhv_INV_MAIN_1_4_Int) (<= .cse1 .cse0)))) is different from true [2018-06-25 09:52:30,414 INFO ]: Checked inductivity of 66 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2018-06-25 09:52:30,446 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:30,446 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-25 09:52:30,446 INFO ]: Interpolant automaton has 26 states [2018-06-25 09:52:30,446 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-25 09:52:30,446 INFO ]: CoverageRelationStatistics Valid=58, Invalid=531, Unknown=15, NotChecked=46, Total=650 [2018-06-25 09:52:30,447 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 26 states. [2018-06-25 09:52:42,660 WARN ]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-06-25 09:52:43,832 WARN ]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 36 [2018-06-25 09:52:44,576 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:44,576 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-25 09:52:44,576 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:52:44,576 INFO ]: Start accepts. Automaton has 26 states. Word has length 18 [2018-06-25 09:52:44,576 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:44,576 INFO ]: With dead ends: 20 [2018-06-25 09:52:44,576 INFO ]: Without dead ends: 20 [2018-06-25 09:52:44,577 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=69, Invalid=675, Unknown=16, NotChecked=52, Total=812 [2018-06-25 09:52:44,577 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:52:44,578 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:52:44,578 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:52:44,579 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-25 09:52:44,579 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-25 09:52:44,579 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:44,579 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-25 09:52:44,579 INFO ]: Interpolant automaton has 26 states. [2018-06-25 09:52:44,579 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-25 09:52:44,579 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:52:44,579 INFO ]: Found error trace [2018-06-25 09:52:44,579 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:44,579 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:44,579 INFO ]: Analyzing trace with hash -2115777252, now seen corresponding path program 13 times [2018-06-25 09:52:44,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:44,580 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:44,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:44,581 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:44,581 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:44,605 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:45,126 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:45,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:45,126 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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-06-25 09:52:45,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:45,166 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:45,171 INFO ]: Computing forward predicates... [2018-06-25 09:52:45,486 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:45,506 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:45,506 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-25 09:52:45,506 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:52:45,507 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:52:45,507 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:52:45,507 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 16 states. [2018-06-25 09:52:45,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:45,640 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-25 09:52:45,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:52:45,640 INFO ]: Start accepts. Automaton has 16 states. Word has length 19 [2018-06-25 09:52:45,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:45,642 INFO ]: With dead ends: 21 [2018-06-25 09:52:45,642 INFO ]: Without dead ends: 21 [2018-06-25 09:52:45,642 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:52:45,642 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 09:52:45,644 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-25 09:52:45,644 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:52:45,644 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-25 09:52:45,644 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-25 09:52:45,644 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:45,644 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-25 09:52:45,644 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:52:45,644 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-25 09:52:45,645 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:52:45,645 INFO ]: Found error trace [2018-06-25 09:52:45,645 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:45,645 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:45,645 INFO ]: Analyzing trace with hash -1166467828, now seen corresponding path program 14 times [2018-06-25 09:52:45,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:45,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:45,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:52:45,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:45,676 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:46,057 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:46,057 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:46,057 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:52:46,069 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:52:46,108 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:52:46,108 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:46,115 INFO ]: Computing forward predicates... [2018-06-25 09:52:46,675 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:46,695 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:46,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-25 09:52:46,695 INFO ]: Interpolant automaton has 30 states [2018-06-25 09:52:46,695 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 09:52:46,695 INFO ]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2018-06-25 09:52:46,696 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 30 states. [2018-06-25 09:52:47,260 WARN ]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-06-25 09:52:47,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:47,288 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-25 09:52:47,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:52:47,288 INFO ]: Start accepts. Automaton has 30 states. Word has length 20 [2018-06-25 09:52:47,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:47,288 INFO ]: With dead ends: 22 [2018-06-25 09:52:47,288 INFO ]: Without dead ends: 22 [2018-06-25 09:52:47,288 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2018-06-25 09:52:47,289 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:52:47,290 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 09:52:47,290 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 09:52:47,290 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-25 09:52:47,290 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-25 09:52:47,290 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:47,290 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-25 09:52:47,290 INFO ]: Interpolant automaton has 30 states. [2018-06-25 09:52:47,290 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-25 09:52:47,291 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 09:52:47,291 INFO ]: Found error trace [2018-06-25 09:52:47,291 INFO ]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:47,291 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:47,291 INFO ]: Analyzing trace with hash -1802646756, now seen corresponding path program 15 times [2018-06-25 09:52:47,291 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:47,291 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:47,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:47,292 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:47,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:47,319 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:48,158 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:48,158 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:48,158 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:52:48,172 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:52:48,253 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-25 09:52:48,253 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:48,259 INFO ]: Computing forward predicates... [2018-06-25 09:52:49,203 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:49,223 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:49,223 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-06-25 09:52:49,223 INFO ]: Interpolant automaton has 32 states [2018-06-25 09:52:49,223 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-25 09:52:49,223 INFO ]: CoverageRelationStatistics Valid=69, Invalid=923, Unknown=0, NotChecked=0, Total=992 [2018-06-25 09:52:49,223 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 32 states. [2018-06-25 09:52:50,078 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:50,078 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-25 09:52:50,078 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 09:52:50,078 INFO ]: Start accepts. Automaton has 32 states. Word has length 21 [2018-06-25 09:52:50,078 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:50,078 INFO ]: With dead ends: 23 [2018-06-25 09:52:50,078 INFO ]: Without dead ends: 23 [2018-06-25 09:52:50,079 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=97, Invalid=1385, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 09:52:50,079 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:52:50,080 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:52:50,080 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:52:50,080 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-25 09:52:50,080 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-25 09:52:50,081 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:50,081 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-25 09:52:50,081 INFO ]: Interpolant automaton has 32 states. [2018-06-25 09:52:50,081 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-25 09:52:50,081 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 09:52:50,081 INFO ]: Found error trace [2018-06-25 09:52:50,081 INFO ]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:50,081 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:50,081 INFO ]: Analyzing trace with hash -49357044, now seen corresponding path program 16 times [2018-06-25 09:52:50,081 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:50,081 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:50,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:50,082 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:50,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:50,112 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:51,268 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:51,268 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:51,268 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:52:51,275 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:52:51,311 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:52:51,311 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:51,316 INFO ]: Computing forward predicates... [2018-06-25 09:52:51,360 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:51,379 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:51,379 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-25 09:52:51,380 INFO ]: Interpolant automaton has 19 states [2018-06-25 09:52:51,380 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 09:52:51,380 INFO ]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:52:51,380 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 19 states. [2018-06-25 09:52:51,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:51,565 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-25 09:52:51,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 09:52:51,567 INFO ]: Start accepts. Automaton has 19 states. Word has length 22 [2018-06-25 09:52:51,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:51,567 INFO ]: With dead ends: 24 [2018-06-25 09:52:51,567 INFO ]: Without dead ends: 24 [2018-06-25 09:52:51,567 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-06-25 09:52:51,568 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:52:51,569 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 09:52:51,569 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:52:51,569 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-25 09:52:51,569 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-25 09:52:51,569 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:51,569 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-25 09:52:51,569 INFO ]: Interpolant automaton has 19 states. [2018-06-25 09:52:51,569 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-25 09:52:51,570 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 09:52:51,570 INFO ]: Found error trace [2018-06-25 09:52:51,570 INFO ]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:51,570 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:51,570 INFO ]: Analyzing trace with hash -1531950820, now seen corresponding path program 17 times [2018-06-25 09:52:51,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:51,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:51,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:51,574 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:51,574 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:51,605 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:51,961 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:51,961 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:51,961 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:52:51,967 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:52:52,016 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-25 09:52:52,016 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:52,022 INFO ]: Computing forward predicates... [2018-06-25 09:52:52,080 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:52,100 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:52:52,100 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-25 09:52:52,100 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:52:52,100 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:52:52,100 INFO ]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:52:52,101 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 20 states. [2018-06-25 09:52:52,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:52:52,294 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-25 09:52:52,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:52:52,296 INFO ]: Start accepts. Automaton has 20 states. Word has length 23 [2018-06-25 09:52:52,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:52:52,296 INFO ]: With dead ends: 25 [2018-06-25 09:52:52,296 INFO ]: Without dead ends: 25 [2018-06-25 09:52:52,296 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:52:52,296 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 09:52:52,298 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 09:52:52,298 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 09:52:52,298 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-25 09:52:52,298 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-25 09:52:52,298 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:52:52,298 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-25 09:52:52,298 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:52:52,298 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-25 09:52:52,299 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 09:52:52,299 INFO ]: Found error trace [2018-06-25 09:52:52,299 INFO ]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:52:52,299 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:52:52,299 INFO ]: Analyzing trace with hash -247717620, now seen corresponding path program 18 times [2018-06-25 09:52:52,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:52:52,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:52:52,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:52,300 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:52:52,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:52:52,334 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:52,896 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:52:52,896 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:52:52,896 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:52:52,903 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:52:52,957 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-25 09:52:52,957 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:52:52,964 INFO ]: Computing forward predicates... [2018-06-25 09:52:55,595 WARN ]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 Received shutdown request... [2018-06-25 09:53:07,955 INFO ]: Timeout while computing interpolants [2018-06-25 09:53:08,155 WARN ]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:53:08,155 WARN ]: Verification canceled [2018-06-25 09:53:08,159 WARN ]: Timeout [2018-06-25 09:53:08,159 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:53:08 BoogieIcfgContainer [2018-06-25 09:53:08,159 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:53:08,160 INFO ]: Toolchain (without parser) took 73220.48 ms. Allocated memory was 304.6 MB in the beginning and 451.4 MB in the end (delta: 146.8 MB). Free memory was 261.0 MB in the beginning and 346.5 MB in the end (delta: -85.5 MB). Peak memory consumption was 61.3 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:08,160 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:53:08,160 INFO ]: ChcToBoogie took 58.62 ms. Allocated memory is still 304.6 MB. Free memory was 261.0 MB in the beginning and 259.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:08,161 INFO ]: Boogie Preprocessor took 39.27 ms. Allocated memory is still 304.6 MB. Free memory was 259.0 MB in the beginning and 257.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:08,161 INFO ]: RCFGBuilder took 276.13 ms. Allocated memory is still 304.6 MB. Free memory was 257.0 MB in the beginning and 249.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:08,162 INFO ]: TraceAbstraction took 72835.77 ms. Allocated memory was 304.6 MB in the beginning and 451.4 MB in the end (delta: 146.8 MB). Free memory was 249.0 MB in the beginning and 346.5 MB in the end (delta: -97.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. [2018-06-25 09:53:08,164 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 304.6 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.62 ms. Allocated memory is still 304.6 MB. Free memory was 261.0 MB in the beginning and 259.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.27 ms. Allocated memory is still 304.6 MB. Free memory was 259.0 MB in the beginning and 257.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 276.13 ms. Allocated memory is still 304.6 MB. Free memory was 257.0 MB in the beginning and 249.0 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 72835.77 ms. Allocated memory was 304.6 MB in the beginning and 451.4 MB in the end (delta: 146.8 MB). Free memory was 249.0 MB in the beginning and 346.5 MB in the end (delta: -97.5 MB). Peak memory consumption was 49.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. TIMEOUT Result, 72.7s OverallTime, 23 OverallIterations, 16 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 159 SDtfs, 12 SDslu, 1100 SDs, 0 SdLazy, 2876 SolverSat, 30 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 14.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 208 SyntacticMatches, 7 SemanticMatches, 277 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 38.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 33.9s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 536 ConstructedInterpolants, 20 QuantifiedInterpolants, 122910 SizeOfPredicates, 85 NumberOfNonLiveVariables, 3986 ConjunctsInSsa, 2562 ConjunctsInUnsatCore, 41 InterpolantComputations, 3 PerfectInterpolantSequences, 15/1665 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-53-08-179.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__barthe2.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-53-08-179.csv Completed graceful shutdown