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_srvr_10.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:41:05,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:41:05,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:41:05,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:41:05,618 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:41:05,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:41:05,620 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:41:05,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:41:05,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:41:05,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:41:05,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:41:05,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:41:05,630 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:41:05,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:41:05,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:41:05,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:41:05,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:41:05,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:41:05,650 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:41:05,651 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:41:05,652 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:41:05,653 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:41:05,655 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:41:05,655 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:41:05,655 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:41:05,656 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:41:05,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:41:05,663 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:41:05,664 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:41:05,665 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:41:05,665 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:41:05,665 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:41:05,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:41:05,666 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:41:05,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:41:05,672 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:41:05,673 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:41:05,694 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:41:05,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:41:05,697 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:41:05,698 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:41:05,699 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:41:05,699 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:41:05,699 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:41:05,699 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:41:05,699 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:41:05,700 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:41:05,700 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:41:05,700 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:41:05,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:41:05,700 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:41:05,701 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:41:05,702 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:41:05,702 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:41:05,702 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:41:05,703 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:41:05,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:41:05,703 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:41:05,704 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:41:05,705 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:41:05,740 INFO ]: Repository-Root is: /tmp [2018-06-26 20:41:05,753 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:41:05,756 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:41:05,758 INFO ]: Initializing SmtParser... [2018-06-26 20:41:05,758 INFO ]: SmtParser initialized [2018-06-26 20:41:05,758 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_10.cil.smt2 [2018-06-26 20:41:05,760 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:41:05,849 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_10.cil.smt2 unknown [2018-06-26 20:41:06,363 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_10.cil.smt2 [2018-06-26 20:41:06,367 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:41:06,373 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:41:06,374 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:41:06,374 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:41:06,374 INFO ]: ChcToBoogie initialized [2018-06-26 20:41:06,377 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:41:06" (1/1) ... [2018-06-26 20:41:06,439 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06 Unit [2018-06-26 20:41:06,440 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:41:06,440 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:41:06,440 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:41:06,440 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:41:06,460 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06" (1/1) ... [2018-06-26 20:41:06,460 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06" (1/1) ... [2018-06-26 20:41:06,477 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06" (1/1) ... [2018-06-26 20:41:06,477 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06" (1/1) ... [2018-06-26 20:41:06,511 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06" (1/1) ... [2018-06-26 20:41:06,513 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06" (1/1) ... [2018-06-26 20:41:06,521 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06" (1/1) ... [2018-06-26 20:41:06,527 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:41:06,527 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:41:06,527 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:41:06,527 INFO ]: RCFGBuilder initialized [2018-06-26 20:41:06,528 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06" (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:41:06,538 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:41:06,538 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:41:06,538 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:41:06,538 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:41:06,538 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:41:06,538 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:41:06,988 INFO ]: Using library mode [2018-06-26 20:41:06,988 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:41:06 BoogieIcfgContainer [2018-06-26 20:41:06,988 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:41:06,989 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:41:06,989 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:41:06,991 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:41:06,992 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:41:06" (1/1) ... [2018-06-26 20:41:07,012 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:41:07,014 INFO ]: Using Remove infeasible edges [2018-06-26 20:41:07,015 INFO ]: Using Maximize final states [2018-06-26 20:41:07,015 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:41:07,015 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:41:07,017 INFO ]: Using Remove sink states [2018-06-26 20:41:07,018 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:41:07,018 INFO ]: Using Use SBE [2018-06-26 20:41:08,687 INFO ]: SBE split 1 edges [2018-06-26 20:41:08,776 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:41:08,778 INFO ]: 0 new accepting states [2018-06-26 20:41:08,831 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:41:08,833 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:41:08,938 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:41:08,938 INFO ]: 0 new accepting states [2018-06-26 20:41:08,939 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:41:08,940 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:41:09,082 INFO ]: Encoded RCFG 6 locations, 963 edges [2018-06-26 20:41:09,083 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:41:09 BasicIcfg [2018-06-26 20:41:09,083 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:41:09,084 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:41:09,084 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:41:09,087 INFO ]: TraceAbstraction initialized [2018-06-26 20:41:09,087 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:41:06" (1/4) ... [2018-06-26 20:41:09,090 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b99ba28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:41:09, skipping insertion in model container [2018-06-26 20:41:09,090 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:41:06" (2/4) ... [2018-06-26 20:41:09,090 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b99ba28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:41:09, skipping insertion in model container [2018-06-26 20:41:09,090 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:41:06" (3/4) ... [2018-06-26 20:41:09,090 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b99ba28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:41:09, skipping insertion in model container [2018-06-26 20:41:09,090 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:41:09" (4/4) ... [2018-06-26 20:41:09,092 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:41:09,103 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:41:09,113 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:41:09,155 INFO ]: Using default assertion order modulation [2018-06-26 20:41:09,156 INFO ]: Interprodecural is true [2018-06-26 20:41:09,156 INFO ]: Hoare is false [2018-06-26 20:41:09,156 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:41:09,156 INFO ]: Backedges is TWOTRACK [2018-06-26 20:41:09,156 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:41:09,156 INFO ]: Difference is false [2018-06-26 20:41:09,156 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:41:09,156 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:41:09,168 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:41:09,187 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:41:09,187 INFO ]: Found error trace [2018-06-26 20:41:09,187 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:41:09,188 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:09,192 INFO ]: Analyzing trace with hash 64862978, now seen corresponding path program 1 times [2018-06-26 20:41:09,193 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:09,193 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:09,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:09,225 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:09,225 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:09,294 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:09,411 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:41:09,414 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:09,415 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:09,417 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:09,431 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:09,432 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:09,439 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:41:15,754 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:15,754 INFO ]: Finished difference Result 7 states and 1099 transitions. [2018-06-26 20:41:15,754 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:15,755 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:41:15,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:15,773 INFO ]: With dead ends: 7 [2018-06-26 20:41:15,773 INFO ]: Without dead ends: 7 [2018-06-26 20:41:15,784 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:41:15,804 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:41:15,849 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:41:15,850 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:41:15,853 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1099 transitions. [2018-06-26 20:41:15,854 INFO ]: Start accepts. Automaton has 7 states and 1099 transitions. Word has length 5 [2018-06-26 20:41:15,855 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:15,855 INFO ]: Abstraction has 7 states and 1099 transitions. [2018-06-26 20:41:15,855 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:15,855 INFO ]: Start isEmpty. Operand 7 states and 1099 transitions. [2018-06-26 20:41:15,856 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:41:15,856 INFO ]: Found error trace [2018-06-26 20:41:15,856 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:41:15,856 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:15,856 INFO ]: Analyzing trace with hash 1990672382, now seen corresponding path program 1 times [2018-06-26 20:41:15,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:15,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:15,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:15,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:15,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:15,928 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:15,988 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:41:15,988 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:15,988 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:15,989 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:15,989 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:15,989 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:15,989 INFO ]: Start difference. First operand 7 states and 1099 transitions. Second operand 3 states. [2018-06-26 20:41:18,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:18,884 INFO ]: Finished difference Result 9 states and 1104 transitions. [2018-06-26 20:41:18,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:18,885 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:41:18,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:18,886 INFO ]: With dead ends: 9 [2018-06-26 20:41:18,886 INFO ]: Without dead ends: 9 [2018-06-26 20:41:18,886 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:41:18,887 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:41:18,894 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:41:18,894 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:41:18,896 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1104 transitions. [2018-06-26 20:41:18,896 INFO ]: Start accepts. Automaton has 9 states and 1104 transitions. Word has length 6 [2018-06-26 20:41:18,897 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:18,897 INFO ]: Abstraction has 9 states and 1104 transitions. [2018-06-26 20:41:18,897 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:18,898 INFO ]: Start isEmpty. Operand 9 states and 1104 transitions. [2018-06-26 20:41:18,899 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:41:18,899 INFO ]: Found error trace [2018-06-26 20:41:18,899 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:41:18,899 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:18,899 INFO ]: Analyzing trace with hash 2003959168, now seen corresponding path program 1 times [2018-06-26 20:41:18,899 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:18,899 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:18,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:18,900 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:18,900 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:18,929 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:18,974 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:41:18,974 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:18,974 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:18,975 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:18,975 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:18,975 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:18,975 INFO ]: Start difference. First operand 9 states and 1104 transitions. Second operand 3 states. [2018-06-26 20:41:21,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:21,033 INFO ]: Finished difference Result 9 states and 1099 transitions. [2018-06-26 20:41:21,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:21,034 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:41:21,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:21,035 INFO ]: With dead ends: 9 [2018-06-26 20:41:21,035 INFO ]: Without dead ends: 9 [2018-06-26 20:41:21,035 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:41:21,035 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:41:21,045 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:41:21,045 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:41:21,047 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1099 transitions. [2018-06-26 20:41:21,047 INFO ]: Start accepts. Automaton has 9 states and 1099 transitions. Word has length 6 [2018-06-26 20:41:21,047 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:21,047 INFO ]: Abstraction has 9 states and 1099 transitions. [2018-06-26 20:41:21,047 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:21,047 INFO ]: Start isEmpty. Operand 9 states and 1099 transitions. [2018-06-26 20:41:21,049 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 20:41:21,049 INFO ]: Found error trace [2018-06-26 20:41:21,049 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:21,049 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:21,049 INFO ]: Analyzing trace with hash 1973112128, now seen corresponding path program 1 times [2018-06-26 20:41:21,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:21,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:21,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:21,050 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:21,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:21,080 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:21,117 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:41:21,117 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:21,117 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:21,117 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:21,118 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:21,118 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:21,118 INFO ]: Start difference. First operand 9 states and 1099 transitions. Second operand 3 states. [2018-06-26 20:41:23,945 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:23,946 INFO ]: Finished difference Result 9 states and 553 transitions. [2018-06-26 20:41:23,946 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:23,946 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 20:41:23,946 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:23,946 INFO ]: With dead ends: 9 [2018-06-26 20:41:23,946 INFO ]: Without dead ends: 9 [2018-06-26 20:41:23,946 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:41:23,947 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:41:23,949 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:41:23,949 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:41:23,950 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 553 transitions. [2018-06-26 20:41:23,951 INFO ]: Start accepts. Automaton has 9 states and 553 transitions. Word has length 7 [2018-06-26 20:41:23,951 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:23,951 INFO ]: Abstraction has 9 states and 553 transitions. [2018-06-26 20:41:23,952 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:23,952 INFO ]: Start isEmpty. Operand 9 states and 553 transitions. [2018-06-26 20:41:23,953 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:41:23,953 INFO ]: Found error trace [2018-06-26 20:41:23,953 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:23,953 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:23,953 INFO ]: Analyzing trace with hash 1615295496, now seen corresponding path program 1 times [2018-06-26 20:41:23,953 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:23,953 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:23,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:23,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:23,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:23,993 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:24,088 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:41:24,089 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:24,089 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:24,089 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:24,089 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:24,089 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:24,089 INFO ]: Start difference. First operand 9 states and 553 transitions. Second operand 3 states. [2018-06-26 20:41:26,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:26,539 INFO ]: Finished difference Result 10 states and 661 transitions. [2018-06-26 20:41:26,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:26,541 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:41:26,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:26,542 INFO ]: With dead ends: 10 [2018-06-26 20:41:26,542 INFO ]: Without dead ends: 10 [2018-06-26 20:41:26,543 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:41:26,543 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 20:41:26,546 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 20:41:26,546 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 20:41:26,547 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 661 transitions. [2018-06-26 20:41:26,548 INFO ]: Start accepts. Automaton has 10 states and 661 transitions. Word has length 8 [2018-06-26 20:41:26,548 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:26,548 INFO ]: Abstraction has 10 states and 661 transitions. [2018-06-26 20:41:26,548 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:26,548 INFO ]: Start isEmpty. Operand 10 states and 661 transitions. [2018-06-26 20:41:26,548 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:41:26,548 INFO ]: Found error trace [2018-06-26 20:41:26,548 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:26,548 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:26,549 INFO ]: Analyzing trace with hash -1492915280, now seen corresponding path program 1 times [2018-06-26 20:41:26,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:26,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:26,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:26,549 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:26,549 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:26,597 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:26,694 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:41:26,694 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:26,694 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:26,695 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:26,695 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:26,695 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:26,695 INFO ]: Start difference. First operand 10 states and 661 transitions. Second operand 3 states. [2018-06-26 20:41:29,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:29,138 INFO ]: Finished difference Result 11 states and 953 transitions. [2018-06-26 20:41:29,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:29,138 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:41:29,138 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:29,139 INFO ]: With dead ends: 11 [2018-06-26 20:41:29,139 INFO ]: Without dead ends: 11 [2018-06-26 20:41:29,139 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:41:29,140 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:41:29,144 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 20:41:29,145 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 20:41:29,148 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 953 transitions. [2018-06-26 20:41:29,148 INFO ]: Start accepts. Automaton has 11 states and 953 transitions. Word has length 9 [2018-06-26 20:41:29,148 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:29,148 INFO ]: Abstraction has 11 states and 953 transitions. [2018-06-26 20:41:29,148 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:29,148 INFO ]: Start isEmpty. Operand 11 states and 953 transitions. [2018-06-26 20:41:29,149 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:41:29,149 INFO ]: Found error trace [2018-06-26 20:41:29,149 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:29,149 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:29,149 INFO ]: Analyzing trace with hash -1226017711, now seen corresponding path program 1 times [2018-06-26 20:41:29,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:29,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:29,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:29,150 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:29,150 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:29,183 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:29,278 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:41:29,278 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:29,279 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:29,279 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:29,279 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:29,279 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:29,279 INFO ]: Start difference. First operand 11 states and 953 transitions. Second operand 3 states. [2018-06-26 20:41:31,473 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:31,473 INFO ]: Finished difference Result 12 states and 1143 transitions. [2018-06-26 20:41:31,474 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:31,474 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:41:31,474 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:31,476 INFO ]: With dead ends: 12 [2018-06-26 20:41:31,476 INFO ]: Without dead ends: 12 [2018-06-26 20:41:31,476 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:41:31,476 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 20:41:31,481 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 20:41:31,481 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:41:31,482 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1143 transitions. [2018-06-26 20:41:31,482 INFO ]: Start accepts. Automaton has 12 states and 1143 transitions. Word has length 9 [2018-06-26 20:41:31,482 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:31,482 INFO ]: Abstraction has 12 states and 1143 transitions. [2018-06-26 20:41:31,482 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:31,482 INFO ]: Start isEmpty. Operand 12 states and 1143 transitions. [2018-06-26 20:41:31,483 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:41:31,483 INFO ]: Found error trace [2018-06-26 20:41:31,483 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:31,483 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:31,483 INFO ]: Analyzing trace with hash 1174143369, now seen corresponding path program 1 times [2018-06-26 20:41:31,483 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:31,483 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:31,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:31,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:31,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:31,519 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:31,612 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:41:31,613 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:31,613 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:31,613 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:31,613 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:31,613 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:31,613 INFO ]: Start difference. First operand 12 states and 1143 transitions. Second operand 3 states. [2018-06-26 20:41:34,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:34,705 INFO ]: Finished difference Result 13 states and 1459 transitions. [2018-06-26 20:41:34,705 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:34,705 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:41:34,705 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:34,707 INFO ]: With dead ends: 13 [2018-06-26 20:41:34,707 INFO ]: Without dead ends: 13 [2018-06-26 20:41:34,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:41:34,707 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:41:34,715 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 20:41:34,715 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 20:41:34,717 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1459 transitions. [2018-06-26 20:41:34,717 INFO ]: Start accepts. Automaton has 13 states and 1459 transitions. Word has length 10 [2018-06-26 20:41:34,717 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:34,717 INFO ]: Abstraction has 13 states and 1459 transitions. [2018-06-26 20:41:34,717 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:34,717 INFO ]: Start isEmpty. Operand 13 states and 1459 transitions. [2018-06-26 20:41:34,718 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:41:34,718 INFO ]: Found error trace [2018-06-26 20:41:34,718 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:34,718 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:34,718 INFO ]: Analyzing trace with hash 729929768, now seen corresponding path program 1 times [2018-06-26 20:41:34,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:34,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:34,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:34,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:34,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:34,747 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:34,834 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:41:34,834 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:34,834 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:34,834 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:34,834 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:34,834 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:34,834 INFO ]: Start difference. First operand 13 states and 1459 transitions. Second operand 3 states. [2018-06-26 20:41:37,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:37,485 INFO ]: Finished difference Result 18 states and 2448 transitions. [2018-06-26 20:41:37,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:37,485 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:41:37,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:37,488 INFO ]: With dead ends: 18 [2018-06-26 20:41:37,488 INFO ]: Without dead ends: 18 [2018-06-26 20:41:37,488 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:41:37,488 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 20:41:37,499 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 20:41:37,499 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 20:41:37,502 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2448 transitions. [2018-06-26 20:41:37,502 INFO ]: Start accepts. Automaton has 18 states and 2448 transitions. Word has length 10 [2018-06-26 20:41:37,502 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:37,502 INFO ]: Abstraction has 18 states and 2448 transitions. [2018-06-26 20:41:37,502 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:37,502 INFO ]: Start isEmpty. Operand 18 states and 2448 transitions. [2018-06-26 20:41:37,503 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:41:37,503 INFO ]: Found error trace [2018-06-26 20:41:37,503 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:37,503 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:37,504 INFO ]: Analyzing trace with hash 778191188, now seen corresponding path program 1 times [2018-06-26 20:41:37,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:37,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:37,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:37,504 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:37,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:37,534 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:37,624 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:41:37,625 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:37,625 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:37,625 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:37,625 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:37,625 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:37,625 INFO ]: Start difference. First operand 18 states and 2448 transitions. Second operand 3 states. [2018-06-26 20:41:40,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:40,172 INFO ]: Finished difference Result 28 states and 4884 transitions. [2018-06-26 20:41:40,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:40,173 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:41:40,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:40,177 INFO ]: With dead ends: 28 [2018-06-26 20:41:40,177 INFO ]: Without dead ends: 28 [2018-06-26 20:41:40,177 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:41:40,177 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 20:41:40,188 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-26 20:41:40,188 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:41:40,191 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3358 transitions. [2018-06-26 20:41:40,191 INFO ]: Start accepts. Automaton has 20 states and 3358 transitions. Word has length 10 [2018-06-26 20:41:40,191 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:40,191 INFO ]: Abstraction has 20 states and 3358 transitions. [2018-06-26 20:41:40,191 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:40,191 INFO ]: Start isEmpty. Operand 20 states and 3358 transitions. [2018-06-26 20:41:40,195 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:41:40,195 INFO ]: Found error trace [2018-06-26 20:41:40,195 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:40,195 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:40,195 INFO ]: Analyzing trace with hash 828984843, now seen corresponding path program 1 times [2018-06-26 20:41:40,195 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:40,195 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:40,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:40,196 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:40,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:40,226 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:40,304 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:41:40,304 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:40,304 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:40,304 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:40,304 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:40,304 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:40,304 INFO ]: Start difference. First operand 20 states and 3358 transitions. Second operand 3 states. [2018-06-26 20:41:42,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:42,861 INFO ]: Finished difference Result 30 states and 5674 transitions. [2018-06-26 20:41:42,861 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:42,861 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:41:42,861 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:42,867 INFO ]: With dead ends: 30 [2018-06-26 20:41:42,867 INFO ]: Without dead ends: 30 [2018-06-26 20:41:42,867 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:41:42,867 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 20:41:42,884 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 20:41:42,884 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 20:41:42,890 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5674 transitions. [2018-06-26 20:41:42,890 INFO ]: Start accepts. Automaton has 30 states and 5674 transitions. Word has length 10 [2018-06-26 20:41:42,890 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:42,890 INFO ]: Abstraction has 30 states and 5674 transitions. [2018-06-26 20:41:42,890 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:42,890 INFO ]: Start isEmpty. Operand 30 states and 5674 transitions. [2018-06-26 20:41:42,892 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:41:42,892 INFO ]: Found error trace [2018-06-26 20:41:42,892 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:42,892 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:42,892 INFO ]: Analyzing trace with hash -1806387773, now seen corresponding path program 1 times [2018-06-26 20:41:42,892 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:42,892 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:42,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:42,893 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:42,893 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:42,923 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:42,997 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:41:42,997 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:42,997 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:42,997 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:42,997 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:42,997 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:42,997 INFO ]: Start difference. First operand 30 states and 5674 transitions. Second operand 3 states. [2018-06-26 20:41:45,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:45,503 INFO ]: Finished difference Result 40 states and 7400 transitions. [2018-06-26 20:41:45,503 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:45,503 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:41:45,503 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:45,508 INFO ]: With dead ends: 40 [2018-06-26 20:41:45,508 INFO ]: Without dead ends: 40 [2018-06-26 20:41:45,509 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:41:45,509 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 20:41:45,518 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-26 20:41:45,518 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 20:41:45,523 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 7400 transitions. [2018-06-26 20:41:45,523 INFO ]: Start accepts. Automaton has 40 states and 7400 transitions. Word has length 10 [2018-06-26 20:41:45,524 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:45,524 INFO ]: Abstraction has 40 states and 7400 transitions. [2018-06-26 20:41:45,524 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:45,524 INFO ]: Start isEmpty. Operand 40 states and 7400 transitions. [2018-06-26 20:41:45,527 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 20:41:45,527 INFO ]: Found error trace [2018-06-26 20:41:45,527 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:45,527 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:45,527 INFO ]: Analyzing trace with hash -148153338, now seen corresponding path program 1 times [2018-06-26 20:41:45,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:45,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:45,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:45,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:45,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:45,565 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:45,658 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:41:45,658 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:45,659 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:45,659 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:45,659 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:45,659 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:45,659 INFO ]: Start difference. First operand 40 states and 7400 transitions. Second operand 3 states. [2018-06-26 20:41:48,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:48,434 INFO ]: Finished difference Result 50 states and 9166 transitions. [2018-06-26 20:41:48,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:48,434 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-26 20:41:48,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:48,440 INFO ]: With dead ends: 50 [2018-06-26 20:41:48,440 INFO ]: Without dead ends: 50 [2018-06-26 20:41:48,440 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:41:48,440 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-26 20:41:48,455 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-26 20:41:48,455 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-26 20:41:48,460 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 9166 transitions. [2018-06-26 20:41:48,460 INFO ]: Start accepts. Automaton has 50 states and 9166 transitions. Word has length 12 [2018-06-26 20:41:48,460 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:48,460 INFO ]: Abstraction has 50 states and 9166 transitions. [2018-06-26 20:41:48,460 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:48,460 INFO ]: Start isEmpty. Operand 50 states and 9166 transitions. [2018-06-26 20:41:48,462 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:48,462 INFO ]: Found error trace [2018-06-26 20:41:48,462 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:48,462 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:48,462 INFO ]: Analyzing trace with hash -1796221305, now seen corresponding path program 1 times [2018-06-26 20:41:48,462 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:48,462 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:48,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:48,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:48,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:48,499 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:48,595 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-26 20:41:48,595 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:48,596 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:48,596 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:48,596 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:48,596 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:48,596 INFO ]: Start difference. First operand 50 states and 9166 transitions. Second operand 3 states. [2018-06-26 20:41:51,341 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:51,342 INFO ]: Finished difference Result 92 states and 11211 transitions. [2018-06-26 20:41:51,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:51,342 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:51,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:51,348 INFO ]: With dead ends: 92 [2018-06-26 20:41:51,348 INFO ]: Without dead ends: 92 [2018-06-26 20:41:51,348 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:41:51,349 INFO ]: Start minimizeSevpa. Operand 92 states. [2018-06-26 20:41:51,366 INFO ]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-06-26 20:41:51,366 INFO ]: Start removeUnreachable. Operand 92 states. [2018-06-26 20:41:51,373 INFO ]: Finished removeUnreachable. Reduced from 92 states to 92 states and 11211 transitions. [2018-06-26 20:41:51,373 INFO ]: Start accepts. Automaton has 92 states and 11211 transitions. Word has length 13 [2018-06-26 20:41:51,373 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:51,373 INFO ]: Abstraction has 92 states and 11211 transitions. [2018-06-26 20:41:51,373 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:51,373 INFO ]: Start isEmpty. Operand 92 states and 11211 transitions. [2018-06-26 20:41:51,377 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 20:41:51,377 INFO ]: Found error trace [2018-06-26 20:41:51,377 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:51,377 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:51,377 INFO ]: Analyzing trace with hash -1414441863, now seen corresponding path program 1 times [2018-06-26 20:41:51,377 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:51,377 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:51,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:51,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:51,378 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:51,412 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:51,509 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:41:51,510 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:51,510 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:51,510 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:51,510 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:51,510 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:51,510 INFO ]: Start difference. First operand 92 states and 11211 transitions. Second operand 3 states. [2018-06-26 20:41:54,779 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:54,779 INFO ]: Finished difference Result 112 states and 13715 transitions. [2018-06-26 20:41:54,779 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:54,779 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-26 20:41:54,779 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:54,797 INFO ]: With dead ends: 112 [2018-06-26 20:41:54,797 INFO ]: Without dead ends: 112 [2018-06-26 20:41:54,797 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:41:54,797 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-26 20:41:54,839 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-06-26 20:41:54,839 INFO ]: Start removeUnreachable. Operand 112 states. [2018-06-26 20:41:54,849 INFO ]: Finished removeUnreachable. Reduced from 112 states to 112 states and 13715 transitions. [2018-06-26 20:41:54,849 INFO ]: Start accepts. Automaton has 112 states and 13715 transitions. Word has length 13 [2018-06-26 20:41:54,849 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:54,849 INFO ]: Abstraction has 112 states and 13715 transitions. [2018-06-26 20:41:54,849 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:54,849 INFO ]: Start isEmpty. Operand 112 states and 13715 transitions. [2018-06-26 20:41:54,854 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:41:54,854 INFO ]: Found error trace [2018-06-26 20:41:54,854 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:54,854 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:54,854 INFO ]: Analyzing trace with hash 1346823113, now seen corresponding path program 1 times [2018-06-26 20:41:54,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:54,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:54,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:54,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:54,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:54,886 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:54,980 INFO ]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-26 20:41:54,980 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:41:54,980 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:41:54,980 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:41:54,980 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:41:54,980 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:41:54,980 INFO ]: Start difference. First operand 112 states and 13715 transitions. Second operand 3 states. [2018-06-26 20:41:58,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:41:58,076 INFO ]: Finished difference Result 216 states and 25597 transitions. [2018-06-26 20:41:58,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:41:58,076 INFO ]: Start accepts. Automaton has 3 states. Word has length 14 [2018-06-26 20:41:58,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:41:58,095 INFO ]: With dead ends: 216 [2018-06-26 20:41:58,095 INFO ]: Without dead ends: 216 [2018-06-26 20:41:58,096 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:58,096 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-26 20:41:58,154 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-06-26 20:41:58,154 INFO ]: Start removeUnreachable. Operand 216 states. [2018-06-26 20:41:58,171 INFO ]: Finished removeUnreachable. Reduced from 216 states to 216 states and 25597 transitions. [2018-06-26 20:41:58,171 INFO ]: Start accepts. Automaton has 216 states and 25597 transitions. Word has length 14 [2018-06-26 20:41:58,171 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:41:58,171 INFO ]: Abstraction has 216 states and 25597 transitions. [2018-06-26 20:41:58,172 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:41:58,172 INFO ]: Start isEmpty. Operand 216 states and 25597 transitions. [2018-06-26 20:41:58,179 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 20:41:58,179 INFO ]: Found error trace [2018-06-26 20:41:58,179 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:41:58,179 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:41:58,180 INFO ]: Analyzing trace with hash -672640512, now seen corresponding path program 1 times [2018-06-26 20:41:58,180 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:41:58,180 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:41:58,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:58,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:58,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:41:58,211 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:58,379 INFO ]: Checked inductivity of 45 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:41:58,379 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:41:58,379 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:41:58,385 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:41:58,720 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:41:58,739 INFO ]: Computing forward predicates... [2018-06-26 20:41:58,958 INFO ]: Checked inductivity of 45 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-26 20:41:58,993 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:41:58,993 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:41:58,993 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:41:58,993 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:41:58,994 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:41:58,994 INFO ]: Start difference. First operand 216 states and 25597 transitions. Second operand 6 states. [2018-06-26 20:42:02,995 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:02,995 INFO ]: Finished difference Result 296 states and 27485 transitions. [2018-06-26 20:42:02,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 20:42:02,995 INFO ]: Start accepts. Automaton has 6 states. Word has length 14 [2018-06-26 20:42:02,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:03,004 INFO ]: With dead ends: 296 [2018-06-26 20:42:03,004 INFO ]: Without dead ends: 200 [2018-06-26 20:42:03,004 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-26 20:42:03,004 INFO ]: Start minimizeSevpa. Operand 200 states. [2018-06-26 20:42:03,075 INFO ]: Finished minimizeSevpa. Reduced states from 200 to 180. [2018-06-26 20:42:03,075 INFO ]: Start removeUnreachable. Operand 180 states. [2018-06-26 20:42:03,086 INFO ]: Finished removeUnreachable. Reduced from 180 states to 180 states and 18605 transitions. [2018-06-26 20:42:03,086 INFO ]: Start accepts. Automaton has 180 states and 18605 transitions. Word has length 14 [2018-06-26 20:42:03,086 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:03,086 INFO ]: Abstraction has 180 states and 18605 transitions. [2018-06-26 20:42:03,086 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:42:03,086 INFO ]: Start isEmpty. Operand 180 states and 18605 transitions. [2018-06-26 20:42:03,092 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 20:42:03,092 INFO ]: Found error trace [2018-06-26 20:42:03,092 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:03,092 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:03,092 INFO ]: Analyzing trace with hash -990849140, now seen corresponding path program 1 times [2018-06-26 20:42:03,092 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:03,092 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:03,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:03,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:03,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:03,134 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:03,258 INFO ]: Checked inductivity of 55 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-26 20:42:03,258 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:03,258 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:03,258 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:03,258 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:03,258 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:03,258 INFO ]: Start difference. First operand 180 states and 18605 transitions. Second operand 3 states. [2018-06-26 20:42:05,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:05,923 INFO ]: Finished difference Result 228 states and 22921 transitions. [2018-06-26 20:42:05,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:05,923 INFO ]: Start accepts. Automaton has 3 states. Word has length 15 [2018-06-26 20:42:05,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:05,932 INFO ]: With dead ends: 228 [2018-06-26 20:42:05,932 INFO ]: Without dead ends: 228 [2018-06-26 20:42:05,932 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:42:05,933 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-26 20:42:05,975 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-06-26 20:42:05,975 INFO ]: Start removeUnreachable. Operand 228 states. [2018-06-26 20:42:05,989 INFO ]: Finished removeUnreachable. Reduced from 228 states to 228 states and 22921 transitions. [2018-06-26 20:42:05,989 INFO ]: Start accepts. Automaton has 228 states and 22921 transitions. Word has length 15 [2018-06-26 20:42:05,989 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:05,989 INFO ]: Abstraction has 228 states and 22921 transitions. [2018-06-26 20:42:05,989 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:42:05,989 INFO ]: Start isEmpty. Operand 228 states and 22921 transitions. [2018-06-26 20:42:05,994 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:42:05,994 INFO ]: Found error trace [2018-06-26 20:42:05,994 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:05,994 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:05,994 INFO ]: Analyzing trace with hash 126698362, now seen corresponding path program 1 times [2018-06-26 20:42:05,994 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:05,994 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:05,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:05,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:05,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:06,037 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:06,232 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-26 20:42:06,235 INFO ]: Checked inductivity of 78 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-26 20:42:06,235 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:42:06,235 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:42:06,242 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:06,518 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:06,530 INFO ]: Computing forward predicates... [2018-06-26 20:42:06,538 INFO ]: Checked inductivity of 78 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-26 20:42:06,566 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 20:42:06,566 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-26 20:42:06,566 INFO ]: Interpolant automaton has 5 states [2018-06-26 20:42:06,566 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 20:42:06,566 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 20:42:06,566 INFO ]: Start difference. First operand 228 states and 22921 transitions. Second operand 5 states. [2018-06-26 20:42:09,343 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:42:09,343 INFO ]: Finished difference Result 300 states and 24109 transitions. [2018-06-26 20:42:09,344 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 20:42:09,344 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-26 20:42:09,344 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:42:09,351 INFO ]: With dead ends: 300 [2018-06-26 20:42:09,351 INFO ]: Without dead ends: 284 [2018-06-26 20:42:09,351 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-26 20:42:09,351 INFO ]: Start minimizeSevpa. Operand 284 states. [2018-06-26 20:42:09,404 INFO ]: Finished minimizeSevpa. Reduced states from 284 to 268. [2018-06-26 20:42:09,404 INFO ]: Start removeUnreachable. Operand 268 states. [2018-06-26 20:42:09,418 INFO ]: Finished removeUnreachable. Reduced from 268 states to 268 states and 23182 transitions. [2018-06-26 20:42:09,418 INFO ]: Start accepts. Automaton has 268 states and 23182 transitions. Word has length 17 [2018-06-26 20:42:09,418 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:42:09,418 INFO ]: Abstraction has 268 states and 23182 transitions. [2018-06-26 20:42:09,418 INFO ]: Interpolant automaton has 5 states. [2018-06-26 20:42:09,418 INFO ]: Start isEmpty. Operand 268 states and 23182 transitions. [2018-06-26 20:42:09,422 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 20:42:09,422 INFO ]: Found error trace [2018-06-26 20:42:09,422 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:42:09,422 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:42:09,422 INFO ]: Analyzing trace with hash 1951428873, now seen corresponding path program 1 times [2018-06-26 20:42:09,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:42:09,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:42:09,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:09,423 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:42:09,423 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:42:09,458 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:42:09,558 INFO ]: Checked inductivity of 78 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 20:42:09,558 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:42:09,558 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:42:09,558 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:42:09,558 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:42:09,558 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:42:09,558 INFO ]: Start difference. First operand 268 states and 23182 transitions. Second operand 3 states. Received shutdown request... [2018-06-26 20:42:11,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:42:11,754 WARN ]: Verification canceled [2018-06-26 20:42:11,756 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:42:11,757 WARN ]: Timeout [2018-06-26 20:42:11,757 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:42:11 BasicIcfg [2018-06-26 20:42:11,757 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:42:11,758 INFO ]: Toolchain (without parser) took 65390.41 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 243.3 MB in the beginning and 929.3 MB in the end (delta: -686.0 MB). Peak memory consumption was 466.4 MB. Max. memory is 3.6 GB. [2018-06-26 20:42:11,758 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:42:11,759 INFO ]: ChcToBoogie took 66.04 ms. Allocated memory is still 308.8 MB. Free memory was 242.3 MB in the beginning and 239.3 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:42:11,763 INFO ]: Boogie Preprocessor took 86.47 ms. Allocated memory is still 308.8 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:42:11,763 INFO ]: RCFGBuilder took 461.13 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 206.2 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:42:11,763 INFO ]: BlockEncodingV2 took 2094.14 ms. Allocated memory was 308.8 MB in the beginning and 401.1 MB in the end (delta: 92.3 MB). Free memory was 206.2 MB in the beginning and 209.4 MB in the end (delta: -3.3 MB). Peak memory consumption was 131.9 MB. Max. memory is 3.6 GB. [2018-06-26 20:42:11,765 INFO ]: TraceAbstraction took 62672.78 ms. Allocated memory was 401.1 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 209.4 MB in the beginning and 929.3 MB in the end (delta: -719.9 MB). Peak memory consumption was 340.2 MB. Max. memory is 3.6 GB. [2018-06-26 20:42:11,768 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, 963 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 308.8 MB. Free memory is still 274.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.04 ms. Allocated memory is still 308.8 MB. Free memory was 242.3 MB in the beginning and 239.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 86.47 ms. Allocated memory is still 308.8 MB. Free memory was 239.3 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 461.13 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 206.2 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2094.14 ms. Allocated memory was 308.8 MB in the beginning and 401.1 MB in the end (delta: 92.3 MB). Free memory was 206.2 MB in the beginning and 209.4 MB in the end (delta: -3.3 MB). Peak memory consumption was 131.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 62672.78 ms. Allocated memory was 401.1 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 209.4 MB in the beginning and 929.3 MB in the end (delta: -719.9 MB). Peak memory consumption was 340.2 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 (268states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (148 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 62.6s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 58.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 1 SDslu, 89 SDs, 0 SdLazy, 20988 SolverSat, 14297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=19, 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.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 44 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 3237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4752 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 627/630 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_srvr_10.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-42-11-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_10.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-42-11-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_10.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-42-11-782.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_10.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-42-11-782.csv Completed graceful shutdown