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/incremental2.42.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:31:05,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:31:06,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:31:06,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:31:06,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:31:06,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:31:06,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:31:06,020 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:31:06,022 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:31:06,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:31:06,024 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:31:06,025 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:31:06,025 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:31:06,026 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:31:06,027 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:31:06,028 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:31:06,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:31:06,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:31:06,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:31:06,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:31:06,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:31:06,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:31:06,048 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:31:06,048 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:31:06,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:31:06,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:31:06,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:31:06,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:31:06,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:31:06,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:31:06,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:31:06,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:31:06,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:31:06,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:31:06,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:31:06,061 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:31:06,083 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:31:06,083 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:31:06,083 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:31:06,084 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:31:06,085 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:31:06,085 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:31:06,086 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:31:06,086 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:31:06,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:31:06,086 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:31:06,086 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:31:06,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:31:06,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:31:06,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:31:06,087 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:31:06,087 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:31:06,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:31:06,088 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:31:06,088 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:31:06,088 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:31:06,088 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:31:06,092 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:31:06,093 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:31:06,140 INFO ]: Repository-Root is: /tmp [2018-06-24 20:31:06,156 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:31:06,162 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:31:06,163 INFO ]: Initializing SmtParser... [2018-06-24 20:31:06,163 INFO ]: SmtParser initialized [2018-06-24 20:31:06,164 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental2.42.smt2 [2018-06-24 20:31:06,165 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:31:06,255 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental2.42.smt2 unknown [2018-06-24 20:31:07,014 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/incremental2.42.smt2 [2018-06-24 20:31:07,018 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:31:07,024 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:31:07,025 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:31:07,025 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:31:07,025 INFO ]: ChcToBoogie initialized [2018-06-24 20:31:07,034 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:31:07" (1/1) ... [2018-06-24 20:31:07,159 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07 Unit [2018-06-24 20:31:07,159 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:31:07,160 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:31:07,160 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:31:07,160 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:31:07,181 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07" (1/1) ... [2018-06-24 20:31:07,181 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07" (1/1) ... [2018-06-24 20:31:07,199 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07" (1/1) ... [2018-06-24 20:31:07,199 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07" (1/1) ... [2018-06-24 20:31:07,224 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07" (1/1) ... [2018-06-24 20:31:07,228 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07" (1/1) ... [2018-06-24 20:31:07,235 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07" (1/1) ... [2018-06-24 20:31:07,244 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:31:07,245 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:31:07,245 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:31:07,245 INFO ]: RCFGBuilder initialized [2018-06-24 20:31:07,245 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07" (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:31:07,268 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:31:07,268 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:31:07,268 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:31:07,268 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:31:07,268 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:31:07,268 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:31:09,936 INFO ]: Using library mode [2018-06-24 20:31:09,936 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:31:09 BoogieIcfgContainer [2018-06-24 20:31:09,936 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:31:09,937 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:31:09,937 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:31:09,938 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:31:09,938 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:31:09" (1/1) ... [2018-06-24 20:31:09,993 INFO ]: Initial Icfg 146 locations, 282 edges [2018-06-24 20:31:09,994 INFO ]: Using Remove infeasible edges [2018-06-24 20:31:09,995 INFO ]: Using Maximize final states [2018-06-24 20:31:09,996 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:31:09,996 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:31:09,998 INFO ]: Using Remove sink states [2018-06-24 20:31:09,998 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:31:09,998 INFO ]: Using Use SBE [2018-06-24 20:31:10,020 INFO ]: SBE split 0 edges [2018-06-24 20:31:10,025 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:31:10,027 INFO ]: 0 new accepting states [2018-06-24 20:31:10,797 INFO ]: Removed 54 edges and 8 locations by large block encoding [2018-06-24 20:31:10,800 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:31:10,803 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:31:10,803 INFO ]: 0 new accepting states [2018-06-24 20:31:10,806 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:31:10,807 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:31:10,809 INFO ]: Encoded RCFG 135 locations, 270 edges [2018-06-24 20:31:10,809 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:31:10 BasicIcfg [2018-06-24 20:31:10,809 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:31:10,810 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:31:10,810 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:31:10,813 INFO ]: TraceAbstraction initialized [2018-06-24 20:31:10,813 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:31:07" (1/4) ... [2018-06-24 20:31:10,814 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca0e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:31:10, skipping insertion in model container [2018-06-24 20:31:10,814 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:31:07" (2/4) ... [2018-06-24 20:31:10,814 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca0e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:31:10, skipping insertion in model container [2018-06-24 20:31:10,814 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:31:09" (3/4) ... [2018-06-24 20:31:10,814 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca0e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:31:10, skipping insertion in model container [2018-06-24 20:31:10,814 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:31:10" (4/4) ... [2018-06-24 20:31:10,816 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:31:10,825 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:31:10,831 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:31:10,872 INFO ]: Using default assertion order modulation [2018-06-24 20:31:10,872 INFO ]: Interprodecural is true [2018-06-24 20:31:10,872 INFO ]: Hoare is false [2018-06-24 20:31:10,872 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:31:10,872 INFO ]: Backedges is TWOTRACK [2018-06-24 20:31:10,872 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:31:10,872 INFO ]: Difference is false [2018-06-24 20:31:10,872 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:31:10,872 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:31:10,886 INFO ]: Start isEmpty. Operand 135 states. [2018-06-24 20:31:10,922 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:31:10,922 INFO ]: Found error trace [2018-06-24 20:31:10,923 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:31:10,924 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:31:10,930 INFO ]: Analyzing trace with hash 5698062, now seen corresponding path program 1 times [2018-06-24 20:31:10,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:31:10,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:31:10,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:10,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:31:10,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:11,148 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:31:11,420 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:31:11,422 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:31:11,423 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:31:11,425 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:31:11,441 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:31:11,441 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:31:11,444 INFO ]: Start difference. First operand 135 states. Second operand 3 states. [2018-06-24 20:31:13,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:31:13,374 INFO ]: Finished difference Result 136 states and 368 transitions. [2018-06-24 20:31:13,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:31:13,376 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:31:13,376 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:31:13,413 INFO ]: With dead ends: 136 [2018-06-24 20:31:13,413 INFO ]: Without dead ends: 136 [2018-06-24 20:31:13,428 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:31:13,448 INFO ]: Start minimizeSevpa. Operand 136 states. [2018-06-24 20:31:13,564 INFO ]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-06-24 20:31:13,565 INFO ]: Start removeUnreachable. Operand 136 states. [2018-06-24 20:31:13,577 INFO ]: Finished removeUnreachable. Reduced from 136 states to 136 states and 368 transitions. [2018-06-24 20:31:13,578 INFO ]: Start accepts. Automaton has 136 states and 368 transitions. Word has length 4 [2018-06-24 20:31:13,579 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:31:13,579 INFO ]: Abstraction has 136 states and 368 transitions. [2018-06-24 20:31:13,579 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:31:13,579 INFO ]: Start isEmpty. Operand 136 states and 368 transitions. [2018-06-24 20:31:13,591 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:31:13,591 INFO ]: Found error trace [2018-06-24 20:31:13,591 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:31:13,591 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:31:13,591 INFO ]: Analyzing trace with hash 175858488, now seen corresponding path program 1 times [2018-06-24 20:31:13,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:31:13,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:31:13,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:13,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:31:13,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:13,617 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:31:13,758 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:31:13,758 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:31:13,758 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:31:13,760 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:31:13,760 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:31:13,760 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:31:13,760 INFO ]: Start difference. First operand 136 states and 368 transitions. Second operand 3 states. [2018-06-24 20:31:15,741 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:31:15,741 INFO ]: Finished difference Result 268 states and 587 transitions. [2018-06-24 20:31:15,742 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:31:15,742 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:31:15,742 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:31:15,762 INFO ]: With dead ends: 268 [2018-06-24 20:31:15,762 INFO ]: Without dead ends: 268 [2018-06-24 20:31:15,763 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:31:15,763 INFO ]: Start minimizeSevpa. Operand 268 states. [2018-06-24 20:31:15,817 INFO ]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-06-24 20:31:15,817 INFO ]: Start removeUnreachable. Operand 268 states. [2018-06-24 20:31:15,830 INFO ]: Finished removeUnreachable. Reduced from 268 states to 268 states and 587 transitions. [2018-06-24 20:31:15,830 INFO ]: Start accepts. Automaton has 268 states and 587 transitions. Word has length 5 [2018-06-24 20:31:15,830 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:31:15,830 INFO ]: Abstraction has 268 states and 587 transitions. [2018-06-24 20:31:15,830 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:31:15,830 INFO ]: Start isEmpty. Operand 268 states and 587 transitions. [2018-06-24 20:31:15,838 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:31:15,838 INFO ]: Found error trace [2018-06-24 20:31:15,838 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:31:15,839 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:31:15,839 INFO ]: Analyzing trace with hash 175951705, now seen corresponding path program 1 times [2018-06-24 20:31:15,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:31:15,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:31:15,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:15,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:31:15,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:15,857 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:31:15,959 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:31:15,959 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:31:15,959 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:31:15,959 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:31:15,960 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:31:15,960 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:31:15,960 INFO ]: Start difference. First operand 268 states and 587 transitions. Second operand 3 states. [2018-06-24 20:31:16,956 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:31:16,956 INFO ]: Finished difference Result 400 states and 804 transitions. [2018-06-24 20:31:16,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:31:16,956 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:31:16,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:31:16,977 INFO ]: With dead ends: 400 [2018-06-24 20:31:16,977 INFO ]: Without dead ends: 400 [2018-06-24 20:31:16,977 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:31:16,978 INFO ]: Start minimizeSevpa. Operand 400 states. [2018-06-24 20:31:17,036 INFO ]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-06-24 20:31:17,036 INFO ]: Start removeUnreachable. Operand 400 states. [2018-06-24 20:31:17,050 INFO ]: Finished removeUnreachable. Reduced from 400 states to 400 states and 804 transitions. [2018-06-24 20:31:17,050 INFO ]: Start accepts. Automaton has 400 states and 804 transitions. Word has length 5 [2018-06-24 20:31:17,051 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:31:17,051 INFO ]: Abstraction has 400 states and 804 transitions. [2018-06-24 20:31:17,051 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:31:17,051 INFO ]: Start isEmpty. Operand 400 states and 804 transitions. [2018-06-24 20:31:17,081 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:31:17,081 INFO ]: Found error trace [2018-06-24 20:31:17,081 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:31:17,082 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:31:17,082 INFO ]: Analyzing trace with hash 93121661, now seen corresponding path program 1 times [2018-06-24 20:31:17,082 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:31:17,082 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:31:17,082 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:17,082 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:31:17,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:17,153 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:31:17,421 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:31:17,421 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:31:17,421 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:31:17,421 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:31:17,421 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:31:17,421 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:31:17,421 INFO ]: Start difference. First operand 400 states and 804 transitions. Second operand 5 states. [2018-06-24 20:31:21,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:31:21,659 INFO ]: Finished difference Result 986 states and 2961 transitions. [2018-06-24 20:31:21,659 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:31:21,660 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:31:21,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:31:21,808 INFO ]: With dead ends: 986 [2018-06-24 20:31:21,808 INFO ]: Without dead ends: 981 [2018-06-24 20:31:21,808 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 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-24 20:31:21,809 INFO ]: Start minimizeSevpa. Operand 981 states. [2018-06-24 20:31:22,064 INFO ]: Finished minimizeSevpa. Reduced states from 981 to 763. [2018-06-24 20:31:22,064 INFO ]: Start removeUnreachable. Operand 763 states. [2018-06-24 20:31:22,095 INFO ]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1985 transitions. [2018-06-24 20:31:22,095 INFO ]: Start accepts. Automaton has 763 states and 1985 transitions. Word has length 9 [2018-06-24 20:31:22,095 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:31:22,095 INFO ]: Abstraction has 763 states and 1985 transitions. [2018-06-24 20:31:22,095 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:31:22,095 INFO ]: Start isEmpty. Operand 763 states and 1985 transitions. [2018-06-24 20:31:22,124 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:31:22,124 INFO ]: Found error trace [2018-06-24 20:31:22,124 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:31:22,124 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:31:22,124 INFO ]: Analyzing trace with hash 94968703, now seen corresponding path program 1 times [2018-06-24 20:31:22,124 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:31:22,124 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:31:22,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:22,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:31:22,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:22,179 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:31:22,376 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:31:22,376 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:31:22,376 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:31:22,376 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:31:22,376 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:31:22,376 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:31:22,376 INFO ]: Start difference. First operand 763 states and 1985 transitions. Second operand 5 states. [2018-06-24 20:31:26,815 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:31:26,815 INFO ]: Finished difference Result 1864 states and 6506 transitions. [2018-06-24 20:31:26,817 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:31:26,817 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:31:26,817 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:31:27,033 INFO ]: With dead ends: 1864 [2018-06-24 20:31:27,033 INFO ]: Without dead ends: 1856 [2018-06-24 20:31:27,033 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:31:27,035 INFO ]: Start minimizeSevpa. Operand 1856 states. [2018-06-24 20:31:27,621 INFO ]: Finished minimizeSevpa. Reduced states from 1856 to 1460. [2018-06-24 20:31:27,621 INFO ]: Start removeUnreachable. Operand 1460 states. [2018-06-24 20:31:27,692 INFO ]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 4646 transitions. [2018-06-24 20:31:27,692 INFO ]: Start accepts. Automaton has 1460 states and 4646 transitions. Word has length 9 [2018-06-24 20:31:27,693 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:31:27,693 INFO ]: Abstraction has 1460 states and 4646 transitions. [2018-06-24 20:31:27,693 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:31:27,693 INFO ]: Start isEmpty. Operand 1460 states and 4646 transitions. [2018-06-24 20:31:27,728 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:31:27,728 INFO ]: Found error trace [2018-06-24 20:31:27,728 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:31:27,728 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:31:27,729 INFO ]: Analyzing trace with hash -1886486658, now seen corresponding path program 1 times [2018-06-24 20:31:27,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:31:27,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:31:27,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:27,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:31:27,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:27,780 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:31:27,996 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:31:27,996 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:31:27,996 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:31:27,996 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:31:27,996 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:31:27,996 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:31:27,997 INFO ]: Start difference. First operand 1460 states and 4646 transitions. Second operand 5 states. [2018-06-24 20:31:29,417 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:31:29,418 INFO ]: Finished difference Result 2537 states and 9950 transitions. [2018-06-24 20:31:29,418 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:31:29,418 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:31:29,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:31:29,598 INFO ]: With dead ends: 2537 [2018-06-24 20:31:29,598 INFO ]: Without dead ends: 2537 [2018-06-24 20:31:29,598 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 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-24 20:31:29,599 INFO ]: Start minimizeSevpa. Operand 2537 states. [2018-06-24 20:31:30,323 INFO ]: Finished minimizeSevpa. Reduced states from 2537 to 2024. [2018-06-24 20:31:30,324 INFO ]: Start removeUnreachable. Operand 2024 states. [2018-06-24 20:31:30,688 INFO ]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 6351 transitions. [2018-06-24 20:31:30,688 INFO ]: Start accepts. Automaton has 2024 states and 6351 transitions. Word has length 9 [2018-06-24 20:31:30,689 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:31:30,689 INFO ]: Abstraction has 2024 states and 6351 transitions. [2018-06-24 20:31:30,689 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:31:30,689 INFO ]: Start isEmpty. Operand 2024 states and 6351 transitions. [2018-06-24 20:31:30,751 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:31:30,751 INFO ]: Found error trace [2018-06-24 20:31:30,751 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:31:30,751 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:31:30,751 INFO ]: Analyzing trace with hash -346284219, now seen corresponding path program 1 times [2018-06-24 20:31:30,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:31:30,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:31:30,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:30,752 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:31:30,752 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:30,811 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:31:31,190 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:31:31,190 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:31:31,190 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:31:31,190 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:31:31,191 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:31:31,191 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:31:31,191 INFO ]: Start difference. First operand 2024 states and 6351 transitions. Second operand 6 states. [2018-06-24 20:31:35,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:31:35,797 INFO ]: Finished difference Result 5323 states and 26856 transitions. [2018-06-24 20:31:35,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:31:35,827 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:31:35,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:31:36,376 INFO ]: With dead ends: 5323 [2018-06-24 20:31:36,376 INFO ]: Without dead ends: 5116 [2018-06-24 20:31:36,376 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:31:36,384 INFO ]: Start minimizeSevpa. Operand 5116 states. [2018-06-24 20:31:38,175 INFO ]: Finished minimizeSevpa. Reduced states from 5116 to 3396. [2018-06-24 20:31:38,180 INFO ]: Start removeUnreachable. Operand 3396 states. [2018-06-24 20:31:38,391 INFO ]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 11384 transitions. [2018-06-24 20:31:38,391 INFO ]: Start accepts. Automaton has 3396 states and 11384 transitions. Word has length 10 [2018-06-24 20:31:38,391 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:31:38,391 INFO ]: Abstraction has 3396 states and 11384 transitions. [2018-06-24 20:31:38,391 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:31:38,391 INFO ]: Start isEmpty. Operand 3396 states and 11384 transitions. [2018-06-24 20:31:38,484 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:31:38,484 INFO ]: Found error trace [2018-06-24 20:31:38,484 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:31:38,484 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:31:38,484 INFO ]: Analyzing trace with hash -346282297, now seen corresponding path program 1 times [2018-06-24 20:31:38,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:31:38,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:31:38,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:38,486 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:31:38,486 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:38,531 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:31:38,673 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:31:38,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:31:38,673 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:31:38,674 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:31:38,674 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:31:38,674 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:31:38,674 INFO ]: Start difference. First operand 3396 states and 11384 transitions. Second operand 6 states. [2018-06-24 20:31:43,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:31:43,939 INFO ]: Finished difference Result 5469 states and 33701 transitions. [2018-06-24 20:31:43,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:31:43,942 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:31:43,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:31:44,734 INFO ]: With dead ends: 5469 [2018-06-24 20:31:44,734 INFO ]: Without dead ends: 5395 [2018-06-24 20:31:44,735 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:31:44,738 INFO ]: Start minimizeSevpa. Operand 5395 states. [2018-06-24 20:31:46,530 INFO ]: Finished minimizeSevpa. Reduced states from 5395 to 3764. [2018-06-24 20:31:46,530 INFO ]: Start removeUnreachable. Operand 3764 states. [2018-06-24 20:31:46,740 INFO ]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 13415 transitions. [2018-06-24 20:31:46,740 INFO ]: Start accepts. Automaton has 3764 states and 13415 transitions. Word has length 10 [2018-06-24 20:31:46,740 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:31:46,740 INFO ]: Abstraction has 3764 states and 13415 transitions. [2018-06-24 20:31:46,740 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:31:46,740 INFO ]: Start isEmpty. Operand 3764 states and 13415 transitions. [2018-06-24 20:31:46,789 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:31:46,789 INFO ]: Found error trace [2018-06-24 20:31:46,789 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:31:46,789 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:31:46,791 INFO ]: Analyzing trace with hash -627532827, now seen corresponding path program 1 times [2018-06-24 20:31:46,791 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:31:46,791 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:31:46,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:46,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:31:46,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:31:46,844 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:31:47,025 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:31:47,025 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:31:47,025 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:31:47,025 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:31:47,026 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:31:47,026 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:31:47,026 INFO ]: Start difference. First operand 3764 states and 13415 transitions. Second operand 6 states. [2018-06-24 20:32:02,527 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:32:02,527 INFO ]: Finished difference Result 13287 states and 130065 transitions. [2018-06-24 20:32:02,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:32:02,528 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:32:02,528 INFO ]: Finished accepts. some prefix is accepted. Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown