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/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:22:54,855 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:22:54,857 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:22:54,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:22:54,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:22:54,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:22:54,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:22:54,874 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:22:54,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:22:54,876 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:22:54,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:22:54,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:22:54,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:22:54,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:22:54,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:22:54,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:22:54,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:22:54,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:22:54,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:22:54,903 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:22:54,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:22:54,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:22:54,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:22:54,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:22:54,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:22:54,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:22:54,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:22:54,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:22:54,915 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:22:54,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:22:54,916 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:22:54,917 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:22:54,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:22:54,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:22:54,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:22:54,918 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:22:54,932 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:22:54,932 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:22:54,933 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:22:54,933 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:22:54,934 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:22:54,934 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:22:54,934 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:22:54,934 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:22:54,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:22:54,935 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:22:54,935 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:22:54,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:22:54,935 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:22:54,935 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:22:54,936 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:22:54,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:22:54,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:22:54,936 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:22:54,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:22:54,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:22:54,938 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:22:54,939 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:22:54,939 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:22:54,986 INFO ]: Repository-Root is: /tmp [2018-06-24 20:22:55,004 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:22:55,011 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:22:55,013 INFO ]: Initializing SmtParser... [2018-06-24 20:22:55,013 INFO ]: SmtParser initialized [2018-06-24 20:22:55,014 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 [2018-06-24 20:22:55,015 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-24 20:22:55,102 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 unknown [2018-06-24 20:22:55,931 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/fortune-full.16.smt2 [2018-06-24 20:22:55,936 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:22:55,952 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:22:55,953 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:22:55,953 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:22:55,953 INFO ]: ChcToBoogie initialized [2018-06-24 20:22:55,960 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:22:55" (1/1) ... [2018-06-24 20:22:56,115 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56 Unit [2018-06-24 20:22:56,115 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:22:56,116 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:22:56,116 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:22:56,116 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:22:56,134 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56" (1/1) ... [2018-06-24 20:22:56,134 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56" (1/1) ... [2018-06-24 20:22:56,152 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56" (1/1) ... [2018-06-24 20:22:56,152 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56" (1/1) ... [2018-06-24 20:22:56,187 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56" (1/1) ... [2018-06-24 20:22:56,191 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56" (1/1) ... [2018-06-24 20:22:56,199 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56" (1/1) ... [2018-06-24 20:22:56,206 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:22:56,206 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:22:56,206 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:22:56,206 INFO ]: RCFGBuilder initialized [2018-06-24 20:22:56,207 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56" (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-24 20:22:56,217 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:22:56,217 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:22:56,217 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:22:56,217 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:22:56,217 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:22:56,217 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-24 20:22:58,423 INFO ]: Using library mode [2018-06-24 20:22:58,424 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:22:58 BoogieIcfgContainer [2018-06-24 20:22:58,424 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:22:58,424 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:22:58,425 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:22:58,426 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:22:58,426 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:22:58" (1/1) ... [2018-06-24 20:22:58,471 INFO ]: Initial Icfg 144 locations, 279 edges [2018-06-24 20:22:58,473 INFO ]: Using Remove infeasible edges [2018-06-24 20:22:58,474 INFO ]: Using Maximize final states [2018-06-24 20:22:58,474 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:22:58,474 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:22:58,477 INFO ]: Using Remove sink states [2018-06-24 20:22:58,478 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:22:58,478 INFO ]: Using Use SBE [2018-06-24 20:22:58,499 INFO ]: SBE split 0 edges [2018-06-24 20:22:58,507 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:22:58,509 INFO ]: 0 new accepting states [2018-06-24 20:22:59,448 INFO ]: Removed 55 edges and 8 locations by large block encoding [2018-06-24 20:22:59,451 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:22:59,453 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:22:59,454 INFO ]: 0 new accepting states [2018-06-24 20:22:59,457 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:22:59,457 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:22:59,459 INFO ]: Encoded RCFG 133 locations, 267 edges [2018-06-24 20:22:59,460 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:22:59 BasicIcfg [2018-06-24 20:22:59,460 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:22:59,461 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:22:59,461 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:22:59,463 INFO ]: TraceAbstraction initialized [2018-06-24 20:22:59,463 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:22:55" (1/4) ... [2018-06-24 20:22:59,464 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc55e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:22:59, skipping insertion in model container [2018-06-24 20:22:59,464 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:22:56" (2/4) ... [2018-06-24 20:22:59,464 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc55e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:22:59, skipping insertion in model container [2018-06-24 20:22:59,464 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:22:58" (3/4) ... [2018-06-24 20:22:59,466 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc55e4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:22:59, skipping insertion in model container [2018-06-24 20:22:59,466 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:22:59" (4/4) ... [2018-06-24 20:22:59,468 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:22:59,479 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:22:59,497 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:22:59,546 INFO ]: Using default assertion order modulation [2018-06-24 20:22:59,547 INFO ]: Interprodecural is true [2018-06-24 20:22:59,547 INFO ]: Hoare is false [2018-06-24 20:22:59,547 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:22:59,547 INFO ]: Backedges is TWOTRACK [2018-06-24 20:22:59,547 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:22:59,547 INFO ]: Difference is false [2018-06-24 20:22:59,547 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:22:59,547 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:22:59,567 INFO ]: Start isEmpty. Operand 133 states. [2018-06-24 20:22:59,639 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:22:59,639 INFO ]: Found error trace [2018-06-24 20:22:59,640 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:22:59,640 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:22:59,645 INFO ]: Analyzing trace with hash 5693133, now seen corresponding path program 1 times [2018-06-24 20:22:59,646 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:22:59,647 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:22:59,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:59,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:22:59,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:22:59,829 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:00,036 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:23:00,038 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:00,038 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:23:00,039 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:23:00,052 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:23:00,052 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:23:00,055 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-24 20:23:02,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:02,318 INFO ]: Finished difference Result 263 states and 531 transitions. [2018-06-24 20:23:02,319 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:23:02,320 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:23:02,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:02,360 INFO ]: With dead ends: 263 [2018-06-24 20:23:02,360 INFO ]: Without dead ends: 263 [2018-06-24 20:23:02,362 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-24 20:23:02,382 INFO ]: Start minimizeSevpa. Operand 263 states. [2018-06-24 20:23:02,516 INFO ]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-06-24 20:23:02,517 INFO ]: Start removeUnreachable. Operand 263 states. [2018-06-24 20:23:02,536 INFO ]: Finished removeUnreachable. Reduced from 263 states to 263 states and 531 transitions. [2018-06-24 20:23:02,537 INFO ]: Start accepts. Automaton has 263 states and 531 transitions. Word has length 4 [2018-06-24 20:23:02,538 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:02,539 INFO ]: Abstraction has 263 states and 531 transitions. [2018-06-24 20:23:02,539 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:23:02,539 INFO ]: Start isEmpty. Operand 263 states and 531 transitions. [2018-06-24 20:23:02,603 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:23:02,603 INFO ]: Found error trace [2018-06-24 20:23:02,603 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:02,603 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:02,604 INFO ]: Analyzing trace with hash 20245302, now seen corresponding path program 1 times [2018-06-24 20:23:02,604 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:02,604 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:02,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:02,605 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:02,605 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:02,670 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:02,820 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:02,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:02,820 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:23:02,821 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:23:02,821 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:23:02,821 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:23:02,822 INFO ]: Start difference. First operand 263 states and 531 transitions. Second operand 3 states. [2018-06-24 20:23:04,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:04,159 INFO ]: Finished difference Result 393 states and 791 transitions. [2018-06-24 20:23:04,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:23:04,160 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-24 20:23:04,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:04,174 INFO ]: With dead ends: 393 [2018-06-24 20:23:04,174 INFO ]: Without dead ends: 393 [2018-06-24 20:23:04,174 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-24 20:23:04,175 INFO ]: Start minimizeSevpa. Operand 393 states. [2018-06-24 20:23:04,256 INFO ]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-06-24 20:23:04,256 INFO ]: Start removeUnreachable. Operand 393 states. [2018-06-24 20:23:04,293 INFO ]: Finished removeUnreachable. Reduced from 393 states to 393 states and 791 transitions. [2018-06-24 20:23:04,293 INFO ]: Start accepts. Automaton has 393 states and 791 transitions. Word has length 8 [2018-06-24 20:23:04,293 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:04,293 INFO ]: Abstraction has 393 states and 791 transitions. [2018-06-24 20:23:04,293 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:23:04,293 INFO ]: Start isEmpty. Operand 393 states and 791 transitions. [2018-06-24 20:23:04,313 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:23:04,313 INFO ]: Found error trace [2018-06-24 20:23:04,313 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:04,314 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:04,314 INFO ]: Analyzing trace with hash -1073726788, now seen corresponding path program 1 times [2018-06-24 20:23:04,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:04,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:04,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:04,314 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:04,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:04,363 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:04,483 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:04,483 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:04,483 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:23:04,484 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:23:04,484 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:23:04,484 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:23:04,484 INFO ]: Start difference. First operand 393 states and 791 transitions. Second operand 5 states. [2018-06-24 20:23:05,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:05,094 INFO ]: Finished difference Result 610 states and 1677 transitions. [2018-06-24 20:23:05,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:23:05,095 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:23:05,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:05,139 INFO ]: With dead ends: 610 [2018-06-24 20:23:05,139 INFO ]: Without dead ends: 610 [2018-06-24 20:23:05,139 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:23:05,140 INFO ]: Start minimizeSevpa. Operand 610 states. [2018-06-24 20:23:05,302 INFO ]: Finished minimizeSevpa. Reduced states from 610 to 400. [2018-06-24 20:23:05,302 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 20:23:05,313 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 839 transitions. [2018-06-24 20:23:05,313 INFO ]: Start accepts. Automaton has 400 states and 839 transitions. Word has length 9 [2018-06-24 20:23:05,313 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:05,313 INFO ]: Abstraction has 400 states and 839 transitions. [2018-06-24 20:23:05,313 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:23:05,313 INFO ]: Start isEmpty. Operand 400 states and 839 transitions. [2018-06-24 20:23:05,332 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:23:05,332 INFO ]: Found error trace [2018-06-24 20:23:05,332 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:05,332 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:05,332 INFO ]: Analyzing trace with hash -1073724866, now seen corresponding path program 1 times [2018-06-24 20:23:05,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:05,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:05,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:05,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:05,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:05,438 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:05,588 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:05,588 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:05,588 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:23:05,588 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:23:05,588 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:23:05,588 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:23:05,588 INFO ]: Start difference. First operand 400 states and 839 transitions. Second operand 5 states. [2018-06-24 20:23:07,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:07,191 INFO ]: Finished difference Result 610 states and 1674 transitions. [2018-06-24 20:23:07,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:23:07,191 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:23:07,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:07,279 INFO ]: With dead ends: 610 [2018-06-24 20:23:07,279 INFO ]: Without dead ends: 610 [2018-06-24 20:23:07,279 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:23:07,280 INFO ]: Start minimizeSevpa. Operand 610 states. [2018-06-24 20:23:07,409 INFO ]: Finished minimizeSevpa. Reduced states from 610 to 400. [2018-06-24 20:23:07,409 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 20:23:07,421 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 836 transitions. [2018-06-24 20:23:07,422 INFO ]: Start accepts. Automaton has 400 states and 836 transitions. Word has length 9 [2018-06-24 20:23:07,422 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:07,422 INFO ]: Abstraction has 400 states and 836 transitions. [2018-06-24 20:23:07,422 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:23:07,422 INFO ]: Start isEmpty. Operand 400 states and 836 transitions. [2018-06-24 20:23:07,437 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:23:07,437 INFO ]: Found error trace [2018-06-24 20:23:07,437 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:07,437 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:07,439 INFO ]: Analyzing trace with hash -1073721983, now seen corresponding path program 1 times [2018-06-24 20:23:07,439 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:07,439 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:07,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:07,440 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:07,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:07,503 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:07,684 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:07,684 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:07,684 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:23:07,684 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:23:07,684 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:23:07,684 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:23:07,684 INFO ]: Start difference. First operand 400 states and 836 transitions. Second operand 5 states. [2018-06-24 20:23:08,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:08,759 INFO ]: Finished difference Result 610 states and 1668 transitions. [2018-06-24 20:23:08,759 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:23:08,759 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:23:08,759 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:08,792 INFO ]: With dead ends: 610 [2018-06-24 20:23:08,792 INFO ]: Without dead ends: 610 [2018-06-24 20:23:08,792 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:23:08,793 INFO ]: Start minimizeSevpa. Operand 610 states. [2018-06-24 20:23:08,955 INFO ]: Finished minimizeSevpa. Reduced states from 610 to 400. [2018-06-24 20:23:08,955 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 20:23:09,018 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 830 transitions. [2018-06-24 20:23:09,018 INFO ]: Start accepts. Automaton has 400 states and 830 transitions. Word has length 9 [2018-06-24 20:23:09,018 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:09,018 INFO ]: Abstraction has 400 states and 830 transitions. [2018-06-24 20:23:09,018 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:23:09,018 INFO ]: Start isEmpty. Operand 400 states and 830 transitions. [2018-06-24 20:23:09,033 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:23:09,033 INFO ]: Found error trace [2018-06-24 20:23:09,033 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:09,033 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:09,035 INFO ]: Analyzing trace with hash -1073721022, now seen corresponding path program 1 times [2018-06-24 20:23:09,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:09,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:09,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:09,035 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:09,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:09,079 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:09,354 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:09,354 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:09,372 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:23:09,372 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:23:09,372 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:23:09,372 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:23:09,373 INFO ]: Start difference. First operand 400 states and 830 transitions. Second operand 5 states. [2018-06-24 20:23:10,690 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:10,690 INFO ]: Finished difference Result 610 states and 1665 transitions. [2018-06-24 20:23:10,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:23:10,691 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:23:10,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:10,711 INFO ]: With dead ends: 610 [2018-06-24 20:23:10,712 INFO ]: Without dead ends: 610 [2018-06-24 20:23:10,712 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:23:10,712 INFO ]: Start minimizeSevpa. Operand 610 states. [2018-06-24 20:23:10,833 INFO ]: Finished minimizeSevpa. Reduced states from 610 to 400. [2018-06-24 20:23:10,833 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 20:23:10,841 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 827 transitions. [2018-06-24 20:23:10,841 INFO ]: Start accepts. Automaton has 400 states and 827 transitions. Word has length 9 [2018-06-24 20:23:10,841 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:10,841 INFO ]: Abstraction has 400 states and 827 transitions. [2018-06-24 20:23:10,841 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:23:10,841 INFO ]: Start isEmpty. Operand 400 states and 827 transitions. [2018-06-24 20:23:10,858 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:23:10,858 INFO ]: Found error trace [2018-06-24 20:23:10,858 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:10,858 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:10,859 INFO ]: Analyzing trace with hash -125003053, now seen corresponding path program 1 times [2018-06-24 20:23:10,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:10,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:10,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:10,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:10,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:10,892 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:11,060 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:11,060 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:11,060 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:23:11,060 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:23:11,060 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:23:11,060 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:23:11,061 INFO ]: Start difference. First operand 400 states and 827 transitions. Second operand 3 states. [2018-06-24 20:23:12,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:12,118 INFO ]: Finished difference Result 532 states and 1101 transitions. [2018-06-24 20:23:12,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:23:12,118 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-24 20:23:12,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:12,133 INFO ]: With dead ends: 532 [2018-06-24 20:23:12,133 INFO ]: Without dead ends: 532 [2018-06-24 20:23:12,133 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-24 20:23:12,134 INFO ]: Start minimizeSevpa. Operand 532 states. [2018-06-24 20:23:12,194 INFO ]: Finished minimizeSevpa. Reduced states from 532 to 532. [2018-06-24 20:23:12,194 INFO ]: Start removeUnreachable. Operand 532 states. [2018-06-24 20:23:12,211 INFO ]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1101 transitions. [2018-06-24 20:23:12,211 INFO ]: Start accepts. Automaton has 532 states and 1101 transitions. Word has length 9 [2018-06-24 20:23:12,212 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:12,212 INFO ]: Abstraction has 532 states and 1101 transitions. [2018-06-24 20:23:12,212 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:23:12,212 INFO ]: Start isEmpty. Operand 532 states and 1101 transitions. [2018-06-24 20:23:12,229 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:23:12,229 INFO ]: Found error trace [2018-06-24 20:23:12,229 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:12,229 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:12,229 INFO ]: Analyzing trace with hash -66821230, now seen corresponding path program 1 times [2018-06-24 20:23:12,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:12,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:12,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:12,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:12,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:12,266 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:12,607 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:12,607 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:12,607 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:23:12,608 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:23:12,608 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:23:12,608 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:23:12,608 INFO ]: Start difference. First operand 532 states and 1101 transitions. Second operand 5 states. [2018-06-24 20:23:14,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:14,995 INFO ]: Finished difference Result 908 states and 2383 transitions. [2018-06-24 20:23:15,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:23:15,017 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:23:15,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:15,054 INFO ]: With dead ends: 908 [2018-06-24 20:23:15,054 INFO ]: Without dead ends: 903 [2018-06-24 20:23:15,054 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:23:15,055 INFO ]: Start minimizeSevpa. Operand 903 states. [2018-06-24 20:23:15,193 INFO ]: Finished minimizeSevpa. Reduced states from 903 to 763. [2018-06-24 20:23:15,193 INFO ]: Start removeUnreachable. Operand 763 states. [2018-06-24 20:23:15,222 INFO ]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1737 transitions. [2018-06-24 20:23:15,222 INFO ]: Start accepts. Automaton has 763 states and 1737 transitions. Word has length 9 [2018-06-24 20:23:15,222 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:15,222 INFO ]: Abstraction has 763 states and 1737 transitions. [2018-06-24 20:23:15,222 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:23:15,222 INFO ]: Start isEmpty. Operand 763 states and 1737 transitions. [2018-06-24 20:23:15,248 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:23:15,248 INFO ]: Found error trace [2018-06-24 20:23:15,248 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:15,248 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:15,248 INFO ]: Analyzing trace with hash 1496240833, now seen corresponding path program 1 times [2018-06-24 20:23:15,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:15,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:15,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:15,249 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:15,249 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:15,283 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:15,709 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:15,709 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:15,709 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:23:15,709 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:23:15,709 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:23:15,709 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:23:15,709 INFO ]: Start difference. First operand 763 states and 1737 transitions. Second operand 6 states. [2018-06-24 20:23:20,961 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:20,962 INFO ]: Finished difference Result 1818 states and 8550 transitions. [2018-06-24 20:23:20,962 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:23:20,962 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:23:20,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:21,156 INFO ]: With dead ends: 1818 [2018-06-24 20:23:21,156 INFO ]: Without dead ends: 1812 [2018-06-24 20:23:21,156 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:23:21,157 INFO ]: Start minimizeSevpa. Operand 1812 states. [2018-06-24 20:23:21,661 INFO ]: Finished minimizeSevpa. Reduced states from 1812 to 1052. [2018-06-24 20:23:21,661 INFO ]: Start removeUnreachable. Operand 1052 states. [2018-06-24 20:23:21,704 INFO ]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 2638 transitions. [2018-06-24 20:23:21,704 INFO ]: Start accepts. Automaton has 1052 states and 2638 transitions. Word has length 10 [2018-06-24 20:23:21,704 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:21,704 INFO ]: Abstraction has 1052 states and 2638 transitions. [2018-06-24 20:23:21,704 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:23:21,704 INFO ]: Start isEmpty. Operand 1052 states and 2638 transitions. [2018-06-24 20:23:21,732 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:23:21,732 INFO ]: Found error trace [2018-06-24 20:23:21,733 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:21,733 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:21,734 INFO ]: Analyzing trace with hash 1496242755, now seen corresponding path program 1 times [2018-06-24 20:23:21,734 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:21,734 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:21,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:21,734 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:21,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:21,773 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:22,076 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:22,076 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:22,076 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:23:22,076 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:23:22,076 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:23:22,076 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:23:22,077 INFO ]: Start difference. First operand 1052 states and 2638 transitions. Second operand 6 states. [2018-06-24 20:23:26,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:26,117 INFO ]: Finished difference Result 1668 states and 7884 transitions. [2018-06-24 20:23:26,117 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:23:26,117 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:23:26,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:26,236 INFO ]: With dead ends: 1668 [2018-06-24 20:23:26,236 INFO ]: Without dead ends: 1668 [2018-06-24 20:23:26,236 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:23:26,237 INFO ]: Start minimizeSevpa. Operand 1668 states. [2018-06-24 20:23:26,599 INFO ]: Finished minimizeSevpa. Reduced states from 1668 to 1070. [2018-06-24 20:23:26,599 INFO ]: Start removeUnreachable. Operand 1070 states. [2018-06-24 20:23:26,642 INFO ]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 2728 transitions. [2018-06-24 20:23:26,642 INFO ]: Start accepts. Automaton has 1070 states and 2728 transitions. Word has length 10 [2018-06-24 20:23:26,642 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:26,642 INFO ]: Abstraction has 1070 states and 2728 transitions. [2018-06-24 20:23:26,642 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:23:26,642 INFO ]: Start isEmpty. Operand 1070 states and 2728 transitions. [2018-06-24 20:23:26,661 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:23:26,661 INFO ]: Found error trace [2018-06-24 20:23:26,662 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:26,662 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:26,663 INFO ]: Analyzing trace with hash 1496245638, now seen corresponding path program 1 times [2018-06-24 20:23:26,663 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:26,663 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:26,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:26,663 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:26,663 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:26,701 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:26,940 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:26,940 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:26,940 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:23:26,941 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:23:26,941 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:23:26,941 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:23:26,941 INFO ]: Start difference. First operand 1070 states and 2728 transitions. Second operand 6 states. [2018-06-24 20:23:30,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:30,832 INFO ]: Finished difference Result 1668 states and 7872 transitions. [2018-06-24 20:23:30,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:23:30,832 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:23:30,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:30,940 INFO ]: With dead ends: 1668 [2018-06-24 20:23:30,940 INFO ]: Without dead ends: 1668 [2018-06-24 20:23:30,940 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:23:30,941 INFO ]: Start minimizeSevpa. Operand 1668 states. [2018-06-24 20:23:31,300 INFO ]: Finished minimizeSevpa. Reduced states from 1668 to 1070. [2018-06-24 20:23:31,300 INFO ]: Start removeUnreachable. Operand 1070 states. [2018-06-24 20:23:31,343 INFO ]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 2716 transitions. [2018-06-24 20:23:31,344 INFO ]: Start accepts. Automaton has 1070 states and 2716 transitions. Word has length 10 [2018-06-24 20:23:31,344 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:31,344 INFO ]: Abstraction has 1070 states and 2716 transitions. [2018-06-24 20:23:31,344 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:23:31,344 INFO ]: Start isEmpty. Operand 1070 states and 2716 transitions. [2018-06-24 20:23:31,361 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:23:31,361 INFO ]: Found error trace [2018-06-24 20:23:31,361 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:31,361 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:31,361 INFO ]: Analyzing trace with hash 1496246599, now seen corresponding path program 1 times [2018-06-24 20:23:31,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:31,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:31,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:31,362 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:31,362 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:31,398 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:31,854 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:31,854 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:31,854 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:23:31,855 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:23:31,855 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:23:31,855 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:23:31,855 INFO ]: Start difference. First operand 1070 states and 2716 transitions. Second operand 6 states. [2018-06-24 20:23:35,358 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:35,358 INFO ]: Finished difference Result 2588 states and 15997 transitions. [2018-06-24 20:23:35,359 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:23:35,359 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:23:35,359 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:35,645 INFO ]: With dead ends: 2588 [2018-06-24 20:23:35,645 INFO ]: Without dead ends: 2588 [2018-06-24 20:23:35,645 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:23:35,647 INFO ]: Start minimizeSevpa. Operand 2588 states. [2018-06-24 20:23:36,391 INFO ]: Finished minimizeSevpa. Reduced states from 2588 to 1667. [2018-06-24 20:23:36,391 INFO ]: Start removeUnreachable. Operand 1667 states. [2018-06-24 20:23:36,494 INFO ]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 5129 transitions. [2018-06-24 20:23:36,495 INFO ]: Start accepts. Automaton has 1667 states and 5129 transitions. Word has length 10 [2018-06-24 20:23:36,495 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:36,495 INFO ]: Abstraction has 1667 states and 5129 transitions. [2018-06-24 20:23:36,495 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:23:36,495 INFO ]: Start isEmpty. Operand 1667 states and 5129 transitions. [2018-06-24 20:23:36,514 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:23:36,514 INFO ]: Found error trace [2018-06-24 20:23:36,514 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:36,514 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:36,514 INFO ]: Analyzing trace with hash 1068840490, now seen corresponding path program 1 times [2018-06-24 20:23:36,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:36,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:36,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:36,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:36,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:36,551 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:36,723 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:36,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:36,723 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:23:36,723 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:23:36,723 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:23:36,723 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:23:36,724 INFO ]: Start difference. First operand 1667 states and 5129 transitions. Second operand 6 states. [2018-06-24 20:23:39,118 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:39,119 INFO ]: Finished difference Result 4835 states and 29478 transitions. [2018-06-24 20:23:39,119 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:23:39,119 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:23:39,119 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:39,826 INFO ]: With dead ends: 4835 [2018-06-24 20:23:39,826 INFO ]: Without dead ends: 4835 [2018-06-24 20:23:39,827 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:23:39,829 INFO ]: Start minimizeSevpa. Operand 4835 states. [2018-06-24 20:23:41,171 INFO ]: Finished minimizeSevpa. Reduced states from 4835 to 2682. [2018-06-24 20:23:41,171 INFO ]: Start removeUnreachable. Operand 2682 states. [2018-06-24 20:23:41,299 INFO ]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 8380 transitions. [2018-06-24 20:23:41,299 INFO ]: Start accepts. Automaton has 2682 states and 8380 transitions. Word has length 10 [2018-06-24 20:23:41,299 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:41,299 INFO ]: Abstraction has 2682 states and 8380 transitions. [2018-06-24 20:23:41,299 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:23:41,299 INFO ]: Start isEmpty. Operand 2682 states and 8380 transitions. [2018-06-24 20:23:41,321 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:23:41,321 INFO ]: Found error trace [2018-06-24 20:23:41,321 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:41,321 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:41,321 INFO ]: Analyzing trace with hash 1073756005, now seen corresponding path program 1 times [2018-06-24 20:23:41,321 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:41,321 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:41,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:41,322 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:41,322 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:41,354 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:41,747 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:41,747 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:23:41,747 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:23:41,747 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:23:41,747 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:23:41,747 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:23:41,747 INFO ]: Start difference. First operand 2682 states and 8380 transitions. Second operand 6 states. [2018-06-24 20:23:42,966 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:23:42,966 INFO ]: Finished difference Result 4601 states and 24416 transitions. [2018-06-24 20:23:42,967 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:23:42,967 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:23:42,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:23:45,106 INFO ]: With dead ends: 4601 [2018-06-24 20:23:45,106 INFO ]: Without dead ends: 4601 [2018-06-24 20:23:45,106 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:23:45,108 INFO ]: Start minimizeSevpa. Operand 4601 states. [2018-06-24 20:23:45,816 INFO ]: Finished minimizeSevpa. Reduced states from 4601 to 2693. [2018-06-24 20:23:45,816 INFO ]: Start removeUnreachable. Operand 2693 states. [2018-06-24 20:23:45,912 INFO ]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 8479 transitions. [2018-06-24 20:23:45,912 INFO ]: Start accepts. Automaton has 2693 states and 8479 transitions. Word has length 10 [2018-06-24 20:23:45,912 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:23:45,912 INFO ]: Abstraction has 2693 states and 8479 transitions. [2018-06-24 20:23:45,912 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:23:45,912 INFO ]: Start isEmpty. Operand 2693 states and 8479 transitions. [2018-06-24 20:23:45,927 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:23:45,927 INFO ]: Found error trace [2018-06-24 20:23:45,927 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:23:45,927 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:23:45,928 INFO ]: Analyzing trace with hash 269995576, now seen corresponding path program 1 times [2018-06-24 20:23:45,928 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:23:45,928 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:23:45,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:45,928 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:45,928 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:23:45,955 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:46,114 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:46,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:23:46,114 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-24 20:23:46,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:23:46,240 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:23:46,249 INFO ]: Computing forward predicates... [2018-06-24 20:23:46,403 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:23:46,441 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:23:46,441 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 20:23:46,441 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:23:46,441 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:23:46,442 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:23:46,442 INFO ]: Start difference. First operand 2693 states and 8479 transitions. Second operand 10 states. [2018-06-24 20:23:47,710 WARN ]: Spent 189.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 Received shutdown request... [2018-06-24 20:23:50,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:23:50,982 WARN ]: Verification canceled [2018-06-24 20:23:50,986 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:23:50,987 WARN ]: Timeout [2018-06-24 20:23:50,987 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:23:50 BasicIcfg [2018-06-24 20:23:50,987 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:23:50,988 INFO ]: Toolchain (without parser) took 55051.58 ms. Allocated memory was 309.3 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 215.9 MB in the beginning and 925.6 MB in the end (delta: -709.7 MB). Peak memory consumption was 583.2 MB. Max. memory is 3.6 GB. [2018-06-24 20:23:50,989 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:23:50,991 INFO ]: ChcToBoogie took 162.78 ms. Allocated memory is still 309.3 MB. Free memory was 215.9 MB in the beginning and 211.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:23:50,991 INFO ]: Boogie Preprocessor took 90.18 ms. Allocated memory is still 309.3 MB. Free memory was 211.9 MB in the beginning and 207.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:23:50,992 INFO ]: RCFGBuilder took 2217.64 ms. Allocated memory was 309.3 MB in the beginning and 356.5 MB in the end (delta: 47.2 MB). Free memory was 207.9 MB in the beginning and 325.4 MB in the end (delta: -117.5 MB). Peak memory consumption was 49.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:23:50,992 INFO ]: BlockEncodingV2 took 1035.22 ms. Allocated memory is still 356.5 MB. Free memory was 325.4 MB in the beginning and 225.9 MB in the end (delta: 99.5 MB). Peak memory consumption was 99.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:23:50,992 INFO ]: TraceAbstraction took 51526.53 ms. Allocated memory was 356.5 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 225.9 MB in the beginning and 925.6 MB in the end (delta: -699.7 MB). Peak memory consumption was 546.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:23:51,001 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 144 locations, 279 edges - StatisticsResult: Encoded RCFG 133 locations, 267 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 162.78 ms. Allocated memory is still 309.3 MB. Free memory was 215.9 MB in the beginning and 211.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 90.18 ms. Allocated memory is still 309.3 MB. Free memory was 211.9 MB in the beginning and 207.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 2217.64 ms. Allocated memory was 309.3 MB in the beginning and 356.5 MB in the end (delta: 47.2 MB). Free memory was 207.9 MB in the beginning and 325.4 MB in the end (delta: -117.5 MB). Peak memory consumption was 49.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 1035.22 ms. Allocated memory is still 356.5 MB. Free memory was 325.4 MB in the beginning and 225.9 MB in the end (delta: 99.5 MB). Peak memory consumption was 99.5 MB. Max. memory is 3.6 GB. * TraceAbstraction took 51526.53 ms. Allocated memory was 356.5 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 225.9 MB in the beginning and 925.6 MB in the end (delta: -699.7 MB). Peak memory consumption was 546.0 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 (2693states) and interpolant automaton (currently 11 states, 10 states before enhancement), while ReachableStatesComputation was computing reachable states (2282 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. TIMEOUT Result, 51.4s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 40.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11331 SDtfs, 1742 SDslu, 22132 SDs, 0 SdLazy, 21153 SolverSat, 3674 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2693occurred in iteration=14, 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: 5.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 7918 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 2662 SizeOfPredicates, 10 NumberOfNonLiveVariables, 859 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 30/32 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/fortune-full.16.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-23-51-012.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.16.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-23-51-012.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.16.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-23-51-012.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/fortune-full.16.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-23-51-012.csv Completed graceful shutdown