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/rec__rec_while.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 10:13:35,724 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 10:13:35,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 10:13:35,747 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 10:13:35,747 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 10:13:35,748 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 10:13:35,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 10:13:35,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 10:13:35,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 10:13:35,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 10:13:35,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 10:13:35,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 10:13:35,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 10:13:35,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 10:13:35,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 10:13:35,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 10:13:35,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 10:13:35,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 10:13:35,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 10:13:35,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 10:13:35,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 10:13:35,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 10:13:35,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 10:13:35,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 10:13:35,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 10:13:35,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 10:13:35,770 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 10:13:35,771 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 10:13:35,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 10:13:35,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 10:13:35,773 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 10:13:35,774 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 10:13:35,774 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 10:13:35,775 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 10:13:35,775 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 10:13:35,776 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 10:13:35,790 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 10:13:35,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 10:13:35,791 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 10:13:35,791 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 10:13:35,792 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 10:13:35,792 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 10:13:35,792 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 10:13:35,793 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 10:13:35,793 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 10:13:35,793 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 10:13:35,793 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 10:13:35,793 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 10:13:35,794 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 10:13:35,794 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 10:13:35,794 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 10:13:35,794 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 10:13:35,795 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 10:13:35,795 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 10:13:35,795 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 10:13:35,795 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 10:13:35,795 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 10:13:35,797 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 10:13:35,797 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 10:13:35,853 INFO ]: Repository-Root is: /tmp [2018-06-25 10:13:35,870 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 10:13:35,876 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 10:13:35,878 INFO ]: Initializing SmtParser... [2018-06-25 10:13:35,878 INFO ]: SmtParser initialized [2018-06-25 10:13:35,879 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 [2018-06-25 10:13:35,880 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 10:13:35,967 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@2df7752c [2018-06-25 10:13:36,267 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__rec_while.smt2 [2018-06-25 10:13:36,271 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 10:13:36,281 INFO ]: Walking toolchain with 4 elements. [2018-06-25 10:13:36,282 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 10:13:36,282 INFO ]: Initializing ChcToBoogie... [2018-06-25 10:13:36,282 INFO ]: ChcToBoogie initialized [2018-06-25 10:13:36,285 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 10:13:36" (1/1) ... [2018-06-25 10:13:36,362 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36 Unit [2018-06-25 10:13:36,362 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 10:13:36,363 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 10:13:36,363 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 10:13:36,363 INFO ]: Boogie Preprocessor initialized [2018-06-25 10:13:36,384 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36" (1/1) ... [2018-06-25 10:13:36,384 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36" (1/1) ... [2018-06-25 10:13:36,394 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36" (1/1) ... [2018-06-25 10:13:36,395 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36" (1/1) ... [2018-06-25 10:13:36,407 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36" (1/1) ... [2018-06-25 10:13:36,415 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36" (1/1) ... [2018-06-25 10:13:36,417 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36" (1/1) ... [2018-06-25 10:13:36,424 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 10:13:36,424 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 10:13:36,424 INFO ]: Initializing RCFGBuilder... [2018-06-25 10:13:36,424 INFO ]: RCFGBuilder initialized [2018-06-25 10:13:36,425 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36" (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 10:13:36,445 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 10:13:36,445 INFO ]: Found specification of procedure gotoProc [2018-06-25 10:13:36,445 INFO ]: Found implementation of procedure gotoProc [2018-06-25 10:13:36,445 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 10:13:36,445 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 10:13:36,445 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 10:13:37,174 INFO ]: Using library mode [2018-06-25 10:13:37,174 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 10:13:37 BoogieIcfgContainer [2018-06-25 10:13:37,174 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 10:13:37,176 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 10:13:37,176 INFO ]: Initializing TraceAbstraction... [2018-06-25 10:13:37,179 INFO ]: TraceAbstraction initialized [2018-06-25 10:13:37,179 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 10:13:36" (1/3) ... [2018-06-25 10:13:37,180 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c50cec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 10:13:37, skipping insertion in model container [2018-06-25 10:13:37,180 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 10:13:36" (2/3) ... [2018-06-25 10:13:37,180 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c50cec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 10:13:37, skipping insertion in model container [2018-06-25 10:13:37,180 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 10:13:37" (3/3) ... [2018-06-25 10:13:37,182 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 10:13:37,191 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 10:13:37,205 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 10:13:37,248 INFO ]: Using default assertion order modulation [2018-06-25 10:13:37,249 INFO ]: Interprodecural is true [2018-06-25 10:13:37,249 INFO ]: Hoare is false [2018-06-25 10:13:37,249 INFO ]: Compute interpolants for FPandBP [2018-06-25 10:13:37,249 INFO ]: Backedges is TWOTRACK [2018-06-25 10:13:37,249 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 10:13:37,249 INFO ]: Difference is false [2018-06-25 10:13:37,249 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 10:13:37,249 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 10:13:37,267 INFO ]: Start isEmpty. Operand 58 states. [2018-06-25 10:13:37,284 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 10:13:37,284 INFO ]: Found error trace [2018-06-25 10:13:37,285 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:37,285 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:37,292 INFO ]: Analyzing trace with hash 617970914, now seen corresponding path program 1 times [2018-06-25 10:13:37,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:37,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:37,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:37,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:37,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:37,380 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:37,477 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:13:37,479 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:37,479 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:37,481 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:37,495 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:37,496 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:37,499 INFO ]: Start difference. First operand 58 states. Second operand 4 states. [2018-06-25 10:13:38,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:38,440 INFO ]: Finished difference Result 109 states and 185 transitions. [2018-06-25 10:13:38,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:13:38,442 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 10:13:38,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:38,458 INFO ]: With dead ends: 109 [2018-06-25 10:13:38,458 INFO ]: Without dead ends: 95 [2018-06-25 10:13:38,460 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:38,474 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-25 10:13:38,521 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-06-25 10:13:38,523 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-25 10:13:38,527 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 161 transitions. [2018-06-25 10:13:38,529 INFO ]: Start accepts. Automaton has 95 states and 161 transitions. Word has length 9 [2018-06-25 10:13:38,529 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:38,529 INFO ]: Abstraction has 95 states and 161 transitions. [2018-06-25 10:13:38,529 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:38,529 INFO ]: Start isEmpty. Operand 95 states and 161 transitions. [2018-06-25 10:13:38,531 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 10:13:38,531 INFO ]: Found error trace [2018-06-25 10:13:38,531 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:38,531 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:38,531 INFO ]: Analyzing trace with hash -1724575179, now seen corresponding path program 1 times [2018-06-25 10:13:38,531 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:38,531 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:38,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:38,534 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:38,534 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:38,548 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:38,599 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:13:38,599 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:38,599 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:38,600 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:38,601 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:38,601 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:38,601 INFO ]: Start difference. First operand 95 states and 161 transitions. Second operand 4 states. [2018-06-25 10:13:39,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:39,259 INFO ]: Finished difference Result 141 states and 240 transitions. [2018-06-25 10:13:39,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:13:39,259 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 10:13:39,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:39,265 INFO ]: With dead ends: 141 [2018-06-25 10:13:39,265 INFO ]: Without dead ends: 141 [2018-06-25 10:13:39,265 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:39,266 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-25 10:13:39,286 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-06-25 10:13:39,287 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-25 10:13:39,290 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 240 transitions. [2018-06-25 10:13:39,291 INFO ]: Start accepts. Automaton has 141 states and 240 transitions. Word has length 11 [2018-06-25 10:13:39,291 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:39,291 INFO ]: Abstraction has 141 states and 240 transitions. [2018-06-25 10:13:39,291 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:39,291 INFO ]: Start isEmpty. Operand 141 states and 240 transitions. [2018-06-25 10:13:39,293 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 10:13:39,293 INFO ]: Found error trace [2018-06-25 10:13:39,293 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:39,293 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:39,293 INFO ]: Analyzing trace with hash -627648599, now seen corresponding path program 1 times [2018-06-25 10:13:39,293 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:39,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:39,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:39,294 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:39,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:39,302 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:39,442 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:13:39,442 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:39,442 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:39,442 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:39,442 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:39,442 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:39,442 INFO ]: Start difference. First operand 141 states and 240 transitions. Second operand 4 states. [2018-06-25 10:13:39,771 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:39,771 INFO ]: Finished difference Result 182 states and 311 transitions. [2018-06-25 10:13:39,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:13:39,772 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-25 10:13:39,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:39,778 INFO ]: With dead ends: 182 [2018-06-25 10:13:39,778 INFO ]: Without dead ends: 182 [2018-06-25 10:13:39,778 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:39,778 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-25 10:13:39,796 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-06-25 10:13:39,797 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-25 10:13:39,801 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 311 transitions. [2018-06-25 10:13:39,801 INFO ]: Start accepts. Automaton has 182 states and 311 transitions. Word has length 14 [2018-06-25 10:13:39,801 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:39,801 INFO ]: Abstraction has 182 states and 311 transitions. [2018-06-25 10:13:39,801 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:39,801 INFO ]: Start isEmpty. Operand 182 states and 311 transitions. [2018-06-25 10:13:39,804 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 10:13:39,804 INFO ]: Found error trace [2018-06-25 10:13:39,804 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:39,804 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:39,805 INFO ]: Analyzing trace with hash -972918088, now seen corresponding path program 1 times [2018-06-25 10:13:39,805 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:39,805 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:39,805 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:39,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:39,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:39,813 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:39,848 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:13:39,848 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:39,848 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:39,849 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:39,849 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:39,849 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:39,849 INFO ]: Start difference. First operand 182 states and 311 transitions. Second operand 4 states. [2018-06-25 10:13:40,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:40,249 INFO ]: Finished difference Result 215 states and 369 transitions. [2018-06-25 10:13:40,287 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:13:40,287 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-25 10:13:40,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:40,293 INFO ]: With dead ends: 215 [2018-06-25 10:13:40,294 INFO ]: Without dead ends: 215 [2018-06-25 10:13:40,294 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:40,294 INFO ]: Start minimizeSevpa. Operand 215 states. [2018-06-25 10:13:40,312 INFO ]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-06-25 10:13:40,312 INFO ]: Start removeUnreachable. Operand 215 states. [2018-06-25 10:13:40,316 INFO ]: Finished removeUnreachable. Reduced from 215 states to 215 states and 369 transitions. [2018-06-25 10:13:40,316 INFO ]: Start accepts. Automaton has 215 states and 369 transitions. Word has length 16 [2018-06-25 10:13:40,316 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:40,316 INFO ]: Abstraction has 215 states and 369 transitions. [2018-06-25 10:13:40,316 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:40,316 INFO ]: Start isEmpty. Operand 215 states and 369 transitions. [2018-06-25 10:13:40,318 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 10:13:40,318 INFO ]: Found error trace [2018-06-25 10:13:40,318 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:40,318 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:40,319 INFO ]: Analyzing trace with hash -657997427, now seen corresponding path program 1 times [2018-06-25 10:13:40,319 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:40,319 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:40,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:40,319 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:40,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:40,332 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:40,380 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:13:40,380 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:40,380 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:40,380 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:40,380 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:40,380 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:40,380 INFO ]: Start difference. First operand 215 states and 369 transitions. Second operand 4 states. [2018-06-25 10:13:40,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:40,527 INFO ]: Finished difference Result 245 states and 463 transitions. [2018-06-25 10:13:40,527 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 10:13:40,527 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-25 10:13:40,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:40,538 INFO ]: With dead ends: 245 [2018-06-25 10:13:40,538 INFO ]: Without dead ends: 245 [2018-06-25 10:13:40,538 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:40,539 INFO ]: Start minimizeSevpa. Operand 245 states. [2018-06-25 10:13:40,559 INFO ]: Finished minimizeSevpa. Reduced states from 245 to 225. [2018-06-25 10:13:40,560 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-25 10:13:40,564 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 384 transitions. [2018-06-25 10:13:40,564 INFO ]: Start accepts. Automaton has 225 states and 384 transitions. Word has length 16 [2018-06-25 10:13:40,565 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:40,565 INFO ]: Abstraction has 225 states and 384 transitions. [2018-06-25 10:13:40,565 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:40,565 INFO ]: Start isEmpty. Operand 225 states and 384 transitions. [2018-06-25 10:13:40,567 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 10:13:40,567 INFO ]: Found error trace [2018-06-25 10:13:40,567 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:40,567 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:40,567 INFO ]: Analyzing trace with hash -772514031, now seen corresponding path program 1 times [2018-06-25 10:13:40,567 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:40,567 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:40,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:40,568 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:40,568 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:40,575 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:40,781 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:13:40,781 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:40,781 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:40,781 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:40,781 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:40,781 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:40,781 INFO ]: Start difference. First operand 225 states and 384 transitions. Second operand 4 states. [2018-06-25 10:13:41,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:41,024 INFO ]: Finished difference Result 264 states and 491 transitions. [2018-06-25 10:13:41,024 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 10:13:41,024 INFO ]: Start accepts. Automaton has 4 states. Word has length 16 [2018-06-25 10:13:41,024 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:41,029 INFO ]: With dead ends: 264 [2018-06-25 10:13:41,030 INFO ]: Without dead ends: 264 [2018-06-25 10:13:41,030 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:41,030 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-25 10:13:41,058 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 224. [2018-06-25 10:13:41,059 INFO ]: Start removeUnreachable. Operand 224 states. [2018-06-25 10:13:41,064 INFO ]: Finished removeUnreachable. Reduced from 224 states to 224 states and 382 transitions. [2018-06-25 10:13:41,064 INFO ]: Start accepts. Automaton has 224 states and 382 transitions. Word has length 16 [2018-06-25 10:13:41,065 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:41,065 INFO ]: Abstraction has 224 states and 382 transitions. [2018-06-25 10:13:41,065 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:41,065 INFO ]: Start isEmpty. Operand 224 states and 382 transitions. [2018-06-25 10:13:41,067 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 10:13:41,067 INFO ]: Found error trace [2018-06-25 10:13:41,067 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:41,067 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:41,067 INFO ]: Analyzing trace with hash 1073965225, now seen corresponding path program 1 times [2018-06-25 10:13:41,067 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:41,067 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:41,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,070 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:41,070 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,094 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:41,261 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:13:41,261 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:41,261 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 10:13:41,261 INFO ]: Interpolant automaton has 5 states [2018-06-25 10:13:41,261 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 10:13:41,261 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:41,261 INFO ]: Start difference. First operand 224 states and 382 transitions. Second operand 5 states. [2018-06-25 10:13:41,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:41,323 INFO ]: Finished difference Result 260 states and 485 transitions. [2018-06-25 10:13:41,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 10:13:41,324 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-25 10:13:41,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:41,329 INFO ]: With dead ends: 260 [2018-06-25 10:13:41,329 INFO ]: Without dead ends: 250 [2018-06-25 10:13:41,329 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:13:41,329 INFO ]: Start minimizeSevpa. Operand 250 states. [2018-06-25 10:13:41,346 INFO ]: Finished minimizeSevpa. Reduced states from 250 to 237. [2018-06-25 10:13:41,346 INFO ]: Start removeUnreachable. Operand 237 states. [2018-06-25 10:13:41,349 INFO ]: Finished removeUnreachable. Reduced from 237 states to 237 states and 399 transitions. [2018-06-25 10:13:41,349 INFO ]: Start accepts. Automaton has 237 states and 399 transitions. Word has length 17 [2018-06-25 10:13:41,349 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:41,349 INFO ]: Abstraction has 237 states and 399 transitions. [2018-06-25 10:13:41,349 INFO ]: Interpolant automaton has 5 states. [2018-06-25 10:13:41,349 INFO ]: Start isEmpty. Operand 237 states and 399 transitions. [2018-06-25 10:13:41,351 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 10:13:41,351 INFO ]: Found error trace [2018-06-25 10:13:41,351 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:41,351 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:41,351 INFO ]: Analyzing trace with hash 1818917797, now seen corresponding path program 1 times [2018-06-25 10:13:41,352 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:41,352 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:41,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,352 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:41,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,361 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:41,587 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:13:41,587 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:41,587 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 10:13:41,587 INFO ]: Interpolant automaton has 5 states [2018-06-25 10:13:41,587 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 10:13:41,587 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:41,587 INFO ]: Start difference. First operand 237 states and 399 transitions. Second operand 5 states. [2018-06-25 10:13:41,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:41,649 INFO ]: Finished difference Result 265 states and 486 transitions. [2018-06-25 10:13:41,651 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 10:13:41,651 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-25 10:13:41,651 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:41,656 INFO ]: With dead ends: 265 [2018-06-25 10:13:41,656 INFO ]: Without dead ends: 255 [2018-06-25 10:13:41,656 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:13:41,656 INFO ]: Start minimizeSevpa. Operand 255 states. [2018-06-25 10:13:41,670 INFO ]: Finished minimizeSevpa. Reduced states from 255 to 237. [2018-06-25 10:13:41,670 INFO ]: Start removeUnreachable. Operand 237 states. [2018-06-25 10:13:41,673 INFO ]: Finished removeUnreachable. Reduced from 237 states to 237 states and 399 transitions. [2018-06-25 10:13:41,673 INFO ]: Start accepts. Automaton has 237 states and 399 transitions. Word has length 17 [2018-06-25 10:13:41,673 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:41,673 INFO ]: Abstraction has 237 states and 399 transitions. [2018-06-25 10:13:41,673 INFO ]: Interpolant automaton has 5 states. [2018-06-25 10:13:41,673 INFO ]: Start isEmpty. Operand 237 states and 399 transitions. [2018-06-25 10:13:41,675 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 10:13:41,675 INFO ]: Found error trace [2018-06-25 10:13:41,675 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:41,675 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:41,676 INFO ]: Analyzing trace with hash 752667424, now seen corresponding path program 1 times [2018-06-25 10:13:41,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:41,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:41,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,676 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:41,676 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,684 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:41,718 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 10:13:41,719 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:41,719 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:41,719 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:41,719 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:41,719 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:41,719 INFO ]: Start difference. First operand 237 states and 399 transitions. Second operand 4 states. [2018-06-25 10:13:41,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:41,755 INFO ]: Finished difference Result 267 states and 488 transitions. [2018-06-25 10:13:41,756 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 10:13:41,756 INFO ]: Start accepts. Automaton has 4 states. Word has length 19 [2018-06-25 10:13:41,756 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:41,760 INFO ]: With dead ends: 267 [2018-06-25 10:13:41,760 INFO ]: Without dead ends: 267 [2018-06-25 10:13:41,760 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:41,761 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-25 10:13:41,775 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 247. [2018-06-25 10:13:41,775 INFO ]: Start removeUnreachable. Operand 247 states. [2018-06-25 10:13:41,778 INFO ]: Finished removeUnreachable. Reduced from 247 states to 247 states and 409 transitions. [2018-06-25 10:13:41,778 INFO ]: Start accepts. Automaton has 247 states and 409 transitions. Word has length 19 [2018-06-25 10:13:41,778 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:41,778 INFO ]: Abstraction has 247 states and 409 transitions. [2018-06-25 10:13:41,778 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:41,778 INFO ]: Start isEmpty. Operand 247 states and 409 transitions. [2018-06-25 10:13:41,780 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 10:13:41,780 INFO ]: Found error trace [2018-06-25 10:13:41,780 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:41,780 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:41,781 INFO ]: Analyzing trace with hash -607449316, now seen corresponding path program 1 times [2018-06-25 10:13:41,781 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:41,781 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:41,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:41,781 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,788 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:41,896 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 10:13:41,896 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:41,896 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:41,896 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:41,896 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:41,896 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:41,896 INFO ]: Start difference. First operand 247 states and 409 transitions. Second operand 4 states. [2018-06-25 10:13:41,921 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:41,921 INFO ]: Finished difference Result 277 states and 498 transitions. [2018-06-25 10:13:41,921 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 10:13:41,921 INFO ]: Start accepts. Automaton has 4 states. Word has length 19 [2018-06-25 10:13:41,921 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:41,925 INFO ]: With dead ends: 277 [2018-06-25 10:13:41,925 INFO ]: Without dead ends: 277 [2018-06-25 10:13:41,925 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:41,926 INFO ]: Start minimizeSevpa. Operand 277 states. [2018-06-25 10:13:41,941 INFO ]: Finished minimizeSevpa. Reduced states from 277 to 242. [2018-06-25 10:13:41,941 INFO ]: Start removeUnreachable. Operand 242 states. [2018-06-25 10:13:41,944 INFO ]: Finished removeUnreachable. Reduced from 242 states to 242 states and 404 transitions. [2018-06-25 10:13:41,944 INFO ]: Start accepts. Automaton has 242 states and 404 transitions. Word has length 19 [2018-06-25 10:13:41,944 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:41,944 INFO ]: Abstraction has 242 states and 404 transitions. [2018-06-25 10:13:41,944 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:41,944 INFO ]: Start isEmpty. Operand 242 states and 404 transitions. [2018-06-25 10:13:41,946 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 10:13:41,946 INFO ]: Found error trace [2018-06-25 10:13:41,947 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:41,947 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:41,948 INFO ]: Analyzing trace with hash -1469646746, now seen corresponding path program 1 times [2018-06-25 10:13:41,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:41,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:41,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:41,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:41,978 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:42,031 INFO ]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 10:13:42,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:42,031 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 10:13:42,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:42,071 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:42,079 INFO ]: Computing forward predicates... [2018-06-25 10:13:42,191 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 10:13:42,210 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 10:13:42,210 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-06-25 10:13:42,211 INFO ]: Interpolant automaton has 9 states [2018-06-25 10:13:42,211 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-25 10:13:42,211 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-25 10:13:42,211 INFO ]: Start difference. First operand 242 states and 404 transitions. Second operand 9 states. [2018-06-25 10:13:42,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:42,538 INFO ]: Finished difference Result 329 states and 667 transitions. [2018-06-25 10:13:42,538 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 10:13:42,538 INFO ]: Start accepts. Automaton has 9 states. Word has length 20 [2018-06-25 10:13:42,538 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:42,547 INFO ]: With dead ends: 329 [2018-06-25 10:13:42,547 INFO ]: Without dead ends: 314 [2018-06-25 10:13:42,547 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2018-06-25 10:13:42,548 INFO ]: Start minimizeSevpa. Operand 314 states. [2018-06-25 10:13:42,569 INFO ]: Finished minimizeSevpa. Reduced states from 314 to 261. [2018-06-25 10:13:42,569 INFO ]: Start removeUnreachable. Operand 261 states. [2018-06-25 10:13:42,574 INFO ]: Finished removeUnreachable. Reduced from 261 states to 261 states and 428 transitions. [2018-06-25 10:13:42,574 INFO ]: Start accepts. Automaton has 261 states and 428 transitions. Word has length 20 [2018-06-25 10:13:42,574 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:42,574 INFO ]: Abstraction has 261 states and 428 transitions. [2018-06-25 10:13:42,574 INFO ]: Interpolant automaton has 9 states. [2018-06-25 10:13:42,574 INFO ]: Start isEmpty. Operand 261 states and 428 transitions. [2018-06-25 10:13:42,578 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 10:13:42,578 INFO ]: Found error trace [2018-06-25 10:13:42,578 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:42,578 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:42,578 INFO ]: Analyzing trace with hash 280510956, now seen corresponding path program 1 times [2018-06-25 10:13:42,578 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:42,578 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:42,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:42,579 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:42,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:42,591 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:42,829 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 10:13:42,829 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:42,829 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 10:13:42,829 INFO ]: Interpolant automaton has 5 states [2018-06-25 10:13:42,829 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 10:13:42,829 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:42,830 INFO ]: Start difference. First operand 261 states and 428 transitions. Second operand 5 states. [2018-06-25 10:13:43,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:43,330 INFO ]: Finished difference Result 294 states and 564 transitions. [2018-06-25 10:13:43,330 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 10:13:43,330 INFO ]: Start accepts. Automaton has 5 states. Word has length 21 [2018-06-25 10:13:43,330 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:43,338 INFO ]: With dead ends: 294 [2018-06-25 10:13:43,338 INFO ]: Without dead ends: 279 [2018-06-25 10:13:43,338 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:13:43,349 INFO ]: Start minimizeSevpa. Operand 279 states. [2018-06-25 10:13:43,365 INFO ]: Finished minimizeSevpa. Reduced states from 279 to 256. [2018-06-25 10:13:43,365 INFO ]: Start removeUnreachable. Operand 256 states. [2018-06-25 10:13:43,367 INFO ]: Finished removeUnreachable. Reduced from 256 states to 256 states and 418 transitions. [2018-06-25 10:13:43,367 INFO ]: Start accepts. Automaton has 256 states and 418 transitions. Word has length 21 [2018-06-25 10:13:43,367 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:43,367 INFO ]: Abstraction has 256 states and 418 transitions. [2018-06-25 10:13:43,367 INFO ]: Interpolant automaton has 5 states. [2018-06-25 10:13:43,367 INFO ]: Start isEmpty. Operand 256 states and 418 transitions. [2018-06-25 10:13:43,373 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 10:13:43,373 INFO ]: Found error trace [2018-06-25 10:13:43,373 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:43,374 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:43,375 INFO ]: Analyzing trace with hash 1949160550, now seen corresponding path program 1 times [2018-06-25 10:13:43,375 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:43,375 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:43,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:43,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:43,376 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:43,392 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:43,541 INFO ]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 10:13:43,541 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:43,542 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:43,542 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:43,542 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:43,542 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:43,542 INFO ]: Start difference. First operand 256 states and 418 transitions. Second operand 4 states. [2018-06-25 10:13:43,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:43,602 INFO ]: Finished difference Result 261 states and 423 transitions. [2018-06-25 10:13:43,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 10:13:43,603 INFO ]: Start accepts. Automaton has 4 states. Word has length 26 [2018-06-25 10:13:43,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:43,605 INFO ]: With dead ends: 261 [2018-06-25 10:13:43,605 INFO ]: Without dead ends: 246 [2018-06-25 10:13:43,605 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:43,606 INFO ]: Start minimizeSevpa. Operand 246 states. [2018-06-25 10:13:43,614 INFO ]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-06-25 10:13:43,614 INFO ]: Start removeUnreachable. Operand 246 states. [2018-06-25 10:13:43,616 INFO ]: Finished removeUnreachable. Reduced from 246 states to 246 states and 393 transitions. [2018-06-25 10:13:43,616 INFO ]: Start accepts. Automaton has 246 states and 393 transitions. Word has length 26 [2018-06-25 10:13:43,616 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:43,616 INFO ]: Abstraction has 246 states and 393 transitions. [2018-06-25 10:13:43,616 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:43,616 INFO ]: Start isEmpty. Operand 246 states and 393 transitions. [2018-06-25 10:13:43,621 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 10:13:43,621 INFO ]: Found error trace [2018-06-25 10:13:43,622 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:43,622 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:43,622 INFO ]: Analyzing trace with hash 1353258885, now seen corresponding path program 1 times [2018-06-25 10:13:43,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:43,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:43,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:43,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:43,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:43,631 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:43,733 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 10:13:43,733 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:43,733 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 10:13:43,749 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:43,787 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:43,789 INFO ]: Computing forward predicates... [2018-06-25 10:13:44,006 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 10:13:44,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:44,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-25 10:13:44,026 INFO ]: Interpolant automaton has 13 states [2018-06-25 10:13:44,026 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 10:13:44,026 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-25 10:13:44,027 INFO ]: Start difference. First operand 246 states and 393 transitions. Second operand 13 states. [2018-06-25 10:13:45,603 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:45,603 INFO ]: Finished difference Result 346 states and 575 transitions. [2018-06-25 10:13:45,622 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 10:13:45,623 INFO ]: Start accepts. Automaton has 13 states. Word has length 27 [2018-06-25 10:13:45,623 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:45,626 INFO ]: With dead ends: 346 [2018-06-25 10:13:45,626 INFO ]: Without dead ends: 268 [2018-06-25 10:13:45,627 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-06-25 10:13:45,627 INFO ]: Start minimizeSevpa. Operand 268 states. [2018-06-25 10:13:45,637 INFO ]: Finished minimizeSevpa. Reduced states from 268 to 252. [2018-06-25 10:13:45,637 INFO ]: Start removeUnreachable. Operand 252 states. [2018-06-25 10:13:45,640 INFO ]: Finished removeUnreachable. Reduced from 252 states to 252 states and 408 transitions. [2018-06-25 10:13:45,640 INFO ]: Start accepts. Automaton has 252 states and 408 transitions. Word has length 27 [2018-06-25 10:13:45,640 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:45,640 INFO ]: Abstraction has 252 states and 408 transitions. [2018-06-25 10:13:45,640 INFO ]: Interpolant automaton has 13 states. [2018-06-25 10:13:45,640 INFO ]: Start isEmpty. Operand 252 states and 408 transitions. [2018-06-25 10:13:45,643 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 10:13:45,645 INFO ]: Found error trace [2018-06-25 10:13:45,645 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:45,645 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:45,645 INFO ]: Analyzing trace with hash 1643478271, now seen corresponding path program 2 times [2018-06-25 10:13:45,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:45,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:45,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:45,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:45,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:45,665 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:45,762 INFO ]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 10:13:45,762 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:45,762 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) [2018-06-25 10:13:45,777 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 10:13:45,834 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 10:13:45,834 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:45,837 INFO ]: Computing forward predicates... [2018-06-25 10:13:46,061 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 10:13:46,081 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 10:13:46,081 INFO ]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2018-06-25 10:13:46,081 INFO ]: Interpolant automaton has 17 states [2018-06-25 10:13:46,081 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 10:13:46,081 INFO ]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-06-25 10:13:46,081 INFO ]: Start difference. First operand 252 states and 408 transitions. Second operand 17 states. [2018-06-25 10:13:46,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:46,696 INFO ]: Finished difference Result 331 states and 596 transitions. [2018-06-25 10:13:46,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 10:13:46,696 INFO ]: Start accepts. Automaton has 17 states. Word has length 28 [2018-06-25 10:13:46,697 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:46,703 INFO ]: With dead ends: 331 [2018-06-25 10:13:46,703 INFO ]: Without dead ends: 331 [2018-06-25 10:13:46,703 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2018-06-25 10:13:46,704 INFO ]: Start minimizeSevpa. Operand 331 states. [2018-06-25 10:13:46,720 INFO ]: Finished minimizeSevpa. Reduced states from 331 to 269. [2018-06-25 10:13:46,720 INFO ]: Start removeUnreachable. Operand 269 states. [2018-06-25 10:13:46,723 INFO ]: Finished removeUnreachable. Reduced from 269 states to 269 states and 445 transitions. [2018-06-25 10:13:46,723 INFO ]: Start accepts. Automaton has 269 states and 445 transitions. Word has length 28 [2018-06-25 10:13:46,723 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:46,723 INFO ]: Abstraction has 269 states and 445 transitions. [2018-06-25 10:13:46,723 INFO ]: Interpolant automaton has 17 states. [2018-06-25 10:13:46,723 INFO ]: Start isEmpty. Operand 269 states and 445 transitions. [2018-06-25 10:13:46,727 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 10:13:46,727 INFO ]: Found error trace [2018-06-25 10:13:46,727 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:46,727 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:46,727 INFO ]: Analyzing trace with hash 215062528, now seen corresponding path program 1 times [2018-06-25 10:13:46,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:46,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:46,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:46,728 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 10:13:46,728 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:46,733 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:46,818 INFO ]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 10:13:46,818 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:46,818 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:46,818 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:46,818 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:46,818 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:46,818 INFO ]: Start difference. First operand 269 states and 445 transitions. Second operand 4 states. [2018-06-25 10:13:46,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:46,833 INFO ]: Finished difference Result 274 states and 450 transitions. [2018-06-25 10:13:46,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 10:13:46,833 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-25 10:13:46,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:46,835 INFO ]: With dead ends: 274 [2018-06-25 10:13:46,835 INFO ]: Without dead ends: 259 [2018-06-25 10:13:46,836 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:46,836 INFO ]: Start minimizeSevpa. Operand 259 states. [2018-06-25 10:13:46,849 INFO ]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-06-25 10:13:46,849 INFO ]: Start removeUnreachable. Operand 259 states. [2018-06-25 10:13:46,855 INFO ]: Finished removeUnreachable. Reduced from 259 states to 259 states and 420 transitions. [2018-06-25 10:13:46,856 INFO ]: Start accepts. Automaton has 259 states and 420 transitions. Word has length 29 [2018-06-25 10:13:46,856 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:46,856 INFO ]: Abstraction has 259 states and 420 transitions. [2018-06-25 10:13:46,856 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:46,856 INFO ]: Start isEmpty. Operand 259 states and 420 transitions. [2018-06-25 10:13:46,860 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 10:13:46,860 INFO ]: Found error trace [2018-06-25 10:13:46,860 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:46,860 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:46,861 INFO ]: Analyzing trace with hash 2011255367, now seen corresponding path program 1 times [2018-06-25 10:13:46,861 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:46,861 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:46,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:46,861 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:46,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:46,877 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:46,986 INFO ]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 10:13:46,986 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:46,986 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 10:13:46,992 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:47,033 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:47,036 INFO ]: Computing forward predicates... [2018-06-25 10:13:47,248 INFO ]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 10:13:47,268 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:47,268 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-25 10:13:47,268 INFO ]: Interpolant automaton has 13 states [2018-06-25 10:13:47,268 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 10:13:47,268 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-25 10:13:47,268 INFO ]: Start difference. First operand 259 states and 420 transitions. Second operand 13 states. [2018-06-25 10:13:47,766 WARN ]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 10:13:48,175 WARN ]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-25 10:13:48,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:48,769 INFO ]: Finished difference Result 362 states and 596 transitions. [2018-06-25 10:13:48,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 10:13:48,769 INFO ]: Start accepts. Automaton has 13 states. Word has length 31 [2018-06-25 10:13:48,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:48,772 INFO ]: With dead ends: 362 [2018-06-25 10:13:48,772 INFO ]: Without dead ends: 329 [2018-06-25 10:13:48,772 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-06-25 10:13:48,773 INFO ]: Start minimizeSevpa. Operand 329 states. [2018-06-25 10:13:48,784 INFO ]: Finished minimizeSevpa. Reduced states from 329 to 315. [2018-06-25 10:13:48,785 INFO ]: Start removeUnreachable. Operand 315 states. [2018-06-25 10:13:48,789 INFO ]: Finished removeUnreachable. Reduced from 315 states to 315 states and 520 transitions. [2018-06-25 10:13:48,789 INFO ]: Start accepts. Automaton has 315 states and 520 transitions. Word has length 31 [2018-06-25 10:13:48,789 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:48,789 INFO ]: Abstraction has 315 states and 520 transitions. [2018-06-25 10:13:48,789 INFO ]: Interpolant automaton has 13 states. [2018-06-25 10:13:48,789 INFO ]: Start isEmpty. Operand 315 states and 520 transitions. [2018-06-25 10:13:48,792 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 10:13:48,792 INFO ]: Found error trace [2018-06-25 10:13:48,792 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:48,792 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:48,792 INFO ]: Analyzing trace with hash 2075592391, now seen corresponding path program 1 times [2018-06-25 10:13:48,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:48,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:48,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:48,793 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:48,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:48,800 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:48,889 INFO ]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 10:13:48,889 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:48,889 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 10:13:48,889 INFO ]: Interpolant automaton has 7 states [2018-06-25 10:13:48,889 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 10:13:48,889 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:13:48,890 INFO ]: Start difference. First operand 315 states and 520 transitions. Second operand 7 states. [2018-06-25 10:13:49,671 WARN ]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-06-25 10:13:50,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:50,004 INFO ]: Finished difference Result 455 states and 796 transitions. [2018-06-25 10:13:50,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 10:13:50,004 INFO ]: Start accepts. Automaton has 7 states. Word has length 31 [2018-06-25 10:13:50,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:50,009 INFO ]: With dead ends: 455 [2018-06-25 10:13:50,009 INFO ]: Without dead ends: 397 [2018-06-25 10:13:50,009 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-25 10:13:50,009 INFO ]: Start minimizeSevpa. Operand 397 states. [2018-06-25 10:13:50,025 INFO ]: Finished minimizeSevpa. Reduced states from 397 to 320. [2018-06-25 10:13:50,025 INFO ]: Start removeUnreachable. Operand 320 states. [2018-06-25 10:13:50,028 INFO ]: Finished removeUnreachable. Reduced from 320 states to 320 states and 527 transitions. [2018-06-25 10:13:50,028 INFO ]: Start accepts. Automaton has 320 states and 527 transitions. Word has length 31 [2018-06-25 10:13:50,028 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:50,028 INFO ]: Abstraction has 320 states and 527 transitions. [2018-06-25 10:13:50,028 INFO ]: Interpolant automaton has 7 states. [2018-06-25 10:13:50,028 INFO ]: Start isEmpty. Operand 320 states and 527 transitions. [2018-06-25 10:13:50,031 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 10:13:50,031 INFO ]: Found error trace [2018-06-25 10:13:50,031 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:50,031 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:50,031 INFO ]: Analyzing trace with hash -875349719, now seen corresponding path program 2 times [2018-06-25 10:13:50,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:50,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:50,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:50,032 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:50,032 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:50,049 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:50,546 INFO ]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 10:13:50,546 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:50,546 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 10:13:50,547 INFO ]: Interpolant automaton has 7 states [2018-06-25 10:13:50,547 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 10:13:50,547 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:13:50,547 INFO ]: Start difference. First operand 320 states and 527 transitions. Second operand 7 states. [2018-06-25 10:13:51,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:51,181 INFO ]: Finished difference Result 402 states and 738 transitions. [2018-06-25 10:13:51,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 10:13:51,181 INFO ]: Start accepts. Automaton has 7 states. Word has length 32 [2018-06-25 10:13:51,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:51,184 INFO ]: With dead ends: 402 [2018-06-25 10:13:51,184 INFO ]: Without dead ends: 384 [2018-06-25 10:13:51,184 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-06-25 10:13:51,184 INFO ]: Start minimizeSevpa. Operand 384 states. [2018-06-25 10:13:51,201 INFO ]: Finished minimizeSevpa. Reduced states from 384 to 347. [2018-06-25 10:13:51,201 INFO ]: Start removeUnreachable. Operand 347 states. [2018-06-25 10:13:51,204 INFO ]: Finished removeUnreachable. Reduced from 347 states to 347 states and 570 transitions. [2018-06-25 10:13:51,204 INFO ]: Start accepts. Automaton has 347 states and 570 transitions. Word has length 32 [2018-06-25 10:13:51,204 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:51,204 INFO ]: Abstraction has 347 states and 570 transitions. [2018-06-25 10:13:51,204 INFO ]: Interpolant automaton has 7 states. [2018-06-25 10:13:51,204 INFO ]: Start isEmpty. Operand 347 states and 570 transitions. [2018-06-25 10:13:51,207 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 10:13:51,207 INFO ]: Found error trace [2018-06-25 10:13:51,207 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:51,207 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:51,207 INFO ]: Analyzing trace with hash -1350804579, now seen corresponding path program 1 times [2018-06-25 10:13:51,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:51,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:51,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:51,208 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 10:13:51,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:51,220 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:51,449 INFO ]: Checked inductivity of 23 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-25 10:13:51,449 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:51,449 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 10:13:51,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:51,502 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:51,505 INFO ]: Computing forward predicates... [2018-06-25 10:13:51,601 INFO ]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 10:13:51,633 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:51,633 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2018-06-25 10:13:51,633 INFO ]: Interpolant automaton has 12 states [2018-06-25 10:13:51,633 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 10:13:51,633 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-25 10:13:51,633 INFO ]: Start difference. First operand 347 states and 570 transitions. Second operand 12 states. [2018-06-25 10:13:51,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:51,911 INFO ]: Finished difference Result 444 states and 788 transitions. [2018-06-25 10:13:51,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 10:13:51,912 INFO ]: Start accepts. Automaton has 12 states. Word has length 33 [2018-06-25 10:13:51,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:51,916 INFO ]: With dead ends: 444 [2018-06-25 10:13:51,916 INFO ]: Without dead ends: 438 [2018-06-25 10:13:51,917 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2018-06-25 10:13:51,917 INFO ]: Start minimizeSevpa. Operand 438 states. [2018-06-25 10:13:51,934 INFO ]: Finished minimizeSevpa. Reduced states from 438 to 356. [2018-06-25 10:13:51,934 INFO ]: Start removeUnreachable. Operand 356 states. [2018-06-25 10:13:51,936 INFO ]: Finished removeUnreachable. Reduced from 356 states to 356 states and 563 transitions. [2018-06-25 10:13:51,936 INFO ]: Start accepts. Automaton has 356 states and 563 transitions. Word has length 33 [2018-06-25 10:13:51,936 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:51,936 INFO ]: Abstraction has 356 states and 563 transitions. [2018-06-25 10:13:51,936 INFO ]: Interpolant automaton has 12 states. [2018-06-25 10:13:51,936 INFO ]: Start isEmpty. Operand 356 states and 563 transitions. [2018-06-25 10:13:51,940 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 10:13:51,940 INFO ]: Found error trace [2018-06-25 10:13:51,940 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:51,941 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:51,941 INFO ]: Analyzing trace with hash -697631993, now seen corresponding path program 1 times [2018-06-25 10:13:51,941 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:51,941 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:51,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:51,941 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:51,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:51,956 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:52,065 INFO ]: Checked inductivity of 23 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 10:13:52,065 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:52,065 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) [2018-06-25 10:13:52,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 10:13:52,113 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:52,116 INFO ]: Computing forward predicates... [2018-06-25 10:13:52,243 INFO ]: Checked inductivity of 23 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 10:13:52,263 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:52,263 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-25 10:13:52,263 INFO ]: Interpolant automaton has 13 states [2018-06-25 10:13:52,263 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 10:13:52,263 INFO ]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-25 10:13:52,263 INFO ]: Start difference. First operand 356 states and 563 transitions. Second operand 13 states. [2018-06-25 10:13:52,599 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:52,599 INFO ]: Finished difference Result 373 states and 604 transitions. [2018-06-25 10:13:52,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 10:13:52,600 INFO ]: Start accepts. Automaton has 13 states. Word has length 34 [2018-06-25 10:13:52,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:52,602 INFO ]: With dead ends: 373 [2018-06-25 10:13:52,602 INFO ]: Without dead ends: 373 [2018-06-25 10:13:52,603 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-06-25 10:13:52,603 INFO ]: Start minimizeSevpa. Operand 373 states. [2018-06-25 10:13:52,628 INFO ]: Finished minimizeSevpa. Reduced states from 373 to 366. [2018-06-25 10:13:52,629 INFO ]: Start removeUnreachable. Operand 366 states. [2018-06-25 10:13:52,634 INFO ]: Finished removeUnreachable. Reduced from 366 states to 366 states and 592 transitions. [2018-06-25 10:13:52,635 INFO ]: Start accepts. Automaton has 366 states and 592 transitions. Word has length 34 [2018-06-25 10:13:52,635 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:52,635 INFO ]: Abstraction has 366 states and 592 transitions. [2018-06-25 10:13:52,635 INFO ]: Interpolant automaton has 13 states. [2018-06-25 10:13:52,635 INFO ]: Start isEmpty. Operand 366 states and 592 transitions. [2018-06-25 10:13:52,639 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 10:13:52,639 INFO ]: Found error trace [2018-06-25 10:13:52,639 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:52,639 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:52,639 INFO ]: Analyzing trace with hash 1389126886, now seen corresponding path program 1 times [2018-06-25 10:13:52,639 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:52,639 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:52,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:52,640 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:52,640 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:52,651 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:52,894 INFO ]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-25 10:13:52,894 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:52,894 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 10:13:52,894 INFO ]: Interpolant automaton has 7 states [2018-06-25 10:13:52,894 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 10:13:52,894 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:13:52,894 INFO ]: Start difference. First operand 366 states and 592 transitions. Second operand 7 states. [2018-06-25 10:13:53,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:53,173 INFO ]: Finished difference Result 474 states and 848 transitions. [2018-06-25 10:13:53,174 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 10:13:53,174 INFO ]: Start accepts. Automaton has 7 states. Word has length 34 [2018-06-25 10:13:53,174 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:53,178 INFO ]: With dead ends: 474 [2018-06-25 10:13:53,178 INFO ]: Without dead ends: 474 [2018-06-25 10:13:53,178 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-06-25 10:13:53,178 INFO ]: Start minimizeSevpa. Operand 474 states. [2018-06-25 10:13:53,192 INFO ]: Finished minimizeSevpa. Reduced states from 474 to 375. [2018-06-25 10:13:53,192 INFO ]: Start removeUnreachable. Operand 375 states. [2018-06-25 10:13:53,194 INFO ]: Finished removeUnreachable. Reduced from 375 states to 375 states and 605 transitions. [2018-06-25 10:13:53,194 INFO ]: Start accepts. Automaton has 375 states and 605 transitions. Word has length 34 [2018-06-25 10:13:53,194 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:53,194 INFO ]: Abstraction has 375 states and 605 transitions. [2018-06-25 10:13:53,194 INFO ]: Interpolant automaton has 7 states. [2018-06-25 10:13:53,195 INFO ]: Start isEmpty. Operand 375 states and 605 transitions. [2018-06-25 10:13:53,198 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 10:13:53,198 INFO ]: Found error trace [2018-06-25 10:13:53,198 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:53,198 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:53,198 INFO ]: Analyzing trace with hash -734905045, now seen corresponding path program 2 times [2018-06-25 10:13:53,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:53,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:53,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:53,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:53,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:53,209 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:53,374 INFO ]: Checked inductivity of 27 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 10:13:53,374 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:53,374 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 10:13:53,380 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 10:13:53,406 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 10:13:53,406 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:53,408 INFO ]: Computing forward predicates... [2018-06-25 10:13:53,496 INFO ]: Checked inductivity of 27 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 10:13:53,515 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:53,515 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-25 10:13:53,515 INFO ]: Interpolant automaton has 15 states [2018-06-25 10:13:53,515 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 10:13:53,515 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-25 10:13:53,515 INFO ]: Start difference. First operand 375 states and 605 transitions. Second operand 15 states. [2018-06-25 10:13:54,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:54,214 INFO ]: Finished difference Result 528 states and 1022 transitions. [2018-06-25 10:13:54,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 10:13:54,214 INFO ]: Start accepts. Automaton has 15 states. Word has length 35 [2018-06-25 10:13:54,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:54,218 INFO ]: With dead ends: 528 [2018-06-25 10:13:54,218 INFO ]: Without dead ends: 528 [2018-06-25 10:13:54,218 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=366, Invalid=1274, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 10:13:54,219 INFO ]: Start minimizeSevpa. Operand 528 states. [2018-06-25 10:13:54,233 INFO ]: Finished minimizeSevpa. Reduced states from 528 to 402. [2018-06-25 10:13:54,233 INFO ]: Start removeUnreachable. Operand 402 states. [2018-06-25 10:13:54,235 INFO ]: Finished removeUnreachable. Reduced from 402 states to 402 states and 650 transitions. [2018-06-25 10:13:54,235 INFO ]: Start accepts. Automaton has 402 states and 650 transitions. Word has length 35 [2018-06-25 10:13:54,235 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:54,235 INFO ]: Abstraction has 402 states and 650 transitions. [2018-06-25 10:13:54,235 INFO ]: Interpolant automaton has 15 states. [2018-06-25 10:13:54,235 INFO ]: Start isEmpty. Operand 402 states and 650 transitions. [2018-06-25 10:13:54,239 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 10:13:54,239 INFO ]: Found error trace [2018-06-25 10:13:54,239 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:54,239 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:54,239 INFO ]: Analyzing trace with hash -1283323350, now seen corresponding path program 1 times [2018-06-25 10:13:54,239 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:54,239 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:54,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:54,240 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 10:13:54,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:54,243 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:54,263 INFO ]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 10:13:54,263 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:54,263 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:54,263 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:54,263 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:54,263 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:54,263 INFO ]: Start difference. First operand 402 states and 650 transitions. Second operand 4 states. [2018-06-25 10:13:54,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:54,348 INFO ]: Finished difference Result 544 states and 863 transitions. [2018-06-25 10:13:54,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:13:54,348 INFO ]: Start accepts. Automaton has 4 states. Word has length 36 [2018-06-25 10:13:54,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:54,351 INFO ]: With dead ends: 544 [2018-06-25 10:13:54,351 INFO ]: Without dead ends: 444 [2018-06-25 10:13:54,351 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:54,351 INFO ]: Start minimizeSevpa. Operand 444 states. [2018-06-25 10:13:54,359 INFO ]: Finished minimizeSevpa. Reduced states from 444 to 444. [2018-06-25 10:13:54,359 INFO ]: Start removeUnreachable. Operand 444 states. [2018-06-25 10:13:54,361 INFO ]: Finished removeUnreachable. Reduced from 444 states to 444 states and 712 transitions. [2018-06-25 10:13:54,362 INFO ]: Start accepts. Automaton has 444 states and 712 transitions. Word has length 36 [2018-06-25 10:13:54,362 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:54,362 INFO ]: Abstraction has 444 states and 712 transitions. [2018-06-25 10:13:54,362 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:54,362 INFO ]: Start isEmpty. Operand 444 states and 712 transitions. [2018-06-25 10:13:54,365 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 10:13:54,365 INFO ]: Found error trace [2018-06-25 10:13:54,365 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:54,365 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:54,365 INFO ]: Analyzing trace with hash -186065882, now seen corresponding path program 1 times [2018-06-25 10:13:54,365 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:54,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:54,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:54,365 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:54,365 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:54,378 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:54,893 INFO ]: Checked inductivity of 32 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 10:13:54,894 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:54,894 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 10:13:54,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:54,950 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:54,953 INFO ]: Computing forward predicates... [2018-06-25 10:13:55,166 INFO ]: Checked inductivity of 32 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 10:13:55,185 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:55,185 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-06-25 10:13:55,185 INFO ]: Interpolant automaton has 15 states [2018-06-25 10:13:55,185 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 10:13:55,185 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-25 10:13:55,185 INFO ]: Start difference. First operand 444 states and 712 transitions. Second operand 15 states. [2018-06-25 10:13:55,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:55,542 INFO ]: Finished difference Result 577 states and 1008 transitions. [2018-06-25 10:13:55,543 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 10:13:55,543 INFO ]: Start accepts. Automaton has 15 states. Word has length 36 [2018-06-25 10:13:55,543 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:55,547 INFO ]: With dead ends: 577 [2018-06-25 10:13:55,547 INFO ]: Without dead ends: 577 [2018-06-25 10:13:55,547 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2018-06-25 10:13:55,548 INFO ]: Start minimizeSevpa. Operand 577 states. [2018-06-25 10:13:55,562 INFO ]: Finished minimizeSevpa. Reduced states from 577 to 485. [2018-06-25 10:13:55,562 INFO ]: Start removeUnreachable. Operand 485 states. [2018-06-25 10:13:55,565 INFO ]: Finished removeUnreachable. Reduced from 485 states to 485 states and 825 transitions. [2018-06-25 10:13:55,565 INFO ]: Start accepts. Automaton has 485 states and 825 transitions. Word has length 36 [2018-06-25 10:13:55,565 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:55,565 INFO ]: Abstraction has 485 states and 825 transitions. [2018-06-25 10:13:55,565 INFO ]: Interpolant automaton has 15 states. [2018-06-25 10:13:55,565 INFO ]: Start isEmpty. Operand 485 states and 825 transitions. [2018-06-25 10:13:55,569 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 10:13:55,569 INFO ]: Found error trace [2018-06-25 10:13:55,569 INFO ]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:55,569 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:55,569 INFO ]: Analyzing trace with hash 1575011181, now seen corresponding path program 3 times [2018-06-25 10:13:55,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:55,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:55,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:55,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:55,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:55,582 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:55,691 INFO ]: Checked inductivity of 37 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 10:13:55,691 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:55,691 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 10:13:55,701 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 10:13:55,725 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-25 10:13:55,725 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:55,727 INFO ]: Computing forward predicates... [2018-06-25 10:13:55,769 INFO ]: Checked inductivity of 37 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-25 10:13:55,788 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:55,788 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-25 10:13:55,788 INFO ]: Interpolant automaton has 11 states [2018-06-25 10:13:55,788 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 10:13:55,789 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-25 10:13:55,789 INFO ]: Start difference. First operand 485 states and 825 transitions. Second operand 11 states. [2018-06-25 10:13:56,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:56,055 INFO ]: Finished difference Result 711 states and 1240 transitions. [2018-06-25 10:13:56,056 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 10:13:56,056 INFO ]: Start accepts. Automaton has 11 states. Word has length 37 [2018-06-25 10:13:56,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:56,061 INFO ]: With dead ends: 711 [2018-06-25 10:13:56,061 INFO ]: Without dead ends: 711 [2018-06-25 10:13:56,061 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2018-06-25 10:13:56,061 INFO ]: Start minimizeSevpa. Operand 711 states. [2018-06-25 10:13:56,080 INFO ]: Finished minimizeSevpa. Reduced states from 711 to 465. [2018-06-25 10:13:56,080 INFO ]: Start removeUnreachable. Operand 465 states. [2018-06-25 10:13:56,083 INFO ]: Finished removeUnreachable. Reduced from 465 states to 465 states and 765 transitions. [2018-06-25 10:13:56,083 INFO ]: Start accepts. Automaton has 465 states and 765 transitions. Word has length 37 [2018-06-25 10:13:56,083 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:56,083 INFO ]: Abstraction has 465 states and 765 transitions. [2018-06-25 10:13:56,083 INFO ]: Interpolant automaton has 11 states. [2018-06-25 10:13:56,083 INFO ]: Start isEmpty. Operand 465 states and 765 transitions. [2018-06-25 10:13:56,088 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 10:13:56,088 INFO ]: Found error trace [2018-06-25 10:13:56,088 INFO ]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:56,088 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:56,088 INFO ]: Analyzing trace with hash -1223539441, now seen corresponding path program 2 times [2018-06-25 10:13:56,088 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:56,088 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:56,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:56,089 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 10:13:56,089 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:56,099 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:56,312 INFO ]: Checked inductivity of 40 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 10:13:56,312 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:56,312 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 10:13:56,317 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 10:13:56,346 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 10:13:56,346 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:56,349 INFO ]: Computing forward predicates... [2018-06-25 10:13:56,481 INFO ]: Checked inductivity of 40 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 10:13:56,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:56,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2018-06-25 10:13:56,501 INFO ]: Interpolant automaton has 17 states [2018-06-25 10:13:56,501 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 10:13:56,501 INFO ]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-06-25 10:13:56,501 INFO ]: Start difference. First operand 465 states and 765 transitions. Second operand 17 states. [2018-06-25 10:13:57,029 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-25 10:13:58,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:58,636 INFO ]: Finished difference Result 550 states and 967 transitions. [2018-06-25 10:13:58,636 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 10:13:58,636 INFO ]: Start accepts. Automaton has 17 states. Word has length 38 [2018-06-25 10:13:58,636 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:58,640 INFO ]: With dead ends: 550 [2018-06-25 10:13:58,640 INFO ]: Without dead ends: 550 [2018-06-25 10:13:58,641 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=418, Invalid=1744, Unknown=0, NotChecked=0, Total=2162 [2018-06-25 10:13:58,641 INFO ]: Start minimizeSevpa. Operand 550 states. [2018-06-25 10:13:58,657 INFO ]: Finished minimizeSevpa. Reduced states from 550 to 466. [2018-06-25 10:13:58,657 INFO ]: Start removeUnreachable. Operand 466 states. [2018-06-25 10:13:58,660 INFO ]: Finished removeUnreachable. Reduced from 466 states to 466 states and 749 transitions. [2018-06-25 10:13:58,660 INFO ]: Start accepts. Automaton has 466 states and 749 transitions. Word has length 38 [2018-06-25 10:13:58,660 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:58,660 INFO ]: Abstraction has 466 states and 749 transitions. [2018-06-25 10:13:58,660 INFO ]: Interpolant automaton has 17 states. [2018-06-25 10:13:58,660 INFO ]: Start isEmpty. Operand 466 states and 749 transitions. [2018-06-25 10:13:58,665 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 10:13:58,665 INFO ]: Found error trace [2018-06-25 10:13:58,665 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:58,665 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:58,665 INFO ]: Analyzing trace with hash 1678649083, now seen corresponding path program 1 times [2018-06-25 10:13:58,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:58,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:58,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:58,665 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 10:13:58,665 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:58,672 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:58,759 INFO ]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 10:13:58,759 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:13:58,759 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:13:58,759 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:58,759 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:58,759 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:58,759 INFO ]: Start difference. First operand 466 states and 749 transitions. Second operand 4 states. [2018-06-25 10:13:58,846 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:58,847 INFO ]: Finished difference Result 563 states and 885 transitions. [2018-06-25 10:13:58,847 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:13:58,847 INFO ]: Start accepts. Automaton has 4 states. Word has length 39 [2018-06-25 10:13:58,847 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:58,849 INFO ]: With dead ends: 563 [2018-06-25 10:13:58,849 INFO ]: Without dead ends: 426 [2018-06-25 10:13:58,850 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:58,850 INFO ]: Start minimizeSevpa. Operand 426 states. [2018-06-25 10:13:58,857 INFO ]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-06-25 10:13:58,857 INFO ]: Start removeUnreachable. Operand 426 states. [2018-06-25 10:13:58,859 INFO ]: Finished removeUnreachable. Reduced from 426 states to 426 states and 659 transitions. [2018-06-25 10:13:58,859 INFO ]: Start accepts. Automaton has 426 states and 659 transitions. Word has length 39 [2018-06-25 10:13:58,859 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:58,859 INFO ]: Abstraction has 426 states and 659 transitions. [2018-06-25 10:13:58,859 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:58,859 INFO ]: Start isEmpty. Operand 426 states and 659 transitions. [2018-06-25 10:13:58,863 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 10:13:58,863 INFO ]: Found error trace [2018-06-25 10:13:58,863 INFO ]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:58,863 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:58,863 INFO ]: Analyzing trace with hash -547792481, now seen corresponding path program 3 times [2018-06-25 10:13:58,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:58,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:58,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:58,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:58,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:58,883 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:58,965 INFO ]: Checked inductivity of 52 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-25 10:13:58,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:58,966 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 10:13:58,972 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 10:13:59,001 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 10:13:59,001 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:59,004 INFO ]: Computing forward predicates... [2018-06-25 10:13:59,056 INFO ]: Checked inductivity of 52 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-25 10:13:59,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:59,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-06-25 10:13:59,076 INFO ]: Interpolant automaton has 15 states [2018-06-25 10:13:59,076 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 10:13:59,076 INFO ]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-06-25 10:13:59,076 INFO ]: Start difference. First operand 426 states and 659 transitions. Second operand 15 states. [2018-06-25 10:13:59,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:59,743 INFO ]: Finished difference Result 620 states and 1046 transitions. [2018-06-25 10:13:59,744 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 10:13:59,744 INFO ]: Start accepts. Automaton has 15 states. Word has length 40 [2018-06-25 10:13:59,744 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:59,749 INFO ]: With dead ends: 620 [2018-06-25 10:13:59,749 INFO ]: Without dead ends: 620 [2018-06-25 10:13:59,751 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 10:13:59,752 INFO ]: Start minimizeSevpa. Operand 620 states. [2018-06-25 10:13:59,768 INFO ]: Finished minimizeSevpa. Reduced states from 620 to 445. [2018-06-25 10:13:59,768 INFO ]: Start removeUnreachable. Operand 445 states. [2018-06-25 10:13:59,770 INFO ]: Finished removeUnreachable. Reduced from 445 states to 445 states and 683 transitions. [2018-06-25 10:13:59,770 INFO ]: Start accepts. Automaton has 445 states and 683 transitions. Word has length 40 [2018-06-25 10:13:59,770 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:59,770 INFO ]: Abstraction has 445 states and 683 transitions. [2018-06-25 10:13:59,770 INFO ]: Interpolant automaton has 15 states. [2018-06-25 10:13:59,770 INFO ]: Start isEmpty. Operand 445 states and 683 transitions. [2018-06-25 10:13:59,771 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 10:13:59,771 INFO ]: Found error trace [2018-06-25 10:13:59,771 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:59,772 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:59,772 INFO ]: Analyzing trace with hash 359025808, now seen corresponding path program 1 times [2018-06-25 10:13:59,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:59,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:59,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:59,772 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 10:13:59,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:59,783 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:59,842 INFO ]: Checked inductivity of 25 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 10:13:59,842 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:13:59,842 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 10:13:59,848 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:59,868 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:13:59,870 INFO ]: Computing forward predicates... [2018-06-25 10:13:59,875 INFO ]: Checked inductivity of 25 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 10:13:59,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:13:59,894 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 10:13:59,895 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:13:59,895 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:13:59,895 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:13:59,895 INFO ]: Start difference. First operand 445 states and 683 transitions. Second operand 4 states. [2018-06-25 10:13:59,970 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:13:59,970 INFO ]: Finished difference Result 466 states and 712 transitions. [2018-06-25 10:13:59,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:13:59,970 INFO ]: Start accepts. Automaton has 4 states. Word has length 41 [2018-06-25 10:13:59,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:13:59,972 INFO ]: With dead ends: 466 [2018-06-25 10:13:59,972 INFO ]: Without dead ends: 437 [2018-06-25 10:13:59,973 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:13:59,973 INFO ]: Start minimizeSevpa. Operand 437 states. [2018-06-25 10:13:59,981 INFO ]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-06-25 10:13:59,981 INFO ]: Start removeUnreachable. Operand 437 states. [2018-06-25 10:13:59,983 INFO ]: Finished removeUnreachable. Reduced from 437 states to 437 states and 660 transitions. [2018-06-25 10:13:59,983 INFO ]: Start accepts. Automaton has 437 states and 660 transitions. Word has length 41 [2018-06-25 10:13:59,983 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:13:59,983 INFO ]: Abstraction has 437 states and 660 transitions. [2018-06-25 10:13:59,983 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:13:59,983 INFO ]: Start isEmpty. Operand 437 states and 660 transitions. [2018-06-25 10:13:59,986 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-25 10:13:59,986 INFO ]: Found error trace [2018-06-25 10:13:59,986 INFO ]: trace histogram [6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:13:59,986 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:13:59,986 INFO ]: Analyzing trace with hash 814868756, now seen corresponding path program 1 times [2018-06-25 10:13:59,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:13:59,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:13:59,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:59,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:13:59,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:13:59,995 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:14:00,083 INFO ]: Checked inductivity of 64 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-25 10:14:00,083 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:14:00,083 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 10:14:00,083 INFO ]: Interpolant automaton has 4 states [2018-06-25 10:14:00,083 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 10:14:00,083 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 10:14:00,083 INFO ]: Start difference. First operand 437 states and 660 transitions. Second operand 4 states. [2018-06-25 10:14:00,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:14:00,198 INFO ]: Finished difference Result 475 states and 714 transitions. [2018-06-25 10:14:00,199 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 10:14:00,199 INFO ]: Start accepts. Automaton has 4 states. Word has length 51 [2018-06-25 10:14:00,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:14:00,202 INFO ]: With dead ends: 475 [2018-06-25 10:14:00,202 INFO ]: Without dead ends: 407 [2018-06-25 10:14:00,202 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:14:00,202 INFO ]: Start minimizeSevpa. Operand 407 states. [2018-06-25 10:14:00,210 INFO ]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-06-25 10:14:00,210 INFO ]: Start removeUnreachable. Operand 407 states. [2018-06-25 10:14:00,212 INFO ]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2018-06-25 10:14:00,212 INFO ]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 51 [2018-06-25 10:14:00,212 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:14:00,212 INFO ]: Abstraction has 407 states and 592 transitions. [2018-06-25 10:14:00,212 INFO ]: Interpolant automaton has 4 states. [2018-06-25 10:14:00,212 INFO ]: Start isEmpty. Operand 407 states and 592 transitions. [2018-06-25 10:14:00,215 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-25 10:14:00,215 INFO ]: Found error trace [2018-06-25 10:14:00,215 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:14:00,215 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:14:00,215 INFO ]: Analyzing trace with hash 1257069916, now seen corresponding path program 1 times [2018-06-25 10:14:00,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:14:00,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:14:00,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:14:00,216 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:14:00,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:14:00,223 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:14:00,430 INFO ]: Checked inductivity of 57 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-25 10:14:00,430 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:14:00,430 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 10:14:00,431 INFO ]: Interpolant automaton has 5 states [2018-06-25 10:14:00,431 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 10:14:00,431 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 10:14:00,431 INFO ]: Start difference. First operand 407 states and 592 transitions. Second operand 5 states. [2018-06-25 10:14:00,499 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:14:00,499 INFO ]: Finished difference Result 486 states and 748 transitions. [2018-06-25 10:14:00,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 10:14:00,500 INFO ]: Start accepts. Automaton has 5 states. Word has length 57 [2018-06-25 10:14:00,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:14:00,503 INFO ]: With dead ends: 486 [2018-06-25 10:14:00,503 INFO ]: Without dead ends: 486 [2018-06-25 10:14:00,504 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 10:14:00,510 INFO ]: Start minimizeSevpa. Operand 486 states. [2018-06-25 10:14:00,519 INFO ]: Finished minimizeSevpa. Reduced states from 486 to 407. [2018-06-25 10:14:00,519 INFO ]: Start removeUnreachable. Operand 407 states. [2018-06-25 10:14:00,521 INFO ]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2018-06-25 10:14:00,521 INFO ]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 57 [2018-06-25 10:14:00,521 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:14:00,521 INFO ]: Abstraction has 407 states and 592 transitions. [2018-06-25 10:14:00,521 INFO ]: Interpolant automaton has 5 states. [2018-06-25 10:14:00,522 INFO ]: Start isEmpty. Operand 407 states and 592 transitions. [2018-06-25 10:14:00,524 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-25 10:14:00,524 INFO ]: Found error trace [2018-06-25 10:14:00,524 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:14:00,524 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:14:00,524 INFO ]: Analyzing trace with hash -312454278, now seen corresponding path program 2 times [2018-06-25 10:14:00,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:14:00,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:14:00,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:14:00,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 10:14:00,526 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:14:00,540 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:14:00,882 INFO ]: Checked inductivity of 62 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-25 10:14:00,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:14:00,882 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) [2018-06-25 10:14:00,893 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 10:14:00,943 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 10:14:00,944 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:14:00,946 INFO ]: Computing forward predicates... [2018-06-25 10:14:00,953 INFO ]: Checked inductivity of 62 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-25 10:14:00,974 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:14:00,974 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 10:14:00,974 INFO ]: Interpolant automaton has 6 states [2018-06-25 10:14:00,974 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 10:14:00,974 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 10:14:00,974 INFO ]: Start difference. First operand 407 states and 592 transitions. Second operand 6 states. [2018-06-25 10:14:01,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:14:01,026 INFO ]: Finished difference Result 434 states and 630 transitions. [2018-06-25 10:14:01,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 10:14:01,026 INFO ]: Start accepts. Automaton has 6 states. Word has length 58 [2018-06-25 10:14:01,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:14:01,028 INFO ]: With dead ends: 434 [2018-06-25 10:14:01,028 INFO ]: Without dead ends: 434 [2018-06-25 10:14:01,028 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 10:14:01,028 INFO ]: Start minimizeSevpa. Operand 434 states. [2018-06-25 10:14:01,034 INFO ]: Finished minimizeSevpa. Reduced states from 434 to 427. [2018-06-25 10:14:01,034 INFO ]: Start removeUnreachable. Operand 427 states. [2018-06-25 10:14:01,036 INFO ]: Finished removeUnreachable. Reduced from 427 states to 427 states and 623 transitions. [2018-06-25 10:14:01,036 INFO ]: Start accepts. Automaton has 427 states and 623 transitions. Word has length 58 [2018-06-25 10:14:01,037 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:14:01,037 INFO ]: Abstraction has 427 states and 623 transitions. [2018-06-25 10:14:01,037 INFO ]: Interpolant automaton has 6 states. [2018-06-25 10:14:01,037 INFO ]: Start isEmpty. Operand 427 states and 623 transitions. [2018-06-25 10:14:01,039 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-25 10:14:01,040 INFO ]: Found error trace [2018-06-25 10:14:01,040 INFO ]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:14:01,040 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:14:01,040 INFO ]: Analyzing trace with hash -1099099044, now seen corresponding path program 3 times [2018-06-25 10:14:01,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:14:01,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:14:01,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:14:01,040 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 10:14:01,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:14:01,058 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:14:01,567 INFO ]: Checked inductivity of 68 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-25 10:14:01,568 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 10:14:01,568 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 10:14:01,573 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 10:14:01,607 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 10:14:01,607 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:14:01,609 INFO ]: Computing forward predicates... [2018-06-25 10:14:01,776 INFO ]: Checked inductivity of 68 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-25 10:14:01,795 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 10:14:01,795 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-06-25 10:14:01,796 INFO ]: Interpolant automaton has 18 states [2018-06-25 10:14:01,796 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 10:14:01,796 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-25 10:14:01,796 INFO ]: Start difference. First operand 427 states and 623 transitions. Second operand 18 states. [2018-06-25 10:14:04,129 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:14:04,129 INFO ]: Finished difference Result 656 states and 989 transitions. [2018-06-25 10:14:04,129 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-25 10:14:04,129 INFO ]: Start accepts. Automaton has 18 states. Word has length 59 [2018-06-25 10:14:04,129 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:14:04,131 INFO ]: With dead ends: 656 [2018-06-25 10:14:04,132 INFO ]: Without dead ends: 567 [2018-06-25 10:14:04,132 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=717, Invalid=3705, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 10:14:04,133 INFO ]: Start minimizeSevpa. Operand 567 states. [2018-06-25 10:14:04,142 INFO ]: Finished minimizeSevpa. Reduced states from 567 to 478. [2018-06-25 10:14:04,142 INFO ]: Start removeUnreachable. Operand 478 states. [2018-06-25 10:14:04,143 INFO ]: Finished removeUnreachable. Reduced from 478 states to 478 states and 696 transitions. [2018-06-25 10:14:04,143 INFO ]: Start accepts. Automaton has 478 states and 696 transitions. Word has length 59 [2018-06-25 10:14:04,143 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:14:04,143 INFO ]: Abstraction has 478 states and 696 transitions. [2018-06-25 10:14:04,143 INFO ]: Interpolant automaton has 18 states. [2018-06-25 10:14:04,144 INFO ]: Start isEmpty. Operand 478 states and 696 transitions. [2018-06-25 10:14:04,151 INFO ]: Finished isEmpty. Found accepting run of length 76 [2018-06-25 10:14:04,151 INFO ]: Found error trace [2018-06-25 10:14:04,151 INFO ]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 10:14:04,151 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 10:14:04,151 INFO ]: Analyzing trace with hash 729756124, now seen corresponding path program 1 times [2018-06-25 10:14:04,151 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 10:14:04,151 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 10:14:04,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:14:04,152 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 10:14:04,152 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 10:14:04,167 INFO ]: Conjunction of SSA is unsat [2018-06-25 10:14:04,223 INFO ]: Checked inductivity of 132 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-06-25 10:14:04,223 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 10:14:04,223 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 10:14:04,223 INFO ]: Interpolant automaton has 6 states [2018-06-25 10:14:04,223 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 10:14:04,223 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 10:14:04,223 INFO ]: Start difference. First operand 478 states and 696 transitions. Second operand 6 states. [2018-06-25 10:14:04,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 10:14:04,272 INFO ]: Finished difference Result 244 states and 333 transitions. [2018-06-25 10:14:04,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 10:14:04,273 INFO ]: Start accepts. Automaton has 6 states. Word has length 75 [2018-06-25 10:14:04,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 10:14:04,273 INFO ]: With dead ends: 244 [2018-06-25 10:14:04,273 INFO ]: Without dead ends: 0 [2018-06-25 10:14:04,273 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 10:14:04,273 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 10:14:04,273 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 10:14:04,273 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 10:14:04,273 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 10:14:04,273 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2018-06-25 10:14:04,273 INFO ]: Finished accepts. word is rejected. [2018-06-25 10:14:04,273 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 10:14:04,273 INFO ]: Interpolant automaton has 6 states. [2018-06-25 10:14:04,273 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 10:14:04,273 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 10:14:04,279 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 10:14:04 BoogieIcfgContainer [2018-06-25 10:14:04,279 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 10:14:04,280 INFO ]: Toolchain (without parser) took 28008.07 ms. Allocated memory was 309.3 MB in the beginning and 507.5 MB in the end (delta: 198.2 MB). Free memory was 260.7 MB in the beginning and 434.9 MB in the end (delta: -174.2 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. [2018-06-25 10:14:04,281 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 10:14:04,281 INFO ]: ChcToBoogie took 80.38 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-25 10:14:04,281 INFO ]: Boogie Preprocessor took 61.12 ms. Allocated memory is still 309.3 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 10:14:04,282 INFO ]: RCFGBuilder took 749.90 ms. Allocated memory is still 309.3 MB. Free memory was 256.6 MB in the beginning and 233.7 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 3.6 GB. [2018-06-25 10:14:04,282 INFO ]: TraceAbstraction took 27103.39 ms. Allocated memory was 309.3 MB in the beginning and 507.5 MB in the end (delta: 198.2 MB). Free memory was 232.7 MB in the beginning and 434.9 MB in the end (delta: -202.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 10:14:04,284 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 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 80.38 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 61.12 ms. Allocated memory is still 309.3 MB. Free memory was 258.6 MB in the beginning and 256.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 749.90 ms. Allocated memory is still 309.3 MB. Free memory was 256.6 MB in the beginning and 233.7 MB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 27103.39 ms. Allocated memory was 309.3 MB in the beginning and 507.5 MB in the end (delta: 198.2 MB). Free memory was 232.7 MB in the beginning and 434.9 MB in the end (delta: -202.2 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. SAFE Result, 27.0s OverallTime, 35 OverallIterations, 6 TraceHistogramMax, 17.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2848 SDtfs, 2657 SDslu, 10803 SDs, 0 SdLazy, 7316 SolverSat, 1357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 995 GetRequests, 535 SyntacticMatches, 5 SemanticMatches, 455 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2888 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred in iteration=25, 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.6s AutomataMinimizationTime, 35 MinimizatonAttempts, 1514 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1619 NumberOfCodeBlocks, 1608 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1570 ConstructedInterpolants, 0 QuantifiedInterpolants, 120049 SizeOfPredicates, 75 NumberOfNonLiveVariables, 3303 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 49 InterpolantComputations, 23 PerfectInterpolantSequences, 1141/1224 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__rec_while.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_10-14-04-295.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__rec_while.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_10-14-04-295.csv Received shutdown request...