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_3.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:39:57,842 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:39:57,844 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:39:57,857 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:39:57,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:39:57,858 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:39:57,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:39:57,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:39:57,867 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:39:57,868 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:39:57,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:39:57,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:39:57,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:39:57,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:39:57,884 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:39:57,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:39:57,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:39:57,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:39:57,893 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:39:57,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:39:57,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:39:57,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:39:57,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:39:57,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:39:57,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:39:57,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:39:57,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:39:57,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:39:57,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:39:57,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:39:57,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:39:57,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:39:57,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:39:57,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:39:57,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:39:57,921 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:39:57,922 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:39:57,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:39:57,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:39:57,937 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:39:57,938 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:39:57,939 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:39:57,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:39:57,939 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:39:57,939 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:39:57,939 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:39:57,940 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:39:57,940 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:39:57,940 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:39:57,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:39:57,940 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:39:57,941 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:39:57,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:39:57,941 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:39:57,941 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:39:57,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:39:57,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:39:57,942 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:39:57,943 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:39:57,943 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:39:57,985 INFO ]: Repository-Root is: /tmp [2018-06-26 20:39:58,001 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:39:58,007 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:39:58,008 INFO ]: Initializing SmtParser... [2018-06-26 20:39:58,008 INFO ]: SmtParser initialized [2018-06-26 20:39:58,009 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_3.cil.smt2 [2018-06-26 20:39:58,011 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-26 20:39:58,099 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_3.cil.smt2 unknown [2018-06-26 20:39:58,623 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_3.cil.smt2 [2018-06-26 20:39:58,634 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:39:58,639 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:39:58,649 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:39:58,649 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:39:58,649 INFO ]: ChcToBoogie initialized [2018-06-26 20:39:58,652 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:39:58" (1/1) ... [2018-06-26 20:39:58,739 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58 Unit [2018-06-26 20:39:58,739 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:39:58,739 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:39:58,739 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:39:58,739 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:39:58,761 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58" (1/1) ... [2018-06-26 20:39:58,761 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58" (1/1) ... [2018-06-26 20:39:58,781 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58" (1/1) ... [2018-06-26 20:39:58,781 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58" (1/1) ... [2018-06-26 20:39:58,803 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58" (1/1) ... [2018-06-26 20:39:58,805 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58" (1/1) ... [2018-06-26 20:39:58,808 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58" (1/1) ... [2018-06-26 20:39:58,812 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:39:58,813 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:39:58,813 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:39:58,813 INFO ]: RCFGBuilder initialized [2018-06-26 20:39:58,814 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58" (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-26 20:39:58,823 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:39:58,823 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:39:58,823 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:39:58,823 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:39:58,823 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:39:58,823 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-26 20:39:59,257 INFO ]: Using library mode [2018-06-26 20:39:59,260 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:39:59 BoogieIcfgContainer [2018-06-26 20:39:59,260 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:39:59,260 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:39:59,260 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:39:59,261 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:39:59,262 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:39:59" (1/1) ... [2018-06-26 20:39:59,282 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:39:59,284 INFO ]: Using Remove infeasible edges [2018-06-26 20:39:59,284 INFO ]: Using Maximize final states [2018-06-26 20:39:59,285 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:39:59,285 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:39:59,288 INFO ]: Using Remove sink states [2018-06-26 20:39:59,288 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:39:59,288 INFO ]: Using Use SBE [2018-06-26 20:40:00,212 INFO ]: SBE split 1 edges [2018-06-26 20:40:00,263 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:40:00,267 INFO ]: 0 new accepting states [2018-06-26 20:40:00,324 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:40:00,326 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:40:00,394 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:40:00,395 INFO ]: 0 new accepting states [2018-06-26 20:40:00,395 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:40:00,395 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:40:00,463 INFO ]: Encoded RCFG 6 locations, 540 edges [2018-06-26 20:40:00,463 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:40:00 BasicIcfg [2018-06-26 20:40:00,463 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:40:00,464 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:40:00,464 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:40:00,469 INFO ]: TraceAbstraction initialized [2018-06-26 20:40:00,469 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:39:58" (1/4) ... [2018-06-26 20:40:00,470 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d288a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:40:00, skipping insertion in model container [2018-06-26 20:40:00,471 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:39:58" (2/4) ... [2018-06-26 20:40:00,471 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d288a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:40:00, skipping insertion in model container [2018-06-26 20:40:00,471 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:39:59" (3/4) ... [2018-06-26 20:40:00,471 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d288a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:40:00, skipping insertion in model container [2018-06-26 20:40:00,471 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:40:00" (4/4) ... [2018-06-26 20:40:00,473 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:40:00,485 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:40:00,493 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:40:00,539 INFO ]: Using default assertion order modulation [2018-06-26 20:40:00,539 INFO ]: Interprodecural is true [2018-06-26 20:40:00,539 INFO ]: Hoare is false [2018-06-26 20:40:00,539 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:40:00,539 INFO ]: Backedges is TWOTRACK [2018-06-26 20:40:00,539 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:40:00,539 INFO ]: Difference is false [2018-06-26 20:40:00,539 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:40:00,539 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:40:00,557 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:40:00,576 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:40:00,576 INFO ]: Found error trace [2018-06-26 20:40:00,579 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:40:00,579 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:00,584 INFO ]: Analyzing trace with hash 51854882, now seen corresponding path program 1 times [2018-06-26 20:40:00,586 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:00,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:00,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:00,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:00,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:00,697 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:00,812 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:40:00,815 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:00,816 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:00,817 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:00,832 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:00,833 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:00,835 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:40:04,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:04,920 INFO ]: Finished difference Result 7 states and 406 transitions. [2018-06-26 20:40:04,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:04,924 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:40:04,925 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:04,941 INFO ]: With dead ends: 7 [2018-06-26 20:40:04,941 INFO ]: Without dead ends: 7 [2018-06-26 20:40:04,943 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-26 20:40:04,962 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:40:04,996 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:40:04,997 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:40:05,001 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 406 transitions. [2018-06-26 20:40:05,002 INFO ]: Start accepts. Automaton has 7 states and 406 transitions. Word has length 5 [2018-06-26 20:40:05,002 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:05,002 INFO ]: Abstraction has 7 states and 406 transitions. [2018-06-26 20:40:05,002 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:05,003 INFO ]: Start isEmpty. Operand 7 states and 406 transitions. [2018-06-26 20:40:05,003 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:40:05,003 INFO ]: Found error trace [2018-06-26 20:40:05,003 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:40:05,003 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:05,004 INFO ]: Analyzing trace with hash 1595773457, now seen corresponding path program 1 times [2018-06-26 20:40:05,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:05,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:05,004 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:05,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:05,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:05,031 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:05,093 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:40:05,093 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:05,093 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:05,094 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:05,094 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:05,094 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:05,095 INFO ]: Start difference. First operand 7 states and 406 transitions. Second operand 3 states. [2018-06-26 20:40:07,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:07,772 INFO ]: Finished difference Result 8 states and 408 transitions. [2018-06-26 20:40:07,773 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:07,773 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:40:07,773 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:07,774 INFO ]: With dead ends: 8 [2018-06-26 20:40:07,774 INFO ]: Without dead ends: 8 [2018-06-26 20:40:07,775 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-26 20:40:07,775 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:40:07,781 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:40:07,782 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:40:07,783 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 408 transitions. [2018-06-26 20:40:07,783 INFO ]: Start accepts. Automaton has 8 states and 408 transitions. Word has length 6 [2018-06-26 20:40:07,783 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:07,783 INFO ]: Abstraction has 8 states and 408 transitions. [2018-06-26 20:40:07,783 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:07,783 INFO ]: Start isEmpty. Operand 8 states and 408 transitions. [2018-06-26 20:40:07,783 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:40:07,783 INFO ]: Found error trace [2018-06-26 20:40:07,783 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:07,783 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:07,784 INFO ]: Analyzing trace with hash -2084354267, now seen corresponding path program 1 times [2018-06-26 20:40:07,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:07,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:07,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:07,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:07,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:07,826 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:07,917 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:40:07,917 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:07,918 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:07,918 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:07,918 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:07,918 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:07,918 INFO ]: Start difference. First operand 8 states and 408 transitions. Second operand 3 states. [2018-06-26 20:40:09,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:09,952 INFO ]: Finished difference Result 9 states and 803 transitions. [2018-06-26 20:40:09,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:09,952 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:40:09,952 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:09,954 INFO ]: With dead ends: 9 [2018-06-26 20:40:09,954 INFO ]: Without dead ends: 9 [2018-06-26 20:40:09,954 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-26 20:40:09,954 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:40:09,963 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:40:09,963 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:40:09,965 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 803 transitions. [2018-06-26 20:40:09,965 INFO ]: Start accepts. Automaton has 9 states and 803 transitions. Word has length 7 [2018-06-26 20:40:09,966 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:09,966 INFO ]: Abstraction has 9 states and 803 transitions. [2018-06-26 20:40:09,966 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:09,966 INFO ]: Start isEmpty. Operand 9 states and 803 transitions. [2018-06-26 20:40:09,967 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:40:09,967 INFO ]: Found error trace [2018-06-26 20:40:09,967 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:09,967 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:09,967 INFO ]: Analyzing trace with hash -204315883, now seen corresponding path program 1 times [2018-06-26 20:40:09,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:09,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:09,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:09,968 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:09,968 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:10,003 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:10,098 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:40:10,098 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:10,099 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:10,099 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:10,099 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:10,099 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:10,099 INFO ]: Start difference. First operand 9 states and 803 transitions. Second operand 3 states. [2018-06-26 20:40:12,266 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:12,266 INFO ]: Finished difference Result 10 states and 1195 transitions. [2018-06-26 20:40:12,266 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:12,266 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:40:12,266 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:12,267 INFO ]: With dead ends: 10 [2018-06-26 20:40:12,267 INFO ]: Without dead ends: 10 [2018-06-26 20:40:12,268 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-26 20:40:12,268 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 20:40:12,274 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 20:40:12,274 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 20:40:12,276 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1195 transitions. [2018-06-26 20:40:12,277 INFO ]: Start accepts. Automaton has 10 states and 1195 transitions. Word has length 8 [2018-06-26 20:40:12,277 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:12,277 INFO ]: Abstraction has 10 states and 1195 transitions. [2018-06-26 20:40:12,277 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:12,277 INFO ]: Start isEmpty. Operand 10 states and 1195 transitions. [2018-06-26 20:40:12,277 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:40:12,277 INFO ]: Found error trace [2018-06-26 20:40:12,277 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:12,278 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:12,278 INFO ]: Analyzing trace with hash -2041585871, now seen corresponding path program 1 times [2018-06-26 20:40:12,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:12,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:12,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:12,279 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:12,279 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:12,316 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:12,401 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:40:12,401 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:12,401 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:12,402 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:12,402 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:12,402 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:12,402 INFO ]: Start difference. First operand 10 states and 1195 transitions. Second operand 3 states. [2018-06-26 20:40:14,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:14,270 INFO ]: Finished difference Result 11 states and 1139 transitions. [2018-06-26 20:40:14,273 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:14,273 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:40:14,273 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:14,275 INFO ]: With dead ends: 11 [2018-06-26 20:40:14,275 INFO ]: Without dead ends: 11 [2018-06-26 20:40:14,275 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-26 20:40:14,275 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:40:14,283 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 20:40:14,283 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:40:14,285 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1139 transitions. [2018-06-26 20:40:14,285 INFO ]: Start accepts. Automaton has 11 states and 1139 transitions. Word has length 9 [2018-06-26 20:40:14,285 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:14,285 INFO ]: Abstraction has 11 states and 1139 transitions. [2018-06-26 20:40:14,285 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:14,285 INFO ]: Start isEmpty. Operand 11 states and 1139 transitions. [2018-06-26 20:40:14,286 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:40:14,286 INFO ]: Found error trace [2018-06-26 20:40:14,286 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:14,286 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:14,286 INFO ]: Analyzing trace with hash -1155271482, now seen corresponding path program 1 times [2018-06-26 20:40:14,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:14,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:14,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:14,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:14,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:14,315 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:14,395 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:40:14,395 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:14,395 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:14,395 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:14,395 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:14,395 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:14,395 INFO ]: Start difference. First operand 11 states and 1139 transitions. Second operand 3 states. [2018-06-26 20:40:16,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:16,289 INFO ]: Finished difference Result 12 states and 1331 transitions. [2018-06-26 20:40:16,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:16,290 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:40:16,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:16,292 INFO ]: With dead ends: 12 [2018-06-26 20:40:16,292 INFO ]: Without dead ends: 12 [2018-06-26 20:40:16,292 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-26 20:40:16,292 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 20:40:16,297 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 20:40:16,297 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:40:16,300 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1331 transitions. [2018-06-26 20:40:16,300 INFO ]: Start accepts. Automaton has 12 states and 1331 transitions. Word has length 9 [2018-06-26 20:40:16,300 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:16,300 INFO ]: Abstraction has 12 states and 1331 transitions. [2018-06-26 20:40:16,300 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:16,300 INFO ]: Start isEmpty. Operand 12 states and 1331 transitions. [2018-06-26 20:40:16,301 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:40:16,301 INFO ]: Found error trace [2018-06-26 20:40:16,301 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:16,301 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:16,301 INFO ]: Analyzing trace with hash 2048124831, now seen corresponding path program 1 times [2018-06-26 20:40:16,301 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:16,301 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:16,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:16,302 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:16,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:16,346 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:16,424 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:40:16,424 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:16,424 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:16,424 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:16,424 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:16,424 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:16,425 INFO ]: Start difference. First operand 12 states and 1331 transitions. Second operand 3 states. [2018-06-26 20:40:18,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:18,051 INFO ]: Finished difference Result 13 states and 1355 transitions. [2018-06-26 20:40:18,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:18,052 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:40:18,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:18,054 INFO ]: With dead ends: 13 [2018-06-26 20:40:18,054 INFO ]: Without dead ends: 13 [2018-06-26 20:40:18,054 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-26 20:40:18,054 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:40:18,067 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:40:18,067 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:40:18,068 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1355 transitions. [2018-06-26 20:40:18,068 INFO ]: Start accepts. Automaton has 13 states and 1355 transitions. Word has length 10 [2018-06-26 20:40:18,068 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:18,068 INFO ]: Abstraction has 13 states and 1355 transitions. [2018-06-26 20:40:18,068 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:18,068 INFO ]: Start isEmpty. Operand 13 states and 1355 transitions. [2018-06-26 20:40:18,069 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:40:18,069 INFO ]: Found error trace [2018-06-26 20:40:18,069 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:18,069 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:18,069 INFO ]: Analyzing trace with hash -1502484539, now seen corresponding path program 1 times [2018-06-26 20:40:18,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:18,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:18,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:18,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:18,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:18,102 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:18,189 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:40:18,190 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:18,190 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:18,190 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:18,190 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:18,190 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:18,190 INFO ]: Start difference. First operand 13 states and 1355 transitions. Second operand 3 states. [2018-06-26 20:40:19,916 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:19,916 INFO ]: Finished difference Result 14 states and 1419 transitions. [2018-06-26 20:40:19,916 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:19,916 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:40:19,916 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:19,917 INFO ]: With dead ends: 14 [2018-06-26 20:40:19,917 INFO ]: Without dead ends: 14 [2018-06-26 20:40:19,918 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-26 20:40:19,918 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 20:40:19,925 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 20:40:19,925 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:40:19,926 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1419 transitions. [2018-06-26 20:40:19,926 INFO ]: Start accepts. Automaton has 14 states and 1419 transitions. Word has length 10 [2018-06-26 20:40:19,927 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:19,927 INFO ]: Abstraction has 14 states and 1419 transitions. [2018-06-26 20:40:19,927 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:19,927 INFO ]: Start isEmpty. Operand 14 states and 1419 transitions. [2018-06-26 20:40:19,930 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:40:19,930 INFO ]: Found error trace [2018-06-26 20:40:19,930 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:19,930 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:19,930 INFO ]: Analyzing trace with hash -1773142967, now seen corresponding path program 1 times [2018-06-26 20:40:19,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:19,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:19,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:19,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:19,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:19,960 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:20,056 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:40:20,056 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:20,057 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:20,057 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:20,057 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:20,057 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:20,057 INFO ]: Start difference. First operand 14 states and 1419 transitions. Second operand 3 states. [2018-06-26 20:40:22,170 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:22,171 INFO ]: Finished difference Result 15 states and 1603 transitions. [2018-06-26 20:40:22,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:22,217 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:40:22,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:22,219 INFO ]: With dead ends: 15 [2018-06-26 20:40:22,219 INFO ]: Without dead ends: 15 [2018-06-26 20:40:22,219 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-26 20:40:22,219 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 20:40:22,225 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 20:40:22,225 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 20:40:22,226 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1603 transitions. [2018-06-26 20:40:22,226 INFO ]: Start accepts. Automaton has 15 states and 1603 transitions. Word has length 10 [2018-06-26 20:40:22,227 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:22,227 INFO ]: Abstraction has 15 states and 1603 transitions. [2018-06-26 20:40:22,227 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:22,227 INFO ]: Start isEmpty. Operand 15 states and 1603 transitions. [2018-06-26 20:40:22,228 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:40:22,228 INFO ]: Found error trace [2018-06-26 20:40:22,228 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:22,228 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:22,228 INFO ]: Analyzing trace with hash 375594013, now seen corresponding path program 1 times [2018-06-26 20:40:22,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:22,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:22,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:22,229 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:22,229 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:22,258 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:22,336 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:40:22,336 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:22,336 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:22,336 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:22,336 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:22,336 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:22,337 INFO ]: Start difference. First operand 15 states and 1603 transitions. Second operand 3 states. [2018-06-26 20:40:24,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:24,008 INFO ]: Finished difference Result 16 states and 1519 transitions. [2018-06-26 20:40:24,008 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:24,008 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:40:24,008 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:24,009 INFO ]: With dead ends: 16 [2018-06-26 20:40:24,009 INFO ]: Without dead ends: 16 [2018-06-26 20:40:24,010 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-26 20:40:24,010 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 20:40:24,017 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 20:40:24,017 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 20:40:24,018 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1519 transitions. [2018-06-26 20:40:24,018 INFO ]: Start accepts. Automaton has 16 states and 1519 transitions. Word has length 11 [2018-06-26 20:40:24,018 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:24,018 INFO ]: Abstraction has 16 states and 1519 transitions. [2018-06-26 20:40:24,018 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:24,018 INFO ]: Start isEmpty. Operand 16 states and 1519 transitions. [2018-06-26 20:40:24,019 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:40:24,019 INFO ]: Found error trace [2018-06-26 20:40:24,019 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:24,019 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:24,020 INFO ]: Analyzing trace with hash 1751291112, now seen corresponding path program 1 times [2018-06-26 20:40:24,020 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:24,020 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:24,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:24,022 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:24,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:24,059 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:24,150 INFO ]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:40:24,150 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:24,151 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:24,151 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:24,151 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:24,151 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:24,151 INFO ]: Start difference. First operand 16 states and 1519 transitions. Second operand 3 states. [2018-06-26 20:40:26,107 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:26,107 INFO ]: Finished difference Result 24 states and 2606 transitions. [2018-06-26 20:40:26,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:26,108 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:40:26,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:26,111 INFO ]: With dead ends: 24 [2018-06-26 20:40:26,111 INFO ]: Without dead ends: 24 [2018-06-26 20:40:26,113 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-26 20:40:26,113 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 20:40:26,121 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 20:40:26,121 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 20:40:26,126 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2606 transitions. [2018-06-26 20:40:26,126 INFO ]: Start accepts. Automaton has 24 states and 2606 transitions. Word has length 11 [2018-06-26 20:40:26,126 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:26,126 INFO ]: Abstraction has 24 states and 2606 transitions. [2018-06-26 20:40:26,126 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:26,126 INFO ]: Start isEmpty. Operand 24 states and 2606 transitions. [2018-06-26 20:40:26,128 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:40:26,128 INFO ]: Found error trace [2018-06-26 20:40:26,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:26,128 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:26,128 INFO ]: Analyzing trace with hash -824737832, now seen corresponding path program 1 times [2018-06-26 20:40:26,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:26,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:26,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:26,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:26,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:26,160 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:26,262 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:40:26,262 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:26,262 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:26,262 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:26,262 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:26,262 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:26,262 INFO ]: Start difference. First operand 24 states and 2606 transitions. Second operand 3 states. [2018-06-26 20:40:27,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:27,740 INFO ]: Finished difference Result 26 states and 2962 transitions. [2018-06-26 20:40:27,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:27,740 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-26 20:40:27,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:27,742 INFO ]: With dead ends: 26 [2018-06-26 20:40:27,742 INFO ]: Without dead ends: 26 [2018-06-26 20:40:27,742 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-26 20:40:27,742 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 20:40:27,750 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 20:40:27,750 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 20:40:27,752 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2962 transitions. [2018-06-26 20:40:27,752 INFO ]: Start accepts. Automaton has 26 states and 2962 transitions. Word has length 11 [2018-06-26 20:40:27,753 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:27,753 INFO ]: Abstraction has 26 states and 2962 transitions. [2018-06-26 20:40:27,753 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:27,753 INFO ]: Start isEmpty. Operand 26 states and 2962 transitions. [2018-06-26 20:40:27,754 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:40:27,754 INFO ]: Found error trace [2018-06-26 20:40:27,754 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:27,755 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:27,755 INFO ]: Analyzing trace with hash -232869234, now seen corresponding path program 1 times [2018-06-26 20:40:27,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:27,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:27,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:27,755 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:27,755 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:27,790 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:27,882 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:40:27,883 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:27,883 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:27,883 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:27,883 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:27,883 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:27,883 INFO ]: Start difference. First operand 26 states and 2962 transitions. Second operand 3 states. [2018-06-26 20:40:29,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:29,613 INFO ]: Finished difference Result 44 states and 3398 transitions. [2018-06-26 20:40:29,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:29,613 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:40:29,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:29,615 INFO ]: With dead ends: 44 [2018-06-26 20:40:29,615 INFO ]: Without dead ends: 44 [2018-06-26 20:40:29,615 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-26 20:40:29,616 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 20:40:29,625 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-26 20:40:29,625 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 20:40:29,628 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3398 transitions. [2018-06-26 20:40:29,628 INFO ]: Start accepts. Automaton has 44 states and 3398 transitions. Word has length 12 [2018-06-26 20:40:29,628 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:29,628 INFO ]: Abstraction has 44 states and 3398 transitions. [2018-06-26 20:40:29,628 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:29,628 INFO ]: Start isEmpty. Operand 44 states and 3398 transitions. [2018-06-26 20:40:29,633 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:40:29,633 INFO ]: Found error trace [2018-06-26 20:40:29,633 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:29,633 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:29,633 INFO ]: Analyzing trace with hash -2046664478, now seen corresponding path program 1 times [2018-06-26 20:40:29,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:29,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:29,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:29,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:29,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:29,661 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:29,727 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:40:29,727 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:29,727 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:29,727 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:29,727 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:29,727 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:29,727 INFO ]: Start difference. First operand 44 states and 3398 transitions. Second operand 3 states. [2018-06-26 20:40:31,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:31,289 INFO ]: Finished difference Result 48 states and 3434 transitions. [2018-06-26 20:40:31,290 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:31,290 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:40:31,290 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:31,293 INFO ]: With dead ends: 48 [2018-06-26 20:40:31,293 INFO ]: Without dead ends: 48 [2018-06-26 20:40:31,293 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-26 20:40:31,294 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 20:40:31,300 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-26 20:40:31,300 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 20:40:31,304 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3434 transitions. [2018-06-26 20:40:31,304 INFO ]: Start accepts. Automaton has 48 states and 3434 transitions. Word has length 12 [2018-06-26 20:40:31,304 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:31,304 INFO ]: Abstraction has 48 states and 3434 transitions. [2018-06-26 20:40:31,304 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:31,304 INFO ]: Start isEmpty. Operand 48 states and 3434 transitions. [2018-06-26 20:40:31,306 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:40:31,306 INFO ]: Found error trace [2018-06-26 20:40:31,306 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:31,306 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:31,306 INFO ]: Analyzing trace with hash 1883070611, now seen corresponding path program 1 times [2018-06-26 20:40:31,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:31,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:31,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:31,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:31,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:31,334 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:31,414 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:40:31,414 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:31,414 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:31,414 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:31,414 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:31,414 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:31,414 INFO ]: Start difference. First operand 48 states and 3434 transitions. Second operand 3 states. [2018-06-26 20:40:33,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:33,353 INFO ]: Finished difference Result 68 states and 3434 transitions. [2018-06-26 20:40:33,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:33,353 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:40:33,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:33,355 INFO ]: With dead ends: 68 [2018-06-26 20:40:33,355 INFO ]: Without dead ends: 48 [2018-06-26 20:40:33,355 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-26 20:40:33,355 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 20:40:33,365 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-26 20:40:33,365 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 20:40:33,368 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 2948 transitions. [2018-06-26 20:40:33,368 INFO ]: Start accepts. Automaton has 48 states and 2948 transitions. Word has length 12 [2018-06-26 20:40:33,368 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:33,368 INFO ]: Abstraction has 48 states and 2948 transitions. [2018-06-26 20:40:33,368 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:33,368 INFO ]: Start isEmpty. Operand 48 states and 2948 transitions. [2018-06-26 20:40:33,370 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:40:33,370 INFO ]: Found error trace [2018-06-26 20:40:33,370 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:33,370 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:33,371 INFO ]: Analyzing trace with hash -1092068652, now seen corresponding path program 1 times [2018-06-26 20:40:33,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:33,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:33,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:33,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:33,371 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:33,397 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:33,440 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:40:33,440 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:33,440 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:33,440 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:33,440 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:33,440 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:33,440 INFO ]: Start difference. First operand 48 states and 2948 transitions. Second operand 3 states. [2018-06-26 20:40:34,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:34,812 INFO ]: Finished difference Result 88 states and 4696 transitions. [2018-06-26 20:40:34,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:34,812 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:40:34,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:34,815 INFO ]: With dead ends: 88 [2018-06-26 20:40:34,815 INFO ]: Without dead ends: 88 [2018-06-26 20:40:34,815 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-26 20:40:34,816 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-26 20:40:34,833 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 68. [2018-06-26 20:40:34,833 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-26 20:40:34,835 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 4256 transitions. [2018-06-26 20:40:34,836 INFO ]: Start accepts. Automaton has 68 states and 4256 transitions. Word has length 12 [2018-06-26 20:40:34,836 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:34,836 INFO ]: Abstraction has 68 states and 4256 transitions. [2018-06-26 20:40:34,836 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:34,836 INFO ]: Start isEmpty. Operand 68 states and 4256 transitions. [2018-06-26 20:40:34,837 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:40:34,837 INFO ]: Found error trace [2018-06-26 20:40:34,837 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:34,837 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:34,837 INFO ]: Analyzing trace with hash -17751629, now seen corresponding path program 1 times [2018-06-26 20:40:34,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:34,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:34,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:34,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:34,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:34,863 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:34,938 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:40:34,938 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:34,938 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:34,938 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:34,938 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:34,938 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:34,938 INFO ]: Start difference. First operand 68 states and 4256 transitions. Second operand 3 states. [2018-06-26 20:40:36,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:36,305 INFO ]: Finished difference Result 70 states and 3568 transitions. [2018-06-26 20:40:36,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:36,305 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:40:36,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:36,307 INFO ]: With dead ends: 70 [2018-06-26 20:40:36,307 INFO ]: Without dead ends: 70 [2018-06-26 20:40:36,307 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-26 20:40:36,308 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-26 20:40:36,316 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-26 20:40:36,316 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-26 20:40:36,318 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 3568 transitions. [2018-06-26 20:40:36,318 INFO ]: Start accepts. Automaton has 70 states and 3568 transitions. Word has length 12 [2018-06-26 20:40:36,318 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:36,318 INFO ]: Abstraction has 70 states and 3568 transitions. [2018-06-26 20:40:36,318 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:36,318 INFO ]: Start isEmpty. Operand 70 states and 3568 transitions. [2018-06-26 20:40:36,320 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:40:36,320 INFO ]: Found error trace [2018-06-26 20:40:36,320 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:36,320 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:36,320 INFO ]: Analyzing trace with hash 1094762301, now seen corresponding path program 1 times [2018-06-26 20:40:36,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:36,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:36,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:36,321 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:36,321 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:36,344 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:36,420 INFO ]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-26 20:40:36,420 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:36,420 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:36,420 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:36,420 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:36,420 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:36,421 INFO ]: Start difference. First operand 70 states and 3568 transitions. Second operand 3 states. [2018-06-26 20:40:38,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:38,102 INFO ]: Finished difference Result 127 states and 6354 transitions. [2018-06-26 20:40:38,277 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:38,277 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:40:38,277 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:38,281 INFO ]: With dead ends: 127 [2018-06-26 20:40:38,281 INFO ]: Without dead ends: 127 [2018-06-26 20:40:38,281 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 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-26 20:40:38,281 INFO ]: Start minimizeSevpa. Operand 127 states. [2018-06-26 20:40:38,298 INFO ]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-06-26 20:40:38,298 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-26 20:40:38,305 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 6354 transitions. [2018-06-26 20:40:38,305 INFO ]: Start accepts. Automaton has 127 states and 6354 transitions. Word has length 12 [2018-06-26 20:40:38,305 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:38,306 INFO ]: Abstraction has 127 states and 6354 transitions. [2018-06-26 20:40:38,306 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:38,306 INFO ]: Start isEmpty. Operand 127 states and 6354 transitions. [2018-06-26 20:40:38,308 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:40:38,308 INFO ]: Found error trace [2018-06-26 20:40:38,308 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:38,308 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:38,309 INFO ]: Analyzing trace with hash -1196164425, now seen corresponding path program 1 times [2018-06-26 20:40:38,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:38,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:38,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:38,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:38,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:38,331 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:38,414 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:40:38,414 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:38,414 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:38,414 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:38,414 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:38,414 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:38,414 INFO ]: Start difference. First operand 127 states and 6354 transitions. Second operand 3 states. [2018-06-26 20:40:39,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:39,702 INFO ]: Finished difference Result 139 states and 7162 transitions. [2018-06-26 20:40:39,702 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:39,702 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:40:39,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:39,707 INFO ]: With dead ends: 139 [2018-06-26 20:40:39,707 INFO ]: Without dead ends: 139 [2018-06-26 20:40:39,707 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-26 20:40:39,707 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-26 20:40:39,720 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 127. [2018-06-26 20:40:39,720 INFO ]: Start removeUnreachable. Operand 127 states. [2018-06-26 20:40:39,724 INFO ]: Finished removeUnreachable. Reduced from 127 states to 127 states and 6354 transitions. [2018-06-26 20:40:39,724 INFO ]: Start accepts. Automaton has 127 states and 6354 transitions. Word has length 12 [2018-06-26 20:40:39,724 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:39,724 INFO ]: Abstraction has 127 states and 6354 transitions. [2018-06-26 20:40:39,724 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:39,724 INFO ]: Start isEmpty. Operand 127 states and 6354 transitions. [2018-06-26 20:40:39,727 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:40:39,727 INFO ]: Found error trace [2018-06-26 20:40:39,727 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:39,727 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:39,727 INFO ]: Analyzing trace with hash -1654825487, now seen corresponding path program 1 times [2018-06-26 20:40:39,727 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:39,727 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:39,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:39,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:39,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:39,746 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:39,830 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-26 20:40:39,830 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:39,830 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:39,830 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:39,830 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:39,830 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:39,830 INFO ]: Start difference. First operand 127 states and 6354 transitions. Second operand 3 states. [2018-06-26 20:40:41,230 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:41,230 INFO ]: Finished difference Result 205 states and 8830 transitions. [2018-06-26 20:40:41,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:41,230 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:40:41,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:41,238 INFO ]: With dead ends: 205 [2018-06-26 20:40:41,238 INFO ]: Without dead ends: 205 [2018-06-26 20:40:41,239 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-26 20:40:41,239 INFO ]: Start minimizeSevpa. Operand 205 states. [2018-06-26 20:40:41,259 INFO ]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-06-26 20:40:41,259 INFO ]: Start removeUnreachable. Operand 205 states. [2018-06-26 20:40:41,265 INFO ]: Finished removeUnreachable. Reduced from 205 states to 205 states and 8830 transitions. [2018-06-26 20:40:41,266 INFO ]: Start accepts. Automaton has 205 states and 8830 transitions. Word has length 12 [2018-06-26 20:40:41,266 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:41,266 INFO ]: Abstraction has 205 states and 8830 transitions. [2018-06-26 20:40:41,266 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:41,266 INFO ]: Start isEmpty. Operand 205 states and 8830 transitions. [2018-06-26 20:40:41,270 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:40:41,270 INFO ]: Found error trace [2018-06-26 20:40:41,270 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:41,270 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:41,270 INFO ]: Analyzing trace with hash -2068891770, now seen corresponding path program 1 times [2018-06-26 20:40:41,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:41,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:41,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:41,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:41,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:41,296 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:41,385 INFO ]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 20:40:41,385 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:41,385 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:41,386 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:41,386 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:41,386 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:41,386 INFO ]: Start difference. First operand 205 states and 8830 transitions. Second operand 3 states. [2018-06-26 20:40:42,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:42,808 INFO ]: Finished difference Result 225 states and 10150 transitions. [2018-06-26 20:40:42,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:42,808 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:40:42,808 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:42,823 INFO ]: With dead ends: 225 [2018-06-26 20:40:42,823 INFO ]: Without dead ends: 225 [2018-06-26 20:40:42,823 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-26 20:40:42,823 INFO ]: Start minimizeSevpa. Operand 225 states. [2018-06-26 20:40:42,851 INFO ]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-06-26 20:40:42,851 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-26 20:40:42,858 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 10150 transitions. [2018-06-26 20:40:42,858 INFO ]: Start accepts. Automaton has 225 states and 10150 transitions. Word has length 12 [2018-06-26 20:40:42,858 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:42,858 INFO ]: Abstraction has 225 states and 10150 transitions. [2018-06-26 20:40:42,858 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:42,858 INFO ]: Start isEmpty. Operand 225 states and 10150 transitions. [2018-06-26 20:40:42,863 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:40:42,863 INFO ]: Found error trace [2018-06-26 20:40:42,863 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:42,863 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:42,863 INFO ]: Analyzing trace with hash -1576574977, now seen corresponding path program 1 times [2018-06-26 20:40:42,863 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:42,863 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:42,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:42,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:42,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:42,890 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:42,992 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:40:42,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:42,992 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:42,992 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:42,992 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:42,992 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:42,992 INFO ]: Start difference. First operand 225 states and 10150 transitions. Second operand 3 states. [2018-06-26 20:40:44,268 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:44,268 INFO ]: Finished difference Result 245 states and 11470 transitions. [2018-06-26 20:40:44,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:44,270 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:40:44,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:44,277 INFO ]: With dead ends: 245 [2018-06-26 20:40:44,277 INFO ]: Without dead ends: 245 [2018-06-26 20:40:44,277 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-26 20:40:44,278 INFO ]: Start minimizeSevpa. Operand 245 states. [2018-06-26 20:40:44,295 INFO ]: Finished minimizeSevpa. Reduced states from 245 to 225. [2018-06-26 20:40:44,295 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-26 20:40:44,302 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 10150 transitions. [2018-06-26 20:40:44,302 INFO ]: Start accepts. Automaton has 225 states and 10150 transitions. Word has length 13 [2018-06-26 20:40:44,303 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:44,303 INFO ]: Abstraction has 225 states and 10150 transitions. [2018-06-26 20:40:44,303 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:44,303 INFO ]: Start isEmpty. Operand 225 states and 10150 transitions. [2018-06-26 20:40:44,306 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:40:44,306 INFO ]: Found error trace [2018-06-26 20:40:44,306 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:44,307 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:44,307 INFO ]: Analyzing trace with hash -1546756534, now seen corresponding path program 1 times [2018-06-26 20:40:44,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:44,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:44,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:44,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:44,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:44,333 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:44,415 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:40:44,415 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:44,415 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:44,415 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:44,415 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:44,415 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:44,415 INFO ]: Start difference. First operand 225 states and 10150 transitions. Second operand 3 states. [2018-06-26 20:40:45,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:45,974 INFO ]: Finished difference Result 400 states and 17480 transitions. [2018-06-26 20:40:45,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:45,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:40:45,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:45,986 INFO ]: With dead ends: 400 [2018-06-26 20:40:45,986 INFO ]: Without dead ends: 400 [2018-06-26 20:40:45,986 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-26 20:40:45,987 INFO ]: Start minimizeSevpa. Operand 400 states. [2018-06-26 20:40:46,011 INFO ]: Finished minimizeSevpa. Reduced states from 400 to 220. [2018-06-26 20:40:46,011 INFO ]: Start removeUnreachable. Operand 220 states. [2018-06-26 20:40:46,018 INFO ]: Finished removeUnreachable. Reduced from 220 states to 220 states and 10264 transitions. [2018-06-26 20:40:46,018 INFO ]: Start accepts. Automaton has 220 states and 10264 transitions. Word has length 13 [2018-06-26 20:40:46,019 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:46,019 INFO ]: Abstraction has 220 states and 10264 transitions. [2018-06-26 20:40:46,019 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:46,019 INFO ]: Start isEmpty. Operand 220 states and 10264 transitions. [2018-06-26 20:40:46,024 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:40:46,024 INFO ]: Found error trace [2018-06-26 20:40:46,024 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:46,024 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:46,024 INFO ]: Analyzing trace with hash -802398608, now seen corresponding path program 1 times [2018-06-26 20:40:46,024 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:46,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:46,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:46,025 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:46,025 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:46,043 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:46,121 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:40:46,121 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:46,122 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:46,122 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:46,122 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:46,122 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:46,122 INFO ]: Start difference. First operand 220 states and 10264 transitions. Second operand 3 states. [2018-06-26 20:40:47,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:47,673 INFO ]: Finished difference Result 380 states and 16952 transitions. [2018-06-26 20:40:47,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:47,675 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:40:47,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:47,684 INFO ]: With dead ends: 380 [2018-06-26 20:40:47,684 INFO ]: Without dead ends: 380 [2018-06-26 20:40:47,684 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-26 20:40:47,685 INFO ]: Start minimizeSevpa. Operand 380 states. [2018-06-26 20:40:47,711 INFO ]: Finished minimizeSevpa. Reduced states from 380 to 240. [2018-06-26 20:40:47,711 INFO ]: Start removeUnreachable. Operand 240 states. [2018-06-26 20:40:47,718 INFO ]: Finished removeUnreachable. Reduced from 240 states to 240 states and 11696 transitions. [2018-06-26 20:40:47,718 INFO ]: Start accepts. Automaton has 240 states and 11696 transitions. Word has length 13 [2018-06-26 20:40:47,718 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:47,718 INFO ]: Abstraction has 240 states and 11696 transitions. [2018-06-26 20:40:47,718 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:47,718 INFO ]: Start isEmpty. Operand 240 states and 11696 transitions. [2018-06-26 20:40:47,721 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:40:47,721 INFO ]: Found error trace [2018-06-26 20:40:47,721 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:47,721 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:47,721 INFO ]: Analyzing trace with hash 1280985676, now seen corresponding path program 1 times [2018-06-26 20:40:47,722 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:47,722 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:47,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:47,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:47,722 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:47,742 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:47,811 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:40:47,811 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:47,811 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:47,812 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:47,812 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:47,812 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:47,812 INFO ]: Start difference. First operand 240 states and 11696 transitions. Second operand 3 states. [2018-06-26 20:40:49,390 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:49,390 INFO ]: Finished difference Result 390 states and 17228 transitions. [2018-06-26 20:40:49,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:49,390 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:40:49,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:49,399 INFO ]: With dead ends: 390 [2018-06-26 20:40:49,399 INFO ]: Without dead ends: 390 [2018-06-26 20:40:49,399 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-26 20:40:49,400 INFO ]: Start minimizeSevpa. Operand 390 states. [2018-06-26 20:40:49,437 INFO ]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-06-26 20:40:49,437 INFO ]: Start removeUnreachable. Operand 390 states. [2018-06-26 20:40:49,448 INFO ]: Finished removeUnreachable. Reduced from 390 states to 390 states and 17228 transitions. [2018-06-26 20:40:49,449 INFO ]: Start accepts. Automaton has 390 states and 17228 transitions. Word has length 13 [2018-06-26 20:40:49,449 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:49,449 INFO ]: Abstraction has 390 states and 17228 transitions. [2018-06-26 20:40:49,449 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:49,449 INFO ]: Start isEmpty. Operand 390 states and 17228 transitions. [2018-06-26 20:40:49,453 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 20:40:49,453 INFO ]: Found error trace [2018-06-26 20:40:49,453 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:49,453 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:49,453 INFO ]: Analyzing trace with hash 919439671, now seen corresponding path program 1 times [2018-06-26 20:40:49,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:49,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:49,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:49,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:49,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:49,483 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:49,566 INFO ]: Checked inductivity of 66 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-26 20:40:49,566 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:49,566 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:49,566 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:49,566 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:49,566 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:49,567 INFO ]: Start difference. First operand 390 states and 17228 transitions. Second operand 3 states. [2018-06-26 20:40:51,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:51,031 INFO ]: Finished difference Result 390 states and 16468 transitions. [2018-06-26 20:40:51,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:51,032 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-26 20:40:51,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:51,040 INFO ]: With dead ends: 390 [2018-06-26 20:40:51,040 INFO ]: Without dead ends: 390 [2018-06-26 20:40:51,041 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-26 20:40:51,041 INFO ]: Start minimizeSevpa. Operand 390 states. [2018-06-26 20:40:51,078 INFO ]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-06-26 20:40:51,078 INFO ]: Start removeUnreachable. Operand 390 states. [2018-06-26 20:40:51,087 INFO ]: Finished removeUnreachable. Reduced from 390 states to 390 states and 16468 transitions. [2018-06-26 20:40:51,087 INFO ]: Start accepts. Automaton has 390 states and 16468 transitions. Word has length 16 [2018-06-26 20:40:51,088 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:51,088 INFO ]: Abstraction has 390 states and 16468 transitions. [2018-06-26 20:40:51,088 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:51,088 INFO ]: Start isEmpty. Operand 390 states and 16468 transitions. [2018-06-26 20:40:51,092 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:40:51,092 INFO ]: Found error trace [2018-06-26 20:40:51,092 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:51,092 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:51,092 INFO ]: Analyzing trace with hash -1723593619, now seen corresponding path program 1 times [2018-06-26 20:40:51,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:51,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:51,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:51,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:51,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:51,123 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:51,205 INFO ]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-26 20:40:51,205 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:51,205 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:51,205 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:51,205 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:51,205 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:51,205 INFO ]: Start difference. First operand 390 states and 16468 transitions. Second operand 3 states. [2018-06-26 20:40:52,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:52,462 INFO ]: Finished difference Result 407 states and 12772 transitions. [2018-06-26 20:40:52,463 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:52,463 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-26 20:40:52,463 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:52,467 INFO ]: With dead ends: 407 [2018-06-26 20:40:52,467 INFO ]: Without dead ends: 407 [2018-06-26 20:40:52,467 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-26 20:40:52,468 INFO ]: Start minimizeSevpa. Operand 407 states. [2018-06-26 20:40:52,489 INFO ]: Finished minimizeSevpa. Reduced states from 407 to 267. [2018-06-26 20:40:52,489 INFO ]: Start removeUnreachable. Operand 267 states. [2018-06-26 20:40:52,495 INFO ]: Finished removeUnreachable. Reduced from 267 states to 267 states and 8684 transitions. [2018-06-26 20:40:52,495 INFO ]: Start accepts. Automaton has 267 states and 8684 transitions. Word has length 17 [2018-06-26 20:40:52,495 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:52,495 INFO ]: Abstraction has 267 states and 8684 transitions. [2018-06-26 20:40:52,495 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:52,495 INFO ]: Start isEmpty. Operand 267 states and 8684 transitions. [2018-06-26 20:40:52,497 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:40:52,498 INFO ]: Found error trace [2018-06-26 20:40:52,498 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:52,498 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:52,498 INFO ]: Analyzing trace with hash -1658717937, now seen corresponding path program 1 times [2018-06-26 20:40:52,498 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:52,498 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:52,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:52,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:52,498 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:52,526 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:52,609 INFO ]: Checked inductivity of 105 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-26 20:40:52,609 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:40:52,609 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-26 20:40:52,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:53,034 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:53,056 INFO ]: Computing forward predicates... [2018-06-26 20:40:53,133 INFO ]: Checked inductivity of 105 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-06-26 20:40:53,161 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 20:40:53,161 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-26 20:40:53,162 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:40:53,162 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:40:53,162 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:40:53,162 INFO ]: Start difference. First operand 267 states and 8684 transitions. Second operand 6 states. [2018-06-26 20:40:57,554 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:57,554 INFO ]: Finished difference Result 327 states and 5878 transitions. [2018-06-26 20:40:57,554 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 20:40:57,554 INFO ]: Start accepts. Automaton has 6 states. Word has length 19 [2018-06-26 20:40:57,554 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:57,570 INFO ]: With dead ends: 327 [2018-06-26 20:40:57,570 INFO ]: Without dead ends: 327 [2018-06-26 20:40:57,570 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 20:40:57,571 INFO ]: Start minimizeSevpa. Operand 327 states. [2018-06-26 20:40:57,597 INFO ]: Finished minimizeSevpa. Reduced states from 327 to 292. [2018-06-26 20:40:57,597 INFO ]: Start removeUnreachable. Operand 292 states. [2018-06-26 20:40:57,601 INFO ]: Finished removeUnreachable. Reduced from 292 states to 292 states and 5738 transitions. [2018-06-26 20:40:57,601 INFO ]: Start accepts. Automaton has 292 states and 5738 transitions. Word has length 19 [2018-06-26 20:40:57,602 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:57,602 INFO ]: Abstraction has 292 states and 5738 transitions. [2018-06-26 20:40:57,602 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:40:57,602 INFO ]: Start isEmpty. Operand 292 states and 5738 transitions. [2018-06-26 20:40:57,606 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:40:57,606 INFO ]: Found error trace [2018-06-26 20:40:57,606 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:57,606 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:57,606 INFO ]: Analyzing trace with hash 201421728, now seen corresponding path program 1 times [2018-06-26 20:40:57,606 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:57,606 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:57,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:57,607 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:57,607 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:57,640 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:57,732 INFO ]: Checked inductivity of 105 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-26 20:40:57,733 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:57,733 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:57,733 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:57,733 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:57,733 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:57,733 INFO ]: Start difference. First operand 292 states and 5738 transitions. Second operand 3 states. [2018-06-26 20:40:59,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:40:59,799 INFO ]: Finished difference Result 292 states and 5278 transitions. [2018-06-26 20:40:59,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:40:59,799 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-26 20:40:59,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:40:59,802 INFO ]: With dead ends: 292 [2018-06-26 20:40:59,802 INFO ]: Without dead ends: 292 [2018-06-26 20:40:59,802 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-26 20:40:59,803 INFO ]: Start minimizeSevpa. Operand 292 states. [2018-06-26 20:40:59,820 INFO ]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-06-26 20:40:59,820 INFO ]: Start removeUnreachable. Operand 292 states. [2018-06-26 20:40:59,824 INFO ]: Finished removeUnreachable. Reduced from 292 states to 292 states and 5278 transitions. [2018-06-26 20:40:59,824 INFO ]: Start accepts. Automaton has 292 states and 5278 transitions. Word has length 19 [2018-06-26 20:40:59,824 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:40:59,824 INFO ]: Abstraction has 292 states and 5278 transitions. [2018-06-26 20:40:59,824 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:40:59,824 INFO ]: Start isEmpty. Operand 292 states and 5278 transitions. [2018-06-26 20:40:59,826 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 20:40:59,826 INFO ]: Found error trace [2018-06-26 20:40:59,826 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:40:59,826 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:40:59,826 INFO ]: Analyzing trace with hash 734196444, now seen corresponding path program 1 times [2018-06-26 20:40:59,826 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:40:59,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:40:59,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:59,828 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:40:59,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:40:59,852 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:40:59,949 INFO ]: Checked inductivity of 105 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-26 20:40:59,949 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:40:59,949 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:40:59,949 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:40:59,949 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:40:59,949 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:40:59,949 INFO ]: Start difference. First operand 292 states and 5278 transitions. Second operand 3 states. [2018-06-26 20:41:01,521 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:01,521 INFO ]: Finished difference Result 547 states and 9197 transitions. [2018-06-26 20:41:01,522 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:01,522 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-26 20:41:01,522 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:01,534 INFO ]: With dead ends: 547 [2018-06-26 20:41:01,534 INFO ]: Without dead ends: 507 [2018-06-26 20:41:01,534 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-26 20:41:01,534 INFO ]: Start minimizeSevpa. Operand 507 states. [2018-06-26 20:41:01,560 INFO ]: Finished minimizeSevpa. Reduced states from 507 to 484. [2018-06-26 20:41:01,560 INFO ]: Start removeUnreachable. Operand 484 states. [2018-06-26 20:41:01,565 INFO ]: Finished removeUnreachable. Reduced from 484 states to 484 states and 7307 transitions. [2018-06-26 20:41:01,565 INFO ]: Start accepts. Automaton has 484 states and 7307 transitions. Word has length 19 [2018-06-26 20:41:01,565 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:01,565 INFO ]: Abstraction has 484 states and 7307 transitions. [2018-06-26 20:41:01,565 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:01,565 INFO ]: Start isEmpty. Operand 484 states and 7307 transitions. [2018-06-26 20:41:01,569 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 20:41:01,569 INFO ]: Found error trace [2018-06-26 20:41:01,569 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:01,569 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:01,569 INFO ]: Analyzing trace with hash -1560820386, now seen corresponding path program 1 times [2018-06-26 20:41:01,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:01,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:01,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:01,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:01,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:01,602 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:01,756 INFO ]: Checked inductivity of 136 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 20:41:01,756 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:41:01,756 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-26 20:41:01,768 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-26 20:41:02,127 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:02,141 INFO ]: Computing forward predicates... [2018-06-26 20:41:02,241 INFO ]: Checked inductivity of 136 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-26 20:41:02,264 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:41:02,264 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:41:02,264 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:41:02,265 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:41:02,265 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:41:02,265 INFO ]: Start difference. First operand 484 states and 7307 transitions. Second operand 6 states. Received shutdown request... [2018-06-26 20:41:02,410 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 20:41:02,410 WARN ]: Verification canceled [2018-06-26 20:41:02,413 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:41:02,414 WARN ]: Timeout [2018-06-26 20:41:02,415 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:41:02 BasicIcfg [2018-06-26 20:41:02,415 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:41:02,415 INFO ]: Toolchain (without parser) took 63780.87 ms. Allocated memory was 304.1 MB in the beginning and 1.1 GB in the end (delta: 751.8 MB). Free memory was 242.5 MB in the beginning and 661.7 MB in the end (delta: -419.3 MB). Peak memory consumption was 332.6 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:02,418 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 304.1 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:41:02,418 INFO ]: ChcToBoogie took 89.99 ms. Allocated memory is still 304.1 MB. Free memory was 242.5 MB in the beginning and 239.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:02,419 INFO ]: Boogie Preprocessor took 72.92 ms. Allocated memory is still 304.1 MB. Free memory was 239.5 MB in the beginning and 237.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:02,419 INFO ]: RCFGBuilder took 446.99 ms. Allocated memory is still 304.1 MB. Free memory was 237.4 MB in the beginning and 210.0 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:02,419 INFO ]: BlockEncodingV2 took 1202.88 ms. Allocated memory was 304.1 MB in the beginning and 383.8 MB in the end (delta: 79.7 MB). Free memory was 210.0 MB in the beginning and 264.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 67.3 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:02,421 INFO ]: TraceAbstraction took 61950.51 ms. Allocated memory was 383.8 MB in the beginning and 1.1 GB in the end (delta: 672.1 MB). Free memory was 262.1 MB in the beginning and 661.7 MB in the end (delta: -399.6 MB). Peak memory consumption was 272.5 MB. Max. memory is 3.6 GB. [2018-06-26 20:41:02,424 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, 540 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 304.1 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 89.99 ms. Allocated memory is still 304.1 MB. Free memory was 242.5 MB in the beginning and 239.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 72.92 ms. Allocated memory is still 304.1 MB. Free memory was 239.5 MB in the beginning and 237.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 446.99 ms. Allocated memory is still 304.1 MB. Free memory was 237.4 MB in the beginning and 210.0 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1202.88 ms. Allocated memory was 304.1 MB in the beginning and 383.8 MB in the end (delta: 79.7 MB). Free memory was 210.0 MB in the beginning and 264.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 67.3 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61950.51 ms. Allocated memory was 383.8 MB in the beginning and 1.1 GB in the end (delta: 672.1 MB). Free memory was 262.1 MB in the beginning and 661.7 MB in the end (delta: -399.6 MB). Peak memory consumption was 272.5 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 (484states) and interpolant automaton (currently 6 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (11 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 61.8s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 56.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 152 SDtfs, 0 SDslu, 132 SDs, 0 SdLazy, 17707 SolverSat, 16072 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=484occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 570 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 6294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5762 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 33 InterpolantComputations, 30 PerfectInterpolantSequences, 1365/1370 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_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-41-02-623.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-41-02-623.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-41-02-623.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_3.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-41-02-623.csv Completed graceful shutdown