java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_4.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:01:42,163 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:01:42,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:01:42,178 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:01:42,178 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:01:42,179 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:01:42,181 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:01:42,185 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:01:42,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:01:42,189 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:01:42,190 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:01:42,190 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:01:42,191 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:01:42,194 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:01:42,195 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:01:42,196 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:01:42,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:01:42,201 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:01:42,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:01:42,204 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:01:42,205 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:01:42,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:01:42,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:01:42,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:01:42,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:01:42,210 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:01:42,211 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:01:42,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:01:42,213 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:01:42,213 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:01:42,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:01:42,214 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:01:42,215 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:01:42,215 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:01:42,216 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:01:42,216 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:01:42,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:01:42,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:01:42,239 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:01:42,239 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:01:42,240 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:01:42,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:01:42,241 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:01:42,241 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:01:42,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:01:42,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:01:42,241 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:01:42,242 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:01:42,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:01:42,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:01:42,242 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:01:42,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:01:42,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:01:42,243 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:01:42,243 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:01:42,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:01:42,243 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:01:42,245 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:01:42,246 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:01:42,304 INFO ]: Repository-Root is: /tmp [2018-06-25 00:01:42,324 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:01:42,331 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:01:42,332 INFO ]: Initializing SmtParser... [2018-06-25 00:01:42,333 INFO ]: SmtParser initialized [2018-06-25 00:01:42,334 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_4.cil.smt2 [2018-06-25 00:01:42,335 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 00:01:42,432 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_4.cil.smt2 unknown [2018-06-25 00:01:42,917 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_4.cil.smt2 [2018-06-25 00:01:42,922 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:01:42,929 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:01:42,930 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:01:42,930 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:01:42,930 INFO ]: ChcToBoogie initialized [2018-06-25 00:01:42,933 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:01:42" (1/1) ... [2018-06-25 00:01:43,018 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43 Unit [2018-06-25 00:01:43,018 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:01:43,019 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:01:43,019 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:01:43,019 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:01:43,043 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43" (1/1) ... [2018-06-25 00:01:43,043 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43" (1/1) ... [2018-06-25 00:01:43,055 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43" (1/1) ... [2018-06-25 00:01:43,055 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43" (1/1) ... [2018-06-25 00:01:43,068 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43" (1/1) ... [2018-06-25 00:01:43,070 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43" (1/1) ... [2018-06-25 00:01:43,074 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43" (1/1) ... [2018-06-25 00:01:43,079 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:01:43,080 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:01:43,080 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:01:43,080 INFO ]: RCFGBuilder initialized [2018-06-25 00:01:43,081 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43" (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 00:01:43,097 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:01:43,097 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:01:43,097 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:01:43,097 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:01:43,097 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:01:43,097 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 00:01:43,439 INFO ]: Using library mode [2018-06-25 00:01:43,439 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:01:43 BoogieIcfgContainer [2018-06-25 00:01:43,439 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:01:43,440 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:01:43,440 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:01:43,441 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:01:43,441 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:01:43" (1/1) ... [2018-06-25 00:01:43,460 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:01:43,462 INFO ]: Using Remove infeasible edges [2018-06-25 00:01:43,462 INFO ]: Using Maximize final states [2018-06-25 00:01:43,462 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:01:43,463 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:01:43,464 INFO ]: Using Remove sink states [2018-06-25 00:01:43,465 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:01:43,465 INFO ]: Using Use SBE [2018-06-25 00:01:49,563 INFO ]: SBE split 1 edges [2018-06-25 00:01:49,609 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:01:49,611 INFO ]: 0 new accepting states [2018-06-25 00:01:49,670 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:01:49,672 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:01:49,716 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:01:49,717 INFO ]: 0 new accepting states [2018-06-25 00:01:49,717 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:01:49,717 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:01:49,772 INFO ]: Encoded RCFG 6 locations, 524 edges [2018-06-25 00:01:49,773 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:01:49 BasicIcfg [2018-06-25 00:01:49,773 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:01:49,775 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:01:49,775 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:01:49,781 INFO ]: TraceAbstraction initialized [2018-06-25 00:01:49,781 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:01:42" (1/4) ... [2018-06-25 00:01:49,783 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed34da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:01:49, skipping insertion in model container [2018-06-25 00:01:49,783 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:43" (2/4) ... [2018-06-25 00:01:49,783 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed34da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:01:49, skipping insertion in model container [2018-06-25 00:01:49,783 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:01:43" (3/4) ... [2018-06-25 00:01:49,783 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed34da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:01:49, skipping insertion in model container [2018-06-25 00:01:49,784 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:01:49" (4/4) ... [2018-06-25 00:01:49,785 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:01:49,798 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:01:49,808 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:01:49,853 INFO ]: Using default assertion order modulation [2018-06-25 00:01:49,853 INFO ]: Interprodecural is true [2018-06-25 00:01:49,853 INFO ]: Hoare is false [2018-06-25 00:01:49,853 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:01:49,853 INFO ]: Backedges is TWOTRACK [2018-06-25 00:01:49,853 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:01:49,853 INFO ]: Difference is false [2018-06-25 00:01:49,853 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:01:49,853 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:01:49,866 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:01:49,881 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:01:49,881 INFO ]: Found error trace [2018-06-25 00:01:49,882 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:01:49,882 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:49,887 INFO ]: Analyzing trace with hash 51362850, now seen corresponding path program 1 times [2018-06-25 00:01:49,889 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:49,889 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:49,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:49,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:49,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:49,985 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:50,121 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:01:50,124 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:50,125 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:50,126 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:50,142 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:50,142 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:50,145 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:01:54,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:54,528 INFO ]: Finished difference Result 7 states and 394 transitions. [2018-06-25 00:01:54,531 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:54,532 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:01:54,532 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:54,543 INFO ]: With dead ends: 7 [2018-06-25 00:01:54,543 INFO ]: Without dead ends: 7 [2018-06-25 00:01:54,544 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:54,570 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:01:54,592 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:01:54,594 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:01:54,595 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-25 00:01:54,596 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 5 [2018-06-25 00:01:54,596 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:54,596 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-25 00:01:54,596 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:54,596 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-25 00:01:54,597 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:01:54,597 INFO ]: Found error trace [2018-06-25 00:01:54,597 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:01:54,597 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:54,597 INFO ]: Analyzing trace with hash 1584377919, now seen corresponding path program 1 times [2018-06-25 00:01:54,597 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:54,597 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:54,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:54,598 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:54,598 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:54,626 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:54,697 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:01:54,698 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:54,698 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:54,699 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:54,700 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:54,700 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:54,700 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-25 00:01:57,310 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:57,310 INFO ]: Finished difference Result 8 states and 396 transitions. [2018-06-25 00:01:57,311 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:57,311 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:01:57,311 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:57,312 INFO ]: With dead ends: 8 [2018-06-25 00:01:57,312 INFO ]: Without dead ends: 8 [2018-06-25 00:01:57,313 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:57,313 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 00:01:57,326 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 00:01:57,326 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 00:01:57,327 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 396 transitions. [2018-06-25 00:01:57,327 INFO ]: Start accepts. Automaton has 8 states and 396 transitions. Word has length 6 [2018-06-25 00:01:57,327 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:57,327 INFO ]: Abstraction has 8 states and 396 transitions. [2018-06-25 00:01:57,327 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:57,327 INFO ]: Start isEmpty. Operand 8 states and 396 transitions. [2018-06-25 00:01:57,334 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:01:57,334 INFO ]: Found error trace [2018-06-25 00:01:57,335 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:57,335 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:57,335 INFO ]: Analyzing trace with hash 1856293290, now seen corresponding path program 1 times [2018-06-25 00:01:57,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:57,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:57,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:57,336 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:57,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:57,377 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:57,472 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:01:57,472 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:57,472 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:57,472 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:57,473 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:57,473 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:57,473 INFO ]: Start difference. First operand 8 states and 396 transitions. Second operand 3 states. [2018-06-25 00:01:59,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:01:59,544 INFO ]: Finished difference Result 9 states and 779 transitions. [2018-06-25 00:01:59,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:01:59,545 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 00:01:59,545 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:01:59,546 INFO ]: With dead ends: 9 [2018-06-25 00:01:59,546 INFO ]: Without dead ends: 9 [2018-06-25 00:01:59,546 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:59,546 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:01:59,551 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:01:59,551 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:01:59,552 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 779 transitions. [2018-06-25 00:01:59,552 INFO ]: Start accepts. Automaton has 9 states and 779 transitions. Word has length 7 [2018-06-25 00:01:59,553 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:01:59,553 INFO ]: Abstraction has 9 states and 779 transitions. [2018-06-25 00:01:59,553 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:01:59,553 INFO ]: Start isEmpty. Operand 9 states and 779 transitions. [2018-06-25 00:01:59,554 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:01:59,554 INFO ]: Found error trace [2018-06-25 00:01:59,554 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:01:59,554 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:01:59,554 INFO ]: Analyzing trace with hash 1703451068, now seen corresponding path program 1 times [2018-06-25 00:01:59,554 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:01:59,554 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:01:59,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:59,555 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:01:59,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:01:59,596 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:01:59,664 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:01:59,664 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:01:59,664 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:01:59,664 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:01:59,664 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:01:59,664 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:01:59,665 INFO ]: Start difference. First operand 9 states and 779 transitions. Second operand 3 states. [2018-06-25 00:02:01,857 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:01,857 INFO ]: Finished difference Result 10 states and 1159 transitions. [2018-06-25 00:02:01,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:01,857 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:02:01,857 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:01,859 INFO ]: With dead ends: 10 [2018-06-25 00:02:01,859 INFO ]: Without dead ends: 10 [2018-06-25 00:02:01,859 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:01,859 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 00:02:01,863 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 00:02:01,863 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:02:01,865 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1159 transitions. [2018-06-25 00:02:01,866 INFO ]: Start accepts. Automaton has 10 states and 1159 transitions. Word has length 8 [2018-06-25 00:02:01,866 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:01,866 INFO ]: Abstraction has 10 states and 1159 transitions. [2018-06-25 00:02:01,866 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:01,866 INFO ]: Start isEmpty. Operand 10 states and 1159 transitions. [2018-06-25 00:02:01,866 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:02:01,866 INFO ]: Found error trace [2018-06-25 00:02:01,866 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:01,867 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:01,867 INFO ]: Analyzing trace with hash 1049746694, now seen corresponding path program 1 times [2018-06-25 00:02:01,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:01,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:01,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:01,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:01,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:01,903 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:01,959 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:02:01,959 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:01,959 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:01,959 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:01,959 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:01,959 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:01,960 INFO ]: Start difference. First operand 10 states and 1159 transitions. Second operand 3 states. [2018-06-25 00:02:03,781 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:03,781 INFO ]: Finished difference Result 11 states and 1419 transitions. [2018-06-25 00:02:03,782 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:03,782 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:02:03,782 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:03,784 INFO ]: With dead ends: 11 [2018-06-25 00:02:03,784 INFO ]: Without dead ends: 11 [2018-06-25 00:02:03,785 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:03,785 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:02:03,793 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:02:03,793 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:02:03,797 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1419 transitions. [2018-06-25 00:02:03,797 INFO ]: Start accepts. Automaton has 11 states and 1419 transitions. Word has length 9 [2018-06-25 00:02:03,797 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:03,797 INFO ]: Abstraction has 11 states and 1419 transitions. [2018-06-25 00:02:03,797 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:03,797 INFO ]: Start isEmpty. Operand 11 states and 1419 transitions. [2018-06-25 00:02:03,798 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:02:03,798 INFO ]: Found error trace [2018-06-25 00:02:03,798 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:03,798 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:03,798 INFO ]: Analyzing trace with hash 1257727295, now seen corresponding path program 1 times [2018-06-25 00:02:03,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:03,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:03,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:03,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:03,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:03,845 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:03,910 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:02:03,910 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:03,910 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:03,910 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:03,910 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:03,910 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:03,910 INFO ]: Start difference. First operand 11 states and 1419 transitions. Second operand 3 states. [2018-06-25 00:02:05,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:05,992 INFO ]: Finished difference Result 12 states and 1667 transitions. [2018-06-25 00:02:05,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:05,992 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:02:05,992 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:05,994 INFO ]: With dead ends: 12 [2018-06-25 00:02:05,994 INFO ]: Without dead ends: 12 [2018-06-25 00:02:05,994 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:05,995 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:02:06,001 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 00:02:06,001 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:02:06,003 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1667 transitions. [2018-06-25 00:02:06,003 INFO ]: Start accepts. Automaton has 12 states and 1667 transitions. Word has length 10 [2018-06-25 00:02:06,004 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:06,004 INFO ]: Abstraction has 12 states and 1667 transitions. [2018-06-25 00:02:06,004 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:06,005 INFO ]: Start isEmpty. Operand 12 states and 1667 transitions. [2018-06-25 00:02:06,006 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:02:06,006 INFO ]: Found error trace [2018-06-25 00:02:06,007 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:06,007 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:06,007 INFO ]: Analyzing trace with hash 1777702377, now seen corresponding path program 1 times [2018-06-25 00:02:06,007 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:06,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:06,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:06,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:06,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:06,051 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:06,150 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:02:06,150 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:06,150 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:06,150 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:06,150 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:06,150 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:06,150 INFO ]: Start difference. First operand 12 states and 1667 transitions. Second operand 3 states. [2018-06-25 00:02:07,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:07,904 INFO ]: Finished difference Result 13 states and 1867 transitions. [2018-06-25 00:02:07,904 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:07,904 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:02:07,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:07,907 INFO ]: With dead ends: 13 [2018-06-25 00:02:07,907 INFO ]: Without dead ends: 13 [2018-06-25 00:02:07,908 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:07,908 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:02:07,913 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 00:02:07,914 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:02:07,915 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1867 transitions. [2018-06-25 00:02:07,915 INFO ]: Start accepts. Automaton has 13 states and 1867 transitions. Word has length 11 [2018-06-25 00:02:07,915 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:07,915 INFO ]: Abstraction has 13 states and 1867 transitions. [2018-06-25 00:02:07,915 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:07,915 INFO ]: Start isEmpty. Operand 13 states and 1867 transitions. [2018-06-25 00:02:07,916 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:02:07,916 INFO ]: Found error trace [2018-06-25 00:02:07,917 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:07,917 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:07,917 INFO ]: Analyzing trace with hash 1570757214, now seen corresponding path program 1 times [2018-06-25 00:02:07,917 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:07,917 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:07,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:07,917 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:07,917 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:07,948 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:08,041 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:02:08,041 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:08,041 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:08,042 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:08,042 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:08,042 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:08,042 INFO ]: Start difference. First operand 13 states and 1867 transitions. Second operand 3 states. [2018-06-25 00:02:09,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:09,630 INFO ]: Finished difference Result 14 states and 1563 transitions. [2018-06-25 00:02:09,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:09,630 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:02:09,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:09,632 INFO ]: With dead ends: 14 [2018-06-25 00:02:09,632 INFO ]: Without dead ends: 14 [2018-06-25 00:02:09,632 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:09,632 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:02:09,637 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 00:02:09,637 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 00:02:09,639 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1563 transitions. [2018-06-25 00:02:09,640 INFO ]: Start accepts. Automaton has 14 states and 1563 transitions. Word has length 11 [2018-06-25 00:02:09,640 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:09,640 INFO ]: Abstraction has 14 states and 1563 transitions. [2018-06-25 00:02:09,640 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:09,640 INFO ]: Start isEmpty. Operand 14 states and 1563 transitions. [2018-06-25 00:02:09,641 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:02:09,641 INFO ]: Found error trace [2018-06-25 00:02:09,641 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:09,641 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:09,641 INFO ]: Analyzing trace with hash 1655615236, now seen corresponding path program 1 times [2018-06-25 00:02:09,641 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:09,641 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:09,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:09,642 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:09,642 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:09,688 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:09,792 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 00:02:09,793 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:09,793 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:09,793 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:09,793 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:09,793 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:09,793 INFO ]: Start difference. First operand 14 states and 1563 transitions. Second operand 3 states. [2018-06-25 00:02:11,335 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:11,336 INFO ]: Finished difference Result 15 states and 1343 transitions. [2018-06-25 00:02:11,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:11,336 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:02:11,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:11,337 INFO ]: With dead ends: 15 [2018-06-25 00:02:11,337 INFO ]: Without dead ends: 15 [2018-06-25 00:02:11,337 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:11,338 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:02:11,342 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 00:02:11,342 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:02:11,344 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1343 transitions. [2018-06-25 00:02:11,344 INFO ]: Start accepts. Automaton has 15 states and 1343 transitions. Word has length 12 [2018-06-25 00:02:11,344 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:11,344 INFO ]: Abstraction has 15 states and 1343 transitions. [2018-06-25 00:02:11,344 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:11,344 INFO ]: Start isEmpty. Operand 15 states and 1343 transitions. [2018-06-25 00:02:11,345 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:02:11,345 INFO ]: Found error trace [2018-06-25 00:02:11,345 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:11,345 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:11,345 INFO ]: Analyzing trace with hash 1332457113, now seen corresponding path program 1 times [2018-06-25 00:02:11,345 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:11,345 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:11,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:11,346 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:11,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:11,385 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:11,473 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 00:02:11,474 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:11,474 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:11,474 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:11,474 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:11,474 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:11,474 INFO ]: Start difference. First operand 15 states and 1343 transitions. Second operand 3 states. [2018-06-25 00:02:13,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:13,477 INFO ]: Finished difference Result 16 states and 1379 transitions. [2018-06-25 00:02:13,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:13,477 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:02:13,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:13,478 INFO ]: With dead ends: 16 [2018-06-25 00:02:13,478 INFO ]: Without dead ends: 16 [2018-06-25 00:02:13,479 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:13,479 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 00:02:13,484 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 00:02:13,484 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 00:02:13,485 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1379 transitions. [2018-06-25 00:02:13,485 INFO ]: Start accepts. Automaton has 16 states and 1379 transitions. Word has length 12 [2018-06-25 00:02:13,485 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:13,485 INFO ]: Abstraction has 16 states and 1379 transitions. [2018-06-25 00:02:13,485 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:13,485 INFO ]: Start isEmpty. Operand 16 states and 1379 transitions. [2018-06-25 00:02:13,489 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:13,489 INFO ]: Found error trace [2018-06-25 00:02:13,489 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:13,489 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:13,489 INFO ]: Analyzing trace with hash -1270671417, now seen corresponding path program 1 times [2018-06-25 00:02:13,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:13,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:13,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:13,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:13,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:13,537 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:13,642 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:02:13,642 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:13,642 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:13,642 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:13,642 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:13,642 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:13,643 INFO ]: Start difference. First operand 16 states and 1379 transitions. Second operand 3 states. [2018-06-25 00:02:15,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:15,524 INFO ]: Finished difference Result 24 states and 2028 transitions. [2018-06-25 00:02:15,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:15,525 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:02:15,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:15,528 INFO ]: With dead ends: 24 [2018-06-25 00:02:15,528 INFO ]: Without dead ends: 24 [2018-06-25 00:02:15,528 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:15,529 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 00:02:15,535 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-25 00:02:15,536 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 00:02:15,539 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2028 transitions. [2018-06-25 00:02:15,539 INFO ]: Start accepts. Automaton has 24 states and 2028 transitions. Word has length 13 [2018-06-25 00:02:15,540 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:15,540 INFO ]: Abstraction has 24 states and 2028 transitions. [2018-06-25 00:02:15,540 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:15,540 INFO ]: Start isEmpty. Operand 24 states and 2028 transitions. [2018-06-25 00:02:15,545 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:15,545 INFO ]: Found error trace [2018-06-25 00:02:15,545 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:15,545 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:15,545 INFO ]: Analyzing trace with hash -917787922, now seen corresponding path program 1 times [2018-06-25 00:02:15,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:15,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:15,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:15,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:15,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:15,577 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:15,670 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:02:15,670 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:15,670 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:15,670 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:15,670 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:15,670 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:15,670 INFO ]: Start difference. First operand 24 states and 2028 transitions. Second operand 3 states. [2018-06-25 00:02:17,394 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:17,394 INFO ]: Finished difference Result 26 states and 1968 transitions. [2018-06-25 00:02:17,394 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:17,394 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:02:17,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:17,397 INFO ]: With dead ends: 26 [2018-06-25 00:02:17,397 INFO ]: Without dead ends: 26 [2018-06-25 00:02:17,397 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:17,397 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-25 00:02:17,403 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-25 00:02:17,403 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 00:02:17,404 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1968 transitions. [2018-06-25 00:02:17,405 INFO ]: Start accepts. Automaton has 26 states and 1968 transitions. Word has length 13 [2018-06-25 00:02:17,405 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:17,405 INFO ]: Abstraction has 26 states and 1968 transitions. [2018-06-25 00:02:17,405 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:17,405 INFO ]: Start isEmpty. Operand 26 states and 1968 transitions. [2018-06-25 00:02:17,406 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:17,406 INFO ]: Found error trace [2018-06-25 00:02:17,406 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:17,406 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:17,406 INFO ]: Analyzing trace with hash -1857990785, now seen corresponding path program 1 times [2018-06-25 00:02:17,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:17,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:17,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:17,407 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:17,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:17,437 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:17,548 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:02:17,549 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:17,549 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:17,549 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:17,549 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:17,549 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:17,549 INFO ]: Start difference. First operand 26 states and 1968 transitions. Second operand 3 states. [2018-06-25 00:02:19,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:19,171 INFO ]: Finished difference Result 28 states and 1912 transitions. [2018-06-25 00:02:19,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:19,171 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:02:19,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:19,173 INFO ]: With dead ends: 28 [2018-06-25 00:02:19,173 INFO ]: Without dead ends: 28 [2018-06-25 00:02:19,173 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:19,174 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 00:02:19,178 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-25 00:02:19,178 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 00:02:19,182 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1912 transitions. [2018-06-25 00:02:19,182 INFO ]: Start accepts. Automaton has 28 states and 1912 transitions. Word has length 13 [2018-06-25 00:02:19,182 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:19,182 INFO ]: Abstraction has 28 states and 1912 transitions. [2018-06-25 00:02:19,182 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:19,182 INFO ]: Start isEmpty. Operand 28 states and 1912 transitions. [2018-06-25 00:02:19,183 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:19,183 INFO ]: Found error trace [2018-06-25 00:02:19,183 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:19,183 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:19,183 INFO ]: Analyzing trace with hash -1302049498, now seen corresponding path program 1 times [2018-06-25 00:02:19,183 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:19,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:19,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:19,184 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:19,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:19,222 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:19,344 INFO ]: Checked inductivity of 36 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 00:02:19,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:02:19,345 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 00:02:19,351 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:19,603 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:19,627 INFO ]: Computing forward predicates... [2018-06-25 00:02:19,865 INFO ]: Checked inductivity of 36 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 00:02:19,899 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:02:19,899 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 00:02:19,900 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:02:19,900 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:02:19,900 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:02:19,900 INFO ]: Start difference. First operand 28 states and 1912 transitions. Second operand 6 states. [2018-06-25 00:02:25,595 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:25,595 INFO ]: Finished difference Result 74 states and 5244 transitions. [2018-06-25 00:02:25,595 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:02:25,595 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-25 00:02:25,596 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:25,603 INFO ]: With dead ends: 74 [2018-06-25 00:02:25,603 INFO ]: Without dead ends: 74 [2018-06-25 00:02:25,603 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:02:25,603 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-25 00:02:25,627 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 50. [2018-06-25 00:02:25,627 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-25 00:02:25,631 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 3648 transitions. [2018-06-25 00:02:25,631 INFO ]: Start accepts. Automaton has 50 states and 3648 transitions. Word has length 13 [2018-06-25 00:02:25,631 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:25,631 INFO ]: Abstraction has 50 states and 3648 transitions. [2018-06-25 00:02:25,631 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:02:25,631 INFO ]: Start isEmpty. Operand 50 states and 3648 transitions. [2018-06-25 00:02:25,633 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:25,633 INFO ]: Found error trace [2018-06-25 00:02:25,633 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:25,633 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:25,633 INFO ]: Analyzing trace with hash 1973616142, now seen corresponding path program 1 times [2018-06-25 00:02:25,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:25,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:25,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:25,636 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:25,636 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:25,666 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:25,748 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 00:02:25,748 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:25,748 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:25,748 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:25,748 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:25,748 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:25,748 INFO ]: Start difference. First operand 50 states and 3648 transitions. Second operand 3 states. [2018-06-25 00:02:27,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:27,607 INFO ]: Finished difference Result 92 states and 6452 transitions. [2018-06-25 00:02:27,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:27,612 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:02:27,612 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:27,620 INFO ]: With dead ends: 92 [2018-06-25 00:02:27,620 INFO ]: Without dead ends: 92 [2018-06-25 00:02:27,620 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:27,620 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-25 00:02:27,643 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-06-25 00:02:27,643 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-25 00:02:27,649 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 6012 transitions. [2018-06-25 00:02:27,650 INFO ]: Start accepts. Automaton has 88 states and 6012 transitions. Word has length 13 [2018-06-25 00:02:27,650 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:27,650 INFO ]: Abstraction has 88 states and 6012 transitions. [2018-06-25 00:02:27,650 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:27,650 INFO ]: Start isEmpty. Operand 88 states and 6012 transitions. [2018-06-25 00:02:27,653 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:27,653 INFO ]: Found error trace [2018-06-25 00:02:27,653 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:27,653 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:27,653 INFO ]: Analyzing trace with hash 1128062374, now seen corresponding path program 1 times [2018-06-25 00:02:27,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:27,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:27,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:27,654 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:27,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:27,680 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:27,759 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:02:27,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:27,760 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:27,760 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:27,760 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:27,760 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:27,760 INFO ]: Start difference. First operand 88 states and 6012 transitions. Second operand 3 states. [2018-06-25 00:02:30,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:30,211 INFO ]: Finished difference Result 168 states and 6012 transitions. [2018-06-25 00:02:30,211 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:30,211 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:02:30,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:30,215 INFO ]: With dead ends: 168 [2018-06-25 00:02:30,215 INFO ]: Without dead ends: 88 [2018-06-25 00:02:30,215 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:30,215 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-25 00:02:30,237 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-06-25 00:02:30,237 INFO ]: Start removeUnreachable. Operand 88 states. [2018-06-25 00:02:30,244 INFO ]: Finished removeUnreachable. Reduced from 88 states to 88 states and 4854 transitions. [2018-06-25 00:02:30,244 INFO ]: Start accepts. Automaton has 88 states and 4854 transitions. Word has length 13 [2018-06-25 00:02:30,244 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:30,244 INFO ]: Abstraction has 88 states and 4854 transitions. [2018-06-25 00:02:30,244 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:30,244 INFO ]: Start isEmpty. Operand 88 states and 4854 transitions. [2018-06-25 00:02:30,246 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:30,246 INFO ]: Found error trace [2018-06-25 00:02:30,247 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:30,247 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:30,249 INFO ]: Analyzing trace with hash 241856107, now seen corresponding path program 1 times [2018-06-25 00:02:30,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:30,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:30,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:30,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:30,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:30,271 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:30,365 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:02:30,366 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:30,366 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:30,366 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:30,366 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:30,366 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:30,366 INFO ]: Start difference. First operand 88 states and 4854 transitions. Second operand 3 states. [2018-06-25 00:02:32,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:32,290 INFO ]: Finished difference Result 168 states and 5974 transitions. [2018-06-25 00:02:32,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:32,291 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:02:32,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:32,295 INFO ]: With dead ends: 168 [2018-06-25 00:02:32,295 INFO ]: Without dead ends: 168 [2018-06-25 00:02:32,295 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:32,296 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-25 00:02:32,322 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-06-25 00:02:32,323 INFO ]: Start removeUnreachable. Operand 168 states. [2018-06-25 00:02:32,329 INFO ]: Finished removeUnreachable. Reduced from 168 states to 168 states and 5974 transitions. [2018-06-25 00:02:32,329 INFO ]: Start accepts. Automaton has 168 states and 5974 transitions. Word has length 13 [2018-06-25 00:02:32,329 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:32,329 INFO ]: Abstraction has 168 states and 5974 transitions. [2018-06-25 00:02:32,329 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:32,329 INFO ]: Start isEmpty. Operand 168 states and 5974 transitions. [2018-06-25 00:02:32,332 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:32,332 INFO ]: Found error trace [2018-06-25 00:02:32,332 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:32,332 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:32,333 INFO ]: Analyzing trace with hash -1342993282, now seen corresponding path program 1 times [2018-06-25 00:02:32,333 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:32,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:32,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:32,333 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:32,333 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:32,355 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:32,458 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 00:02:32,458 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:32,458 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:32,458 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:32,458 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:32,458 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:32,458 INFO ]: Start difference. First operand 168 states and 5974 transitions. Second operand 3 states. [2018-06-25 00:02:33,847 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:33,848 INFO ]: Finished difference Result 252 states and 9226 transitions. [2018-06-25 00:02:33,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:33,848 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:02:33,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:33,854 INFO ]: With dead ends: 252 [2018-06-25 00:02:33,854 INFO ]: Without dead ends: 252 [2018-06-25 00:02:33,854 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:33,855 INFO ]: Start minimizeSevpa. Operand 252 states. [2018-06-25 00:02:33,890 INFO ]: Finished minimizeSevpa. Reduced states from 252 to 176. [2018-06-25 00:02:33,890 INFO ]: Start removeUnreachable. Operand 176 states. [2018-06-25 00:02:33,894 INFO ]: Finished removeUnreachable. Reduced from 176 states to 176 states and 6362 transitions. [2018-06-25 00:02:33,894 INFO ]: Start accepts. Automaton has 176 states and 6362 transitions. Word has length 13 [2018-06-25 00:02:33,894 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:33,894 INFO ]: Abstraction has 176 states and 6362 transitions. [2018-06-25 00:02:33,894 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:33,894 INFO ]: Start isEmpty. Operand 176 states and 6362 transitions. [2018-06-25 00:02:33,897 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:33,897 INFO ]: Found error trace [2018-06-25 00:02:33,897 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:33,897 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:33,897 INFO ]: Analyzing trace with hash 262023112, now seen corresponding path program 1 times [2018-06-25 00:02:33,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:33,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:33,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:33,898 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:33,898 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:33,922 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:34,002 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:02:34,002 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:34,002 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:34,002 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:34,002 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:34,002 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:34,002 INFO ]: Start difference. First operand 176 states and 6362 transitions. Second operand 3 states. [2018-06-25 00:02:35,398 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:35,398 INFO ]: Finished difference Result 255 states and 9339 transitions. [2018-06-25 00:02:35,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:35,401 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:02:35,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:35,411 INFO ]: With dead ends: 255 [2018-06-25 00:02:35,411 INFO ]: Without dead ends: 255 [2018-06-25 00:02:35,412 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:35,412 INFO ]: Start minimizeSevpa. Operand 255 states. [2018-06-25 00:02:35,429 INFO ]: Finished minimizeSevpa. Reduced states from 255 to 184. [2018-06-25 00:02:35,429 INFO ]: Start removeUnreachable. Operand 184 states. [2018-06-25 00:02:35,433 INFO ]: Finished removeUnreachable. Reduced from 184 states to 184 states and 6590 transitions. [2018-06-25 00:02:35,433 INFO ]: Start accepts. Automaton has 184 states and 6590 transitions. Word has length 13 [2018-06-25 00:02:35,434 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:35,434 INFO ]: Abstraction has 184 states and 6590 transitions. [2018-06-25 00:02:35,434 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:35,434 INFO ]: Start isEmpty. Operand 184 states and 6590 transitions. [2018-06-25 00:02:35,436 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:02:35,436 INFO ]: Found error trace [2018-06-25 00:02:35,436 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:35,436 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:35,436 INFO ]: Analyzing trace with hash -1375104166, now seen corresponding path program 1 times [2018-06-25 00:02:35,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:35,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:35,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:35,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:35,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:35,462 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:35,538 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 00:02:35,539 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:35,539 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:35,539 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:35,539 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:35,539 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:35,539 INFO ]: Start difference. First operand 184 states and 6590 transitions. Second operand 3 states. [2018-06-25 00:02:37,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:37,120 INFO ]: Finished difference Result 260 states and 9242 transitions. [2018-06-25 00:02:37,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:37,120 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:02:37,120 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:37,127 INFO ]: With dead ends: 260 [2018-06-25 00:02:37,127 INFO ]: Without dead ends: 260 [2018-06-25 00:02:37,127 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:37,127 INFO ]: Start minimizeSevpa. Operand 260 states. [2018-06-25 00:02:37,146 INFO ]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-06-25 00:02:37,146 INFO ]: Start removeUnreachable. Operand 260 states. [2018-06-25 00:02:37,153 INFO ]: Finished removeUnreachable. Reduced from 260 states to 260 states and 9242 transitions. [2018-06-25 00:02:37,153 INFO ]: Start accepts. Automaton has 260 states and 9242 transitions. Word has length 13 [2018-06-25 00:02:37,153 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:37,153 INFO ]: Abstraction has 260 states and 9242 transitions. [2018-06-25 00:02:37,153 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:37,153 INFO ]: Start isEmpty. Operand 260 states and 9242 transitions. [2018-06-25 00:02:37,157 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 00:02:37,157 INFO ]: Found error trace [2018-06-25 00:02:37,157 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:37,157 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:37,157 INFO ]: Analyzing trace with hash 444122988, now seen corresponding path program 1 times [2018-06-25 00:02:37,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:37,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:37,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:37,158 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:37,158 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:37,181 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:37,262 INFO ]: Checked inductivity of 55 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 00:02:37,262 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:37,263 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:37,263 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:37,263 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:37,263 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:37,263 INFO ]: Start difference. First operand 260 states and 9242 transitions. Second operand 3 states. [2018-06-25 00:02:38,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:38,322 INFO ]: Finished difference Result 164 states and 4862 transitions. [2018-06-25 00:02:38,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:38,323 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-25 00:02:38,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:38,326 INFO ]: With dead ends: 164 [2018-06-25 00:02:38,326 INFO ]: Without dead ends: 164 [2018-06-25 00:02:38,326 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:38,326 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-25 00:02:38,334 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-06-25 00:02:38,334 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-25 00:02:38,336 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 4862 transitions. [2018-06-25 00:02:38,336 INFO ]: Start accepts. Automaton has 164 states and 4862 transitions. Word has length 15 [2018-06-25 00:02:38,336 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:38,336 INFO ]: Abstraction has 164 states and 4862 transitions. [2018-06-25 00:02:38,336 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:38,337 INFO ]: Start isEmpty. Operand 164 states and 4862 transitions. [2018-06-25 00:02:38,337 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 00:02:38,337 INFO ]: Found error trace [2018-06-25 00:02:38,337 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:38,338 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:38,338 INFO ]: Analyzing trace with hash 1092118324, now seen corresponding path program 1 times [2018-06-25 00:02:38,338 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:38,338 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:38,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:38,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:38,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:38,370 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:38,437 INFO ]: Checked inductivity of 55 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-25 00:02:38,437 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:38,437 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:38,437 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:38,437 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:38,437 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:38,437 INFO ]: Start difference. First operand 164 states and 4862 transitions. Second operand 3 states. [2018-06-25 00:02:39,479 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:39,479 INFO ]: Finished difference Result 176 states and 5054 transitions. [2018-06-25 00:02:39,481 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:39,481 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-25 00:02:39,481 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:39,483 INFO ]: With dead ends: 176 [2018-06-25 00:02:39,483 INFO ]: Without dead ends: 176 [2018-06-25 00:02:39,483 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:39,483 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-25 00:02:39,492 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 164. [2018-06-25 00:02:39,492 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-25 00:02:39,494 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 4862 transitions. [2018-06-25 00:02:39,494 INFO ]: Start accepts. Automaton has 164 states and 4862 transitions. Word has length 15 [2018-06-25 00:02:39,494 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:39,494 INFO ]: Abstraction has 164 states and 4862 transitions. [2018-06-25 00:02:39,494 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:39,494 INFO ]: Start isEmpty. Operand 164 states and 4862 transitions. [2018-06-25 00:02:39,495 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:02:39,495 INFO ]: Found error trace [2018-06-25 00:02:39,495 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:39,495 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:39,495 INFO ]: Analyzing trace with hash -637648691, now seen corresponding path program 1 times [2018-06-25 00:02:39,495 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:39,495 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:39,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:39,496 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:39,496 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:39,515 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:39,592 INFO ]: Checked inductivity of 78 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-25 00:02:39,592 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:39,592 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:39,592 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:39,592 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:39,592 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:39,592 INFO ]: Start difference. First operand 164 states and 4862 transitions. Second operand 3 states. [2018-06-25 00:02:40,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:40,728 INFO ]: Finished difference Result 176 states and 4526 transitions. [2018-06-25 00:02:40,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:40,728 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:02:40,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:40,731 INFO ]: With dead ends: 176 [2018-06-25 00:02:40,731 INFO ]: Without dead ends: 176 [2018-06-25 00:02:40,731 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:40,731 INFO ]: Start minimizeSevpa. Operand 176 states. [2018-06-25 00:02:40,741 INFO ]: Finished minimizeSevpa. Reduced states from 176 to 152. [2018-06-25 00:02:40,741 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-25 00:02:40,744 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 4306 transitions. [2018-06-25 00:02:40,744 INFO ]: Start accepts. Automaton has 152 states and 4306 transitions. Word has length 17 [2018-06-25 00:02:40,744 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:40,744 INFO ]: Abstraction has 152 states and 4306 transitions. [2018-06-25 00:02:40,744 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:40,744 INFO ]: Start isEmpty. Operand 152 states and 4306 transitions. [2018-06-25 00:02:40,746 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 00:02:40,746 INFO ]: Found error trace [2018-06-25 00:02:40,746 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:40,746 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:40,746 INFO ]: Analyzing trace with hash 2000564097, now seen corresponding path program 1 times [2018-06-25 00:02:40,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:40,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:40,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:40,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:40,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:40,776 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:40,861 INFO ]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-25 00:02:40,861 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:40,861 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:40,861 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:40,861 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:40,861 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:40,861 INFO ]: Start difference. First operand 152 states and 4306 transitions. Second operand 3 states. [2018-06-25 00:02:41,978 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:41,978 INFO ]: Finished difference Result 164 states and 4190 transitions. [2018-06-25 00:02:41,978 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:41,978 INFO ]: Start accepts. Automaton has 3 states. Word has length 18 [2018-06-25 00:02:41,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:41,980 INFO ]: With dead ends: 164 [2018-06-25 00:02:41,980 INFO ]: Without dead ends: 164 [2018-06-25 00:02:41,980 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:41,980 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-25 00:02:41,986 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 152. [2018-06-25 00:02:41,986 INFO ]: Start removeUnreachable. Operand 152 states. [2018-06-25 00:02:41,988 INFO ]: Finished removeUnreachable. Reduced from 152 states to 152 states and 4130 transitions. [2018-06-25 00:02:41,988 INFO ]: Start accepts. Automaton has 152 states and 4130 transitions. Word has length 18 [2018-06-25 00:02:41,988 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:41,988 INFO ]: Abstraction has 152 states and 4130 transitions. [2018-06-25 00:02:41,988 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:41,988 INFO ]: Start isEmpty. Operand 152 states and 4130 transitions. [2018-06-25 00:02:41,989 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 00:02:41,989 INFO ]: Found error trace [2018-06-25 00:02:41,989 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:41,989 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:41,989 INFO ]: Analyzing trace with hash 1460498107, now seen corresponding path program 1 times [2018-06-25 00:02:41,990 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:41,990 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:41,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:41,990 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:41,990 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:42,010 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:42,177 INFO ]: Checked inductivity of 91 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-25 00:02:42,177 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:02:42,177 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) [2018-06-25 00:02:42,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:02:42,481 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:42,491 INFO ]: Computing forward predicates... [2018-06-25 00:02:42,506 INFO ]: Checked inductivity of 91 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-25 00:02:42,529 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:02:42,529 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 00:02:42,529 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:02:42,529 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:02:42,529 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:02:42,529 INFO ]: Start difference. First operand 152 states and 4130 transitions. Second operand 6 states. [2018-06-25 00:02:44,313 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:44,313 INFO ]: Finished difference Result 188 states and 4190 transitions. [2018-06-25 00:02:44,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:02:44,313 INFO ]: Start accepts. Automaton has 6 states. Word has length 18 [2018-06-25 00:02:44,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:44,316 INFO ]: With dead ends: 188 [2018-06-25 00:02:44,316 INFO ]: Without dead ends: 140 [2018-06-25 00:02:44,316 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-25 00:02:44,316 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-25 00:02:44,323 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 128. [2018-06-25 00:02:44,323 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-25 00:02:44,326 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 2892 transitions. [2018-06-25 00:02:44,326 INFO ]: Start accepts. Automaton has 128 states and 2892 transitions. Word has length 18 [2018-06-25 00:02:44,326 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:44,326 INFO ]: Abstraction has 128 states and 2892 transitions. [2018-06-25 00:02:44,326 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:02:44,326 INFO ]: Start isEmpty. Operand 128 states and 2892 transitions. [2018-06-25 00:02:44,327 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 00:02:44,327 INFO ]: Found error trace [2018-06-25 00:02:44,327 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 00:02:44,327 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:44,327 INFO ]: Analyzing trace with hash 991586417, now seen corresponding path program 1 times [2018-06-25 00:02:44,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:44,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:44,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:44,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:44,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:44,354 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:44,455 INFO ]: Checked inductivity of 105 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-25 00:02:44,455 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:44,455 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:44,455 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:44,455 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:44,455 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:44,455 INFO ]: Start difference. First operand 128 states and 2892 transitions. Second operand 3 states. [2018-06-25 00:02:45,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:45,558 INFO ]: Finished difference Result 140 states and 2892 transitions. [2018-06-25 00:02:45,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:45,559 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-25 00:02:45,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:45,560 INFO ]: With dead ends: 140 [2018-06-25 00:02:45,560 INFO ]: Without dead ends: 128 [2018-06-25 00:02:45,560 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:45,560 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-25 00:02:45,566 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-06-25 00:02:45,566 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-25 00:02:45,568 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 2832 transitions. [2018-06-25 00:02:45,568 INFO ]: Start accepts. Automaton has 128 states and 2832 transitions. Word has length 19 [2018-06-25 00:02:45,568 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:45,568 INFO ]: Abstraction has 128 states and 2832 transitions. [2018-06-25 00:02:45,568 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:45,568 INFO ]: Start isEmpty. Operand 128 states and 2832 transitions. [2018-06-25 00:02:45,569 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 00:02:45,569 INFO ]: Found error trace [2018-06-25 00:02:45,569 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 00:02:45,569 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:45,569 INFO ]: Analyzing trace with hash 1930037917, now seen corresponding path program 1 times [2018-06-25 00:02:45,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:45,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:45,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:45,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:45,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:45,594 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:45,673 INFO ]: Checked inductivity of 105 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-25 00:02:45,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:45,673 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:45,673 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:45,673 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:45,673 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:45,673 INFO ]: Start difference. First operand 128 states and 2832 transitions. Second operand 3 states. Received shutdown request... [2018-06-25 00:02:47,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:47,238 WARN ]: Verification canceled [2018-06-25 00:02:47,240 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:02:47,241 WARN ]: Timeout [2018-06-25 00:02:47,241 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:02:47 BasicIcfg [2018-06-25 00:02:47,241 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:02:47,242 INFO ]: Toolchain (without parser) took 64319.56 ms. Allocated memory was 308.8 MB in the beginning and 983.6 MB in the end (delta: 674.8 MB). Free memory was 247.2 MB in the beginning and 760.2 MB in the end (delta: -513.0 MB). Peak memory consumption was 161.8 MB. Max. memory is 3.6 GB. [2018-06-25 00:02:47,244 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:02:47,245 INFO ]: ChcToBoogie took 88.67 ms. Allocated memory is still 308.8 MB. Free memory was 247.2 MB in the beginning and 244.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:02:47,245 INFO ]: Boogie Preprocessor took 60.25 ms. Allocated memory is still 308.8 MB. Free memory was 244.2 MB in the beginning and 242.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:02:47,245 INFO ]: RCFGBuilder took 359.90 ms. Allocated memory is still 308.8 MB. Free memory was 242.2 MB in the beginning and 215.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:02:47,246 INFO ]: BlockEncodingV2 took 6333.34 ms. Allocated memory was 308.8 MB in the beginning and 355.5 MB in the end (delta: 46.7 MB). Free memory was 215.2 MB in the beginning and 232.8 MB in the end (delta: -17.6 MB). Peak memory consumption was 60.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:02:47,246 INFO ]: TraceAbstraction took 57466.81 ms. Allocated memory was 355.5 MB in the beginning and 983.6 MB in the end (delta: 628.1 MB). Free memory was 230.5 MB in the beginning and 760.2 MB in the end (delta: -529.7 MB). Peak memory consumption was 98.4 MB. Max. memory is 3.6 GB. [2018-06-25 00:02:47,253 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 524 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 88.67 ms. Allocated memory is still 308.8 MB. Free memory was 247.2 MB in the beginning and 244.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 60.25 ms. Allocated memory is still 308.8 MB. Free memory was 244.2 MB in the beginning and 242.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 359.90 ms. Allocated memory is still 308.8 MB. Free memory was 242.2 MB in the beginning and 215.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 6333.34 ms. Allocated memory was 308.8 MB in the beginning and 355.5 MB in the end (delta: 46.7 MB). Free memory was 215.2 MB in the beginning and 232.8 MB in the end (delta: -17.6 MB). Peak memory consumption was 60.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57466.81 ms. Allocated memory was 355.5 MB in the beginning and 983.6 MB in the end (delta: 628.1 MB). Free memory was 230.5 MB in the beginning and 760.2 MB in the end (delta: -529.7 MB). Peak memory consumption was 98.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (128states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (122 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 57.3s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 52.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 0 SDslu, 119 SDs, 0 SdLazy, 16079 SolverSat, 15285 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=20, 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.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 235 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 373 NumberOfCodeBlocks, 373 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 344 ConstructedInterpolants, 0 QuantifiedInterpolants, 5422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3944 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 1196/1200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-02-47-428.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-02-47-428.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-02-47-428.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_4.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-02-47-428.csv Completed graceful shutdown