java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 06:58:09,653 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 06:58:09,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 06:58:09,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 06:58:09,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 06:58:09,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 06:58:09,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 06:58:09,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 06:58:09,676 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 06:58:09,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 06:58:09,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 06:58:09,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 06:58:09,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 06:58:09,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 06:58:09,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 06:58:09,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 06:58:09,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 06:58:09,696 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 06:58:09,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 06:58:09,701 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 06:58:09,702 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 06:58:09,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 06:58:09,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 06:58:09,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 06:58:09,706 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 06:58:09,707 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 06:58:09,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 06:58:09,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 06:58:09,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 06:58:09,711 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 06:58:09,711 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 06:58:09,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 06:58:09,712 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 06:58:09,717 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 06:58:09,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 06:58:09,718 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 06:58:09,743 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 06:58:09,743 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 06:58:09,743 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 06:58:09,743 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 06:58:09,744 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 06:58:09,745 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 06:58:09,745 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 06:58:09,745 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 06:58:09,745 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 06:58:09,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 06:58:09,746 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 06:58:09,747 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 06:58:09,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:58:09,747 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 06:58:09,747 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 06:58:09,748 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 06:58:09,748 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 06:58:09,748 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 06:58:09,748 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 06:58:09,748 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 06:58:09,748 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 06:58:09,750 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 06:58:09,750 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 06:58:09,798 INFO ]: Repository-Root is: /tmp [2018-06-25 06:58:09,815 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 06:58:09,819 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 06:58:09,820 INFO ]: Initializing SmtParser... [2018-06-25 06:58:09,820 INFO ]: SmtParser initialized [2018-06-25 06:58:09,821 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449.smt2 [2018-06-25 06:58:09,822 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 06:58:09,905 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449.smt2 unknown [2018-06-25 06:58:10,255 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/speed2_e8_449.smt2 [2018-06-25 06:58:10,259 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 06:58:10,268 INFO ]: Walking toolchain with 5 elements. [2018-06-25 06:58:10,268 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 06:58:10,269 INFO ]: Initializing ChcToBoogie... [2018-06-25 06:58:10,275 INFO ]: ChcToBoogie initialized [2018-06-25 06:58:10,278 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:58:10" (1/1) ... [2018-06-25 06:58:10,341 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10 Unit [2018-06-25 06:58:10,341 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 06:58:10,341 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 06:58:10,341 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 06:58:10,341 INFO ]: Boogie Preprocessor initialized [2018-06-25 06:58:10,363 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10" (1/1) ... [2018-06-25 06:58:10,363 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10" (1/1) ... [2018-06-25 06:58:10,371 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10" (1/1) ... [2018-06-25 06:58:10,371 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10" (1/1) ... [2018-06-25 06:58:10,382 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10" (1/1) ... [2018-06-25 06:58:10,390 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10" (1/1) ... [2018-06-25 06:58:10,391 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10" (1/1) ... [2018-06-25 06:58:10,393 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 06:58:10,393 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 06:58:10,393 INFO ]: Initializing RCFGBuilder... [2018-06-25 06:58:10,393 INFO ]: RCFGBuilder initialized [2018-06-25 06:58:10,394 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 06:58:10,416 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 06:58:10,416 INFO ]: Found specification of procedure gotoProc [2018-06-25 06:58:10,416 INFO ]: Found implementation of procedure gotoProc [2018-06-25 06:58:10,416 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 06:58:10,416 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 06:58:10,416 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 06:58:10,751 INFO ]: Using library mode [2018-06-25 06:58:10,751 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:58:10 BoogieIcfgContainer [2018-06-25 06:58:10,751 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 06:58:10,757 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 06:58:10,757 INFO ]: Initializing BlockEncodingV2... [2018-06-25 06:58:10,758 INFO ]: BlockEncodingV2 initialized [2018-06-25 06:58:10,758 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:58:10" (1/1) ... [2018-06-25 06:58:10,776 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 06:58:10,777 INFO ]: Using Remove infeasible edges [2018-06-25 06:58:10,778 INFO ]: Using Maximize final states [2018-06-25 06:58:10,778 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 06:58:10,778 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 06:58:10,781 INFO ]: Using Remove sink states [2018-06-25 06:58:10,781 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 06:58:10,781 INFO ]: Using Use SBE [2018-06-25 06:58:10,796 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 06:58:12,883 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 06:58:13,542 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:58:13,792 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 06:58:13,793 INFO ]: SBE split 2 edges [2018-06-25 06:58:13,815 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 06:58:13,820 INFO ]: 0 new accepting states [2018-06-25 06:58:25,387 INFO ]: Removed 2067 edges and 2 locations by large block encoding [2018-06-25 06:58:25,390 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:58:25,412 INFO ]: Removed 12 edges and 0 locations because of local infeasibility [2018-06-25 06:58:25,414 INFO ]: 0 new accepting states [2018-06-25 06:58:25,420 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:58:25,420 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:58:25,427 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 06:58:25,429 INFO ]: 0 new accepting states [2018-06-25 06:58:25,431 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 06:58:25,433 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 06:58:25,448 INFO ]: Encoded RCFG 6 locations, 2057 edges [2018-06-25 06:58:25,448 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:58:25 BasicIcfg [2018-06-25 06:58:25,448 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 06:58:25,451 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 06:58:25,451 INFO ]: Initializing TraceAbstraction... [2018-06-25 06:58:25,454 INFO ]: TraceAbstraction initialized [2018-06-25 06:58:25,455 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 06:58:10" (1/4) ... [2018-06-25 06:58:25,457 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427b6aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 06:58:25, skipping insertion in model container [2018-06-25 06:58:25,457 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 06:58:10" (2/4) ... [2018-06-25 06:58:25,457 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427b6aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 06:58:25, skipping insertion in model container [2018-06-25 06:58:25,457 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 06:58:10" (3/4) ... [2018-06-25 06:58:25,457 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427b6aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:58:25, skipping insertion in model container [2018-06-25 06:58:25,457 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 06:58:25" (4/4) ... [2018-06-25 06:58:25,459 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 06:58:25,471 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 06:58:25,482 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 06:58:25,547 INFO ]: Using default assertion order modulation [2018-06-25 06:58:25,548 INFO ]: Interprodecural is true [2018-06-25 06:58:25,548 INFO ]: Hoare is false [2018-06-25 06:58:25,548 INFO ]: Compute interpolants for FPandBP [2018-06-25 06:58:25,548 INFO ]: Backedges is TWOTRACK [2018-06-25 06:58:25,548 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 06:58:25,548 INFO ]: Difference is false [2018-06-25 06:58:25,548 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 06:58:25,548 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 06:58:25,577 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 06:58:25,602 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:25,602 INFO ]: Found error trace [2018-06-25 06:58:25,603 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:25,603 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:25,609 INFO ]: Analyzing trace with hash 161085986, now seen corresponding path program 1 times [2018-06-25 06:58:25,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:25,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:25,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:25,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:25,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:25,711 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:25,824 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:25,827 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:25,827 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:25,829 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:25,845 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:25,846 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:25,849 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 06:58:29,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:29,237 INFO ]: Finished difference Result 7 states and 2058 transitions. [2018-06-25 06:58:29,237 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:29,238 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:29,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:29,255 INFO ]: With dead ends: 7 [2018-06-25 06:58:29,255 INFO ]: Without dead ends: 7 [2018-06-25 06:58:29,257 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:29,277 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:29,332 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:29,333 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:29,338 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:29,340 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:29,341 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:29,341 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:29,341 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:29,341 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:29,342 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:29,343 INFO ]: Found error trace [2018-06-25 06:58:29,343 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:29,343 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:29,343 INFO ]: Analyzing trace with hash 161115777, now seen corresponding path program 1 times [2018-06-25 06:58:29,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:29,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:29,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:29,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:29,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:29,353 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:29,380 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:29,380 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:29,380 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:29,382 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:29,382 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:29,382 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:29,382 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:32,204 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:32,204 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:32,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:32,205 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:32,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:32,208 INFO ]: With dead ends: 9 [2018-06-25 06:58:32,208 INFO ]: Without dead ends: 9 [2018-06-25 06:58:32,208 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:32,209 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:32,223 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:32,223 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:32,228 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:32,228 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:32,228 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:32,228 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:32,228 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:32,228 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:32,229 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:32,229 INFO ]: Found error trace [2018-06-25 06:58:32,229 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:32,229 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:32,229 INFO ]: Analyzing trace with hash 161205150, now seen corresponding path program 1 times [2018-06-25 06:58:32,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:32,230 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:32,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:32,230 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:32,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:32,252 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:32,293 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:32,293 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:32,293 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:32,293 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:32,294 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:32,294 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:32,294 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:34,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:34,829 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:34,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:34,829 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:34,830 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:34,833 INFO ]: With dead ends: 9 [2018-06-25 06:58:34,833 INFO ]: Without dead ends: 9 [2018-06-25 06:58:34,833 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:34,833 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:34,847 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:34,847 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:34,850 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:34,850 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:34,851 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:34,851 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:34,851 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:34,852 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:34,853 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:34,853 INFO ]: Found error trace [2018-06-25 06:58:34,853 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:34,853 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:34,853 INFO ]: Analyzing trace with hash 161264732, now seen corresponding path program 1 times [2018-06-25 06:58:34,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:34,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:34,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:34,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:34,854 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:34,872 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:34,928 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:34,928 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:34,928 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:34,928 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:34,928 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:34,928 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:34,928 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:36,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:36,807 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:36,807 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:36,807 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:36,807 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:36,810 INFO ]: With dead ends: 9 [2018-06-25 06:58:36,810 INFO ]: Without dead ends: 9 [2018-06-25 06:58:36,811 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:36,811 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:36,823 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:36,823 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:36,826 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:36,826 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:36,826 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:36,827 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:36,827 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:36,827 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:36,828 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:36,828 INFO ]: Found error trace [2018-06-25 06:58:36,828 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:36,828 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:36,828 INFO ]: Analyzing trace with hash 161443478, now seen corresponding path program 1 times [2018-06-25 06:58:36,828 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:36,828 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:36,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:36,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:36,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:36,842 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:36,922 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:36,922 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:36,922 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:36,922 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:36,922 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:36,922 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:36,923 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:39,059 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:39,059 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:39,061 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:39,061 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:39,061 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:39,063 INFO ]: With dead ends: 9 [2018-06-25 06:58:39,064 INFO ]: Without dead ends: 9 [2018-06-25 06:58:39,064 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:39,064 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:39,073 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:39,073 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:39,077 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:39,077 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:39,077 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:39,077 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:39,077 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:39,077 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:39,078 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:39,078 INFO ]: Found error trace [2018-06-25 06:58:39,078 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:39,078 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:39,079 INFO ]: Analyzing trace with hash 100878375, now seen corresponding path program 1 times [2018-06-25 06:58:39,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:39,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:39,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:39,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:39,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:39,097 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:39,157 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:39,157 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:39,157 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:39,157 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:39,158 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:39,158 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:39,158 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:40,897 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:40,897 INFO ]: Finished difference Result 10 states and 2063 transitions. [2018-06-25 06:58:40,898 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:40,898 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:40,898 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:40,901 INFO ]: With dead ends: 10 [2018-06-25 06:58:40,901 INFO ]: Without dead ends: 10 [2018-06-25 06:58:40,902 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:40,902 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 06:58:40,909 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 06:58:40,910 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:40,913 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2061 transitions. [2018-06-25 06:58:40,913 INFO ]: Start accepts. Automaton has 8 states and 2061 transitions. Word has length 5 [2018-06-25 06:58:40,913 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:40,913 INFO ]: Abstraction has 8 states and 2061 transitions. [2018-06-25 06:58:40,913 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:40,913 INFO ]: Start isEmpty. Operand 8 states and 2061 transitions. [2018-06-25 06:58:40,915 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 06:58:40,915 INFO ]: Found error trace [2018-06-25 06:58:40,915 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 06:58:40,915 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:40,915 INFO ]: Analyzing trace with hash 100879336, now seen corresponding path program 1 times [2018-06-25 06:58:40,915 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:40,915 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:40,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:40,916 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:40,916 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:40,932 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:40,987 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:40,987 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:40,987 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:40,987 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:40,988 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:40,988 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:40,988 INFO ]: Start difference. First operand 8 states and 2061 transitions. Second operand 3 states. [2018-06-25 06:58:42,556 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:42,556 INFO ]: Finished difference Result 9 states and 2060 transitions. [2018-06-25 06:58:42,561 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:42,561 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 06:58:42,561 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:42,563 INFO ]: With dead ends: 9 [2018-06-25 06:58:42,563 INFO ]: Without dead ends: 9 [2018-06-25 06:58:42,563 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:42,563 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 06:58:42,568 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-06-25 06:58:42,568 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:42,571 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2058 transitions. [2018-06-25 06:58:42,571 INFO ]: Start accepts. Automaton has 7 states and 2058 transitions. Word has length 5 [2018-06-25 06:58:42,571 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:42,571 INFO ]: Abstraction has 7 states and 2058 transitions. [2018-06-25 06:58:42,571 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:42,571 INFO ]: Start isEmpty. Operand 7 states and 2058 transitions. [2018-06-25 06:58:42,572 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:42,572 INFO ]: Found error trace [2018-06-25 06:58:42,572 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:42,573 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:42,573 INFO ]: Analyzing trace with hash 579710292, now seen corresponding path program 1 times [2018-06-25 06:58:42,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:42,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:42,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:42,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:42,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:42,595 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:42,646 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:42,646 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:42,646 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:42,647 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:42,647 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:42,647 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:42,647 INFO ]: Start difference. First operand 7 states and 2058 transitions. Second operand 3 states. [2018-06-25 06:58:44,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:44,520 INFO ]: Finished difference Result 8 states and 2058 transitions. [2018-06-25 06:58:44,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:44,605 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:44,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:44,607 INFO ]: With dead ends: 8 [2018-06-25 06:58:44,607 INFO ]: Without dead ends: 7 [2018-06-25 06:58:44,607 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:44,608 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:44,612 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:44,612 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:44,612 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1034 transitions. [2018-06-25 06:58:44,613 INFO ]: Start accepts. Automaton has 7 states and 1034 transitions. Word has length 6 [2018-06-25 06:58:44,613 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:44,613 INFO ]: Abstraction has 7 states and 1034 transitions. [2018-06-25 06:58:44,613 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:44,613 INFO ]: Start isEmpty. Operand 7 states and 1034 transitions. [2018-06-25 06:58:44,613 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:44,613 INFO ]: Found error trace [2018-06-25 06:58:44,613 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:44,613 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:44,614 INFO ]: Analyzing trace with hash 582480855, now seen corresponding path program 1 times [2018-06-25 06:58:44,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:44,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:44,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:44,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:44,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:44,629 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:44,685 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:44,685 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:44,685 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:44,686 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:44,686 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:44,686 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:44,686 INFO ]: Start difference. First operand 7 states and 1034 transitions. Second operand 3 states. [2018-06-25 06:58:45,565 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:45,565 INFO ]: Finished difference Result 8 states and 1034 transitions. [2018-06-25 06:58:45,566 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:45,566 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:45,566 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:45,567 INFO ]: With dead ends: 8 [2018-06-25 06:58:45,567 INFO ]: Without dead ends: 7 [2018-06-25 06:58:45,567 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:45,567 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:45,569 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:45,569 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:45,570 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 778 transitions. [2018-06-25 06:58:45,570 INFO ]: Start accepts. Automaton has 7 states and 778 transitions. Word has length 6 [2018-06-25 06:58:45,570 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:45,570 INFO ]: Abstraction has 7 states and 778 transitions. [2018-06-25 06:58:45,570 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:45,570 INFO ]: Start isEmpty. Operand 7 states and 778 transitions. [2018-06-25 06:58:45,571 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:45,571 INFO ]: Found error trace [2018-06-25 06:58:45,571 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:45,571 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:45,571 INFO ]: Analyzing trace with hash -365975212, now seen corresponding path program 1 times [2018-06-25 06:58:45,571 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:45,571 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:45,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:45,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:45,572 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:45,590 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:45,620 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:45,620 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:45,620 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:45,620 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:45,620 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:45,620 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:45,620 INFO ]: Start difference. First operand 7 states and 778 transitions. Second operand 3 states. [2018-06-25 06:58:46,365 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:46,365 INFO ]: Finished difference Result 8 states and 778 transitions. [2018-06-25 06:58:46,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:46,365 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:46,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:46,366 INFO ]: With dead ends: 8 [2018-06-25 06:58:46,366 INFO ]: Without dead ends: 7 [2018-06-25 06:58:46,366 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:46,366 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:46,368 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:46,368 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:46,369 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 586 transitions. [2018-06-25 06:58:46,369 INFO ]: Start accepts. Automaton has 7 states and 586 transitions. Word has length 6 [2018-06-25 06:58:46,369 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:46,369 INFO ]: Abstraction has 7 states and 586 transitions. [2018-06-25 06:58:46,369 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:46,369 INFO ]: Start isEmpty. Operand 7 states and 586 transitions. [2018-06-25 06:58:46,369 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:46,369 INFO ]: Found error trace [2018-06-25 06:58:46,369 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:46,369 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:46,370 INFO ]: Analyzing trace with hash -363204649, now seen corresponding path program 1 times [2018-06-25 06:58:46,370 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:46,370 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:46,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:46,370 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:46,370 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:46,383 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:46,469 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:46,469 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:46,469 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:46,469 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:46,469 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:46,469 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:46,470 INFO ]: Start difference. First operand 7 states and 586 transitions. Second operand 3 states. [2018-06-25 06:58:47,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:47,213 INFO ]: Finished difference Result 8 states and 586 transitions. [2018-06-25 06:58:47,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:47,213 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:47,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:47,214 INFO ]: With dead ends: 8 [2018-06-25 06:58:47,214 INFO ]: Without dead ends: 7 [2018-06-25 06:58:47,214 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:47,214 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:47,215 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:47,215 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:47,215 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-25 06:58:47,215 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 6 [2018-06-25 06:58:47,215 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:47,215 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-25 06:58:47,215 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:47,216 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-25 06:58:47,216 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:47,216 INFO ]: Found error trace [2018-06-25 06:58:47,216 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:47,216 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:47,216 INFO ]: Analyzing trace with hash -838817964, now seen corresponding path program 1 times [2018-06-25 06:58:47,216 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:47,216 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:47,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:47,217 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:47,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:47,235 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:47,269 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:47,269 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:47,269 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:47,269 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:47,269 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:47,269 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:47,269 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-25 06:58:47,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:47,639 INFO ]: Finished difference Result 8 states and 394 transitions. [2018-06-25 06:58:47,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:47,639 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:47,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:47,640 INFO ]: With dead ends: 8 [2018-06-25 06:58:47,640 INFO ]: Without dead ends: 7 [2018-06-25 06:58:47,640 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:47,640 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:47,641 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:47,641 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:47,641 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2018-06-25 06:58:47,641 INFO ]: Start accepts. Automaton has 7 states and 106 transitions. Word has length 6 [2018-06-25 06:58:47,641 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:47,641 INFO ]: Abstraction has 7 states and 106 transitions. [2018-06-25 06:58:47,641 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:47,641 INFO ]: Start isEmpty. Operand 7 states and 106 transitions. [2018-06-25 06:58:47,642 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:47,642 INFO ]: Found error trace [2018-06-25 06:58:47,642 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:47,642 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:47,642 INFO ]: Analyzing trace with hash -602396588, now seen corresponding path program 1 times [2018-06-25 06:58:47,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:47,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:47,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:47,643 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:47,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:47,663 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:47,726 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:47,727 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:47,727 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:47,727 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:47,727 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:47,727 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:47,727 INFO ]: Start difference. First operand 7 states and 106 transitions. Second operand 3 states. [2018-06-25 06:58:47,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:47,814 INFO ]: Finished difference Result 8 states and 106 transitions. [2018-06-25 06:58:47,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:47,814 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:47,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:47,814 INFO ]: With dead ends: 8 [2018-06-25 06:58:47,814 INFO ]: Without dead ends: 7 [2018-06-25 06:58:47,814 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:47,815 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:47,815 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:47,815 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:47,816 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2018-06-25 06:58:47,816 INFO ]: Start accepts. Automaton has 7 states and 82 transitions. Word has length 6 [2018-06-25 06:58:47,816 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:47,816 INFO ]: Abstraction has 7 states and 82 transitions. [2018-06-25 06:58:47,816 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:47,816 INFO ]: Start isEmpty. Operand 7 states and 82 transitions. [2018-06-25 06:58:47,816 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:47,816 INFO ]: Found error trace [2018-06-25 06:58:47,816 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:47,816 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:47,816 INFO ]: Analyzing trace with hash 461499604, now seen corresponding path program 1 times [2018-06-25 06:58:47,816 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:47,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:47,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:47,817 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:47,817 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:47,826 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:47,900 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:47,900 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:47,900 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:47,900 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:47,901 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:47,901 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:47,901 INFO ]: Start difference. First operand 7 states and 82 transitions. Second operand 3 states. [2018-06-25 06:58:47,973 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:47,973 INFO ]: Finished difference Result 8 states and 82 transitions. [2018-06-25 06:58:47,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:47,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:47,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:47,974 INFO ]: With dead ends: 8 [2018-06-25 06:58:47,974 INFO ]: Without dead ends: 7 [2018-06-25 06:58:47,974 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:47,974 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:47,975 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:47,975 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:47,975 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-06-25 06:58:47,975 INFO ]: Start accepts. Automaton has 7 states and 50 transitions. Word has length 6 [2018-06-25 06:58:47,975 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:47,975 INFO ]: Abstraction has 7 states and 50 transitions. [2018-06-25 06:58:47,975 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:47,975 INFO ]: Start isEmpty. Operand 7 states and 50 transitions. [2018-06-25 06:58:47,976 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:47,976 INFO ]: Found error trace [2018-06-25 06:58:47,976 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:47,976 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:47,976 INFO ]: Analyzing trace with hash -483262379, now seen corresponding path program 1 times [2018-06-25 06:58:47,976 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:47,976 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:47,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:47,977 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:47,977 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:47,986 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:48,085 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:48,086 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 06:58:48,086 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 06:58:48,086 INFO ]: Interpolant automaton has 3 states [2018-06-25 06:58:48,086 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 06:58:48,086 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 06:58:48,086 INFO ]: Start difference. First operand 7 states and 50 transitions. Second operand 3 states. [2018-06-25 06:58:48,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:48,173 INFO ]: Finished difference Result 8 states and 50 transitions. [2018-06-25 06:58:48,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 06:58:48,173 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 06:58:48,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:48,173 INFO ]: With dead ends: 8 [2018-06-25 06:58:48,173 INFO ]: Without dead ends: 7 [2018-06-25 06:58:48,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-25 06:58:48,174 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 06:58:48,174 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 06:58:48,175 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 06:58:48,175 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2018-06-25 06:58:48,175 INFO ]: Start accepts. Automaton has 7 states and 30 transitions. Word has length 6 [2018-06-25 06:58:48,175 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:48,175 INFO ]: Abstraction has 7 states and 30 transitions. [2018-06-25 06:58:48,175 INFO ]: Interpolant automaton has 3 states. [2018-06-25 06:58:48,175 INFO ]: Start isEmpty. Operand 7 states and 30 transitions. [2018-06-25 06:58:48,175 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 06:58:48,175 INFO ]: Found error trace [2018-06-25 06:58:48,175 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 06:58:48,175 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:48,175 INFO ]: Analyzing trace with hash -748312906, now seen corresponding path program 1 times [2018-06-25 06:58:48,175 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:48,175 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:48,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:48,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:48,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:48,185 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:48,305 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:48,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:48,305 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:58:48,315 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:48,361 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:48,370 INFO ]: Computing forward predicates... [2018-06-25 06:58:48,434 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:48,467 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:48,467 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 06:58:48,467 INFO ]: Interpolant automaton has 4 states [2018-06-25 06:58:48,467 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 06:58:48,467 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 06:58:48,467 INFO ]: Start difference. First operand 7 states and 30 transitions. Second operand 4 states. [2018-06-25 06:58:48,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:48,927 INFO ]: Finished difference Result 9 states and 31 transitions. [2018-06-25 06:58:48,928 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:58:48,928 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 06:58:48,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:48,928 INFO ]: With dead ends: 9 [2018-06-25 06:58:48,928 INFO ]: Without dead ends: 8 [2018-06-25 06:58:48,929 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 06:58:48,929 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:58:48,930 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:58:48,930 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:48,930 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-06-25 06:58:48,930 INFO ]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 6 [2018-06-25 06:58:48,930 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:48,930 INFO ]: Abstraction has 8 states and 15 transitions. [2018-06-25 06:58:48,930 INFO ]: Interpolant automaton has 4 states. [2018-06-25 06:58:48,930 INFO ]: Start isEmpty. Operand 8 states and 15 transitions. [2018-06-25 06:58:48,930 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:48,930 INFO ]: Found error trace [2018-06-25 06:58:48,930 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:48,930 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:48,930 INFO ]: Analyzing trace with hash 162783632, now seen corresponding path program 1 times [2018-06-25 06:58:48,930 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:48,930 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:48,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:48,931 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:48,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:48,961 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:49,574 WARN ]: Spent 518.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-06-25 06:58:49,845 WARN ]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 06:58:49,895 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:49,895 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:49,895 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:58:49,905 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:49,976 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:49,979 INFO ]: Computing forward predicates... [2018-06-25 06:58:50,570 WARN ]: Spent 135.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-06-25 06:58:50,642 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:50,662 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:50,662 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 06:58:50,662 INFO ]: Interpolant automaton has 7 states [2018-06-25 06:58:50,663 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 06:58:50,663 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:58:50,663 INFO ]: Start difference. First operand 8 states and 15 transitions. Second operand 7 states. [2018-06-25 06:58:50,806 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:50,806 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-25 06:58:50,806 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:58:50,806 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 06:58:50,806 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:50,806 INFO ]: With dead ends: 10 [2018-06-25 06:58:50,806 INFO ]: Without dead ends: 8 [2018-06-25 06:58:50,807 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:58:50,807 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:58:50,807 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:58:50,807 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:50,807 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-25 06:58:50,807 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 7 [2018-06-25 06:58:50,808 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:50,808 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-25 06:58:50,808 INFO ]: Interpolant automaton has 7 states. [2018-06-25 06:58:50,808 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-25 06:58:50,808 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:50,808 INFO ]: Found error trace [2018-06-25 06:58:50,808 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:50,808 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:50,808 INFO ]: Analyzing trace with hash -672218915, now seen corresponding path program 1 times [2018-06-25 06:58:50,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:50,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:50,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:50,809 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:50,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:50,829 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:51,067 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 06:58:51,339 WARN ]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 06:58:51,487 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:51,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:51,487 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 06:58:51,499 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:58:51,555 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:51,558 INFO ]: Computing forward predicates... [2018-06-25 06:58:51,756 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-06-25 06:58:51,937 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:51,962 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:51,962 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 06:58:51,962 INFO ]: Interpolant automaton has 8 states [2018-06-25 06:58:51,962 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 06:58:51,962 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 06:58:51,962 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 8 states. [2018-06-25 06:58:52,522 WARN ]: Spent 175.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-06-25 06:58:52,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:52,540 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-25 06:58:52,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 06:58:52,540 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 06:58:52,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:52,540 INFO ]: With dead ends: 10 [2018-06-25 06:58:52,540 INFO ]: Without dead ends: 8 [2018-06-25 06:58:52,541 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-25 06:58:52,541 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 06:58:52,542 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 06:58:52,542 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 06:58:52,542 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-25 06:58:52,542 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 7 [2018-06-25 06:58:52,542 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:52,542 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-25 06:58:52,542 INFO ]: Interpolant automaton has 8 states. [2018-06-25 06:58:52,542 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-25 06:58:52,543 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 06:58:52,543 INFO ]: Found error trace [2018-06-25 06:58:52,543 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 06:58:52,543 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 06:58:52,543 INFO ]: Analyzing trace with hash -581574294, now seen corresponding path program 1 times [2018-06-25 06:58:52,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 06:58:52,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 06:58:52,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:52,543 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 06:58:52,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 06:58:52,556 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:52,786 WARN ]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 06:58:53,050 WARN ]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 06:58:53,201 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:53,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 06:58:53,201 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 06:58:53,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 06:58:53,265 INFO ]: Conjunction of SSA is unsat [2018-06-25 06:58:53,267 INFO ]: Computing forward predicates... [2018-06-25 06:58:53,477 WARN ]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-06-25 06:58:53,656 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 06:58:53,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 06:58:53,676 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 06:58:53,677 INFO ]: Interpolant automaton has 7 states [2018-06-25 06:58:53,677 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 06:58:53,677 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 06:58:53,677 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 7 states. [2018-06-25 06:58:53,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 06:58:53,722 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 06:58:53,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 06:58:53,722 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 06:58:53,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 06:58:53,722 INFO ]: With dead ends: 4 [2018-06-25 06:58:53,722 INFO ]: Without dead ends: 0 [2018-06-25 06:58:53,722 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-25 06:58:53,723 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 06:58:53,723 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 06:58:53,723 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 06:58:53,723 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 06:58:53,723 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 06:58:53,723 INFO ]: Finished accepts. word is rejected. [2018-06-25 06:58:53,723 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 06:58:53,723 INFO ]: Interpolant automaton has 7 states. [2018-06-25 06:58:53,723 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 06:58:53,723 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 06:58:53,725 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 06:58:53,726 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 06:58:53 BasicIcfg [2018-06-25 06:58:53,726 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 06:58:53,727 INFO ]: Toolchain (without parser) took 43466.86 ms. Allocated memory was 302.0 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 254.5 MB in the beginning and 815.3 MB in the end (delta: -560.8 MB). Peak memory consumption was 450.6 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:53,727 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 06:58:53,728 INFO ]: ChcToBoogie took 72.50 ms. Allocated memory is still 302.0 MB. Free memory was 254.5 MB in the beginning and 251.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:53,728 INFO ]: Boogie Preprocessor took 51.56 ms. Allocated memory is still 302.0 MB. Free memory was 251.5 MB in the beginning and 250.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 06:58:53,728 INFO ]: RCFGBuilder took 358.06 ms. Allocated memory is still 302.0 MB. Free memory was 250.5 MB in the beginning and 236.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:53,729 INFO ]: BlockEncodingV2 took 14691.73 ms. Allocated memory was 302.0 MB in the beginning and 731.9 MB in the end (delta: 429.9 MB). Free memory was 236.5 MB in the beginning and 362.6 MB in the end (delta: -126.1 MB). Peak memory consumption was 403.8 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:53,729 INFO ]: TraceAbstraction took 28275.10 ms. Allocated memory was 731.9 MB in the beginning and 1.3 GB in the end (delta: 581.4 MB). Free memory was 362.6 MB in the beginning and 815.3 MB in the end (delta: -452.7 MB). Peak memory consumption was 128.8 MB. Max. memory is 3.6 GB. [2018-06-25 06:58:53,732 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 2057 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.6 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 72.50 ms. Allocated memory is still 302.0 MB. Free memory was 254.5 MB in the beginning and 251.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 51.56 ms. Allocated memory is still 302.0 MB. Free memory was 251.5 MB in the beginning and 250.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 358.06 ms. Allocated memory is still 302.0 MB. Free memory was 250.5 MB in the beginning and 236.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 14691.73 ms. Allocated memory was 302.0 MB in the beginning and 731.9 MB in the end (delta: 429.9 MB). Free memory was 236.5 MB in the beginning and 362.6 MB in the end (delta: -126.1 MB). Peak memory consumption was 403.8 MB. Max. memory is 3.6 GB. * TraceAbstraction took 28275.10 ms. Allocated memory was 731.9 MB in the beginning and 1.3 GB in the end (delta: 581.4 MB). Free memory was 362.6 MB in the beginning and 815.3 MB in the end (delta: -452.7 MB). Peak memory consumption was 128.8 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. SAFE Result, 28.2s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 22.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 19525 SDtfs, 2 SDslu, 85 SDs, 0 SdLazy, 9330 SolverSat, 10289 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 137 NumberOfCodeBlocks, 137 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_06-58-53-743.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_06-58-53-743.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_06-58-53-743.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/speed2_e8_449.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_06-58-53-743.csv Received shutdown request...