java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_9.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 20:50:09,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 20:50:09,688 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 20:50:09,700 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 20:50:09,700 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 20:50:09,701 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 20:50:09,702 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 20:50:09,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 20:50:09,706 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 20:50:09,706 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 20:50:09,707 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 20:50:09,707 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 20:50:09,709 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 20:50:09,710 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 20:50:09,711 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 20:50:09,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 20:50:09,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 20:50:09,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 20:50:09,730 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 20:50:09,731 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 20:50:09,732 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 20:50:09,733 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 20:50:09,735 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 20:50:09,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 20:50:09,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 20:50:09,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 20:50:09,737 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 20:50:09,740 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 20:50:09,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 20:50:09,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 20:50:09,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 20:50:09,743 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 20:50:09,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 20:50:09,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 20:50:09,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 20:50:09,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 20:50:09,746 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 20:50:09,767 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 20:50:09,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 20:50:09,767 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 20:50:09,767 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 20:50:09,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 20:50:09,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 20:50:09,770 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 20:50:09,770 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 20:50:09,770 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 20:50:09,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 20:50:09,771 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 20:50:09,771 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 20:50:09,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:50:09,771 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 20:50:09,772 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 20:50:09,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 20:50:09,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 20:50:09,772 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 20:50:09,772 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 20:50:09,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 20:50:09,774 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 20:50:09,776 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 20:50:09,776 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 20:50:09,830 INFO ]: Repository-Root is: /tmp [2018-06-26 20:50:09,843 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 20:50:09,851 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 20:50:09,853 INFO ]: Initializing SmtParser... [2018-06-26 20:50:09,853 INFO ]: SmtParser initialized [2018-06-26 20:50:09,853 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_9.cil.smt2 [2018-06-26 20:50:09,855 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 20:50:09,938 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_9.cil.smt2 unknown [2018-06-26 20:50:10,500 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_9.cil.smt2 [2018-06-26 20:50:10,505 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 20:50:10,510 INFO ]: Walking toolchain with 5 elements. [2018-06-26 20:50:10,511 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 20:50:10,511 INFO ]: Initializing ChcToBoogie... [2018-06-26 20:50:10,511 INFO ]: ChcToBoogie initialized [2018-06-26 20:50:10,514 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:50:10" (1/1) ... [2018-06-26 20:50:10,586 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:10 Unit [2018-06-26 20:50:10,587 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 20:50:10,588 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 20:50:10,588 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 20:50:10,588 INFO ]: Boogie Preprocessor initialized [2018-06-26 20:50:10,628 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:10" (1/1) ... [2018-06-26 20:50:10,628 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:10" (1/1) ... [2018-06-26 20:50:10,657 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:10" (1/1) ... [2018-06-26 20:50:10,657 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:10" (1/1) ... [2018-06-26 20:50:10,690 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:10" (1/1) ... [2018-06-26 20:50:10,692 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:10" (1/1) ... [2018-06-26 20:50:10,696 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:10" (1/1) ... [2018-06-26 20:50:10,702 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 20:50:10,702 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 20:50:10,702 INFO ]: Initializing RCFGBuilder... [2018-06-26 20:50:10,702 INFO ]: RCFGBuilder initialized [2018-06-26 20:50:10,703 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50: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-26 20:50:10,755 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 20:50:10,756 INFO ]: Found specification of procedure gotoProc [2018-06-26 20:50:10,756 INFO ]: Found implementation of procedure gotoProc [2018-06-26 20:50:10,756 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 20:50:10,756 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 20:50:10,756 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 20:50:11,175 INFO ]: Using library mode [2018-06-26 20:50:11,176 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:50:11 BoogieIcfgContainer [2018-06-26 20:50:11,176 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 20:50:11,176 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 20:50:11,176 INFO ]: Initializing BlockEncodingV2... [2018-06-26 20:50:11,177 INFO ]: BlockEncodingV2 initialized [2018-06-26 20:50:11,178 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:50:11" (1/1) ... [2018-06-26 20:50:11,200 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-26 20:50:11,202 INFO ]: Using Remove infeasible edges [2018-06-26 20:50:11,203 INFO ]: Using Maximize final states [2018-06-26 20:50:11,203 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 20:50:11,204 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 20:50:11,208 INFO ]: Using Remove sink states [2018-06-26 20:50:11,209 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 20:50:11,209 INFO ]: Using Use SBE [2018-06-26 20:50:12,819 INFO ]: SBE split 1 edges [2018-06-26 20:50:12,935 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 20:50:12,938 INFO ]: 0 new accepting states [2018-06-26 20:50:12,979 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 20:50:12,981 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:50:13,163 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 20:50:13,164 INFO ]: 0 new accepting states [2018-06-26 20:50:13,165 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 20:50:13,165 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 20:50:13,316 INFO ]: Encoded RCFG 6 locations, 1116 edges [2018-06-26 20:50:13,316 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:50:13 BasicIcfg [2018-06-26 20:50:13,316 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 20:50:13,317 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 20:50:13,317 INFO ]: Initializing TraceAbstraction... [2018-06-26 20:50:13,320 INFO ]: TraceAbstraction initialized [2018-06-26 20:50:13,321 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 08:50:10" (1/4) ... [2018-06-26 20:50:13,324 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c20df86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 08:50:13, skipping insertion in model container [2018-06-26 20:50:13,325 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 08:50:10" (2/4) ... [2018-06-26 20:50:13,325 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c20df86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 08:50:13, skipping insertion in model container [2018-06-26 20:50:13,325 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 08:50:11" (3/4) ... [2018-06-26 20:50:13,325 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c20df86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:50:13, skipping insertion in model container [2018-06-26 20:50:13,325 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 08:50:13" (4/4) ... [2018-06-26 20:50:13,327 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 20:50:13,337 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 20:50:13,345 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 20:50:13,390 INFO ]: Using default assertion order modulation [2018-06-26 20:50:13,390 INFO ]: Interprodecural is true [2018-06-26 20:50:13,390 INFO ]: Hoare is false [2018-06-26 20:50:13,391 INFO ]: Compute interpolants for FPandBP [2018-06-26 20:50:13,391 INFO ]: Backedges is TWOTRACK [2018-06-26 20:50:13,391 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 20:50:13,391 INFO ]: Difference is false [2018-06-26 20:50:13,391 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 20:50:13,391 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 20:50:13,406 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 20:50:13,426 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 20:50:13,426 INFO ]: Found error trace [2018-06-26 20:50:13,427 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 20:50:13,427 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:13,432 INFO ]: Analyzing trace with hash 69568034, now seen corresponding path program 1 times [2018-06-26 20:50:13,435 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:13,435 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:13,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:13,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:13,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:13,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:13,637 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:50:13,638 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:13,638 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:13,640 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:13,650 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:13,650 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:13,653 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 20:50:20,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:20,642 INFO ]: Finished difference Result 7 states and 1229 transitions. [2018-06-26 20:50:20,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:20,644 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 20:50:20,644 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:20,665 INFO ]: With dead ends: 7 [2018-06-26 20:50:20,665 INFO ]: Without dead ends: 7 [2018-06-26 20:50:20,667 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:20,679 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 20:50:20,723 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 20:50:20,725 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 20:50:20,727 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1229 transitions. [2018-06-26 20:50:20,728 INFO ]: Start accepts. Automaton has 7 states and 1229 transitions. Word has length 5 [2018-06-26 20:50:20,729 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:20,729 INFO ]: Abstraction has 7 states and 1229 transitions. [2018-06-26 20:50:20,729 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:20,729 INFO ]: Start isEmpty. Operand 7 states and 1229 transitions. [2018-06-26 20:50:20,730 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:50:20,730 INFO ]: Found error trace [2018-06-26 20:50:20,730 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:50:20,730 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:20,730 INFO ]: Analyzing trace with hash -2138837622, now seen corresponding path program 1 times [2018-06-26 20:50:20,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:20,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:20,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:20,734 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:20,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:20,801 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:20,915 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:50:20,916 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:20,916 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:20,917 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:20,917 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:20,917 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:20,917 INFO ]: Start difference. First operand 7 states and 1229 transitions. Second operand 3 states. [2018-06-26 20:50:24,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:24,093 INFO ]: Finished difference Result 8 states and 1231 transitions. [2018-06-26 20:50:24,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:24,093 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:50:24,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:24,094 INFO ]: With dead ends: 8 [2018-06-26 20:50:24,094 INFO ]: Without dead ends: 8 [2018-06-26 20:50:24,095 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:24,095 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 20:50:24,105 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 20:50:24,105 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 20:50:24,107 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1231 transitions. [2018-06-26 20:50:24,107 INFO ]: Start accepts. Automaton has 8 states and 1231 transitions. Word has length 6 [2018-06-26 20:50:24,107 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:24,107 INFO ]: Abstraction has 8 states and 1231 transitions. [2018-06-26 20:50:24,107 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:24,107 INFO ]: Start isEmpty. Operand 8 states and 1231 transitions. [2018-06-26 20:50:24,108 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 20:50:24,108 INFO ]: Found error trace [2018-06-26 20:50:24,108 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 20:50:24,108 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:24,108 INFO ]: Analyzing trace with hash -2141071947, now seen corresponding path program 1 times [2018-06-26 20:50:24,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:24,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:24,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:24,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:24,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:24,135 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:24,182 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 20:50:24,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:24,182 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:24,182 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:24,182 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:24,182 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:24,183 INFO ]: Start difference. First operand 8 states and 1231 transitions. Second operand 3 states. [2018-06-26 20:50:27,898 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:27,898 INFO ]: Finished difference Result 9 states and 1241 transitions. [2018-06-26 20:50:27,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:27,899 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 20:50:27,899 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:27,901 INFO ]: With dead ends: 9 [2018-06-26 20:50:27,901 INFO ]: Without dead ends: 9 [2018-06-26 20:50:27,901 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:27,901 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 20:50:27,907 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 20:50:27,907 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 20:50:27,910 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1241 transitions. [2018-06-26 20:50:27,910 INFO ]: Start accepts. Automaton has 9 states and 1241 transitions. Word has length 6 [2018-06-26 20:50:27,910 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:27,910 INFO ]: Abstraction has 9 states and 1241 transitions. [2018-06-26 20:50:27,910 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:27,910 INFO ]: Start isEmpty. Operand 9 states and 1241 transitions. [2018-06-26 20:50:27,912 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 20:50:27,912 INFO ]: Found error trace [2018-06-26 20:50:27,912 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:27,912 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:27,912 INFO ]: Analyzing trace with hash -1032192680, now seen corresponding path program 1 times [2018-06-26 20:50:27,912 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:27,912 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:27,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:27,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:27,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:27,991 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:28,089 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 20:50:28,089 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:28,089 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:28,089 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:28,089 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:28,089 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:28,089 INFO ]: Start difference. First operand 9 states and 1241 transitions. Second operand 3 states. [2018-06-26 20:50:31,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:31,041 INFO ]: Finished difference Result 11 states and 1505 transitions. [2018-06-26 20:50:31,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:31,042 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-26 20:50:31,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:31,045 INFO ]: With dead ends: 11 [2018-06-26 20:50:31,045 INFO ]: Without dead ends: 11 [2018-06-26 20:50:31,045 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:31,045 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 20:50:31,054 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-26 20:50:31,054 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 20:50:31,057 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1495 transitions. [2018-06-26 20:50:31,057 INFO ]: Start accepts. Automaton has 10 states and 1495 transitions. Word has length 8 [2018-06-26 20:50:31,058 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:31,058 INFO ]: Abstraction has 10 states and 1495 transitions. [2018-06-26 20:50:31,058 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:31,058 INFO ]: Start isEmpty. Operand 10 states and 1495 transitions. [2018-06-26 20:50:31,059 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:50:31,059 INFO ]: Found error trace [2018-06-26 20:50:31,059 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:31,059 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:31,059 INFO ]: Analyzing trace with hash -1976163354, now seen corresponding path program 1 times [2018-06-26 20:50:31,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:31,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:31,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:31,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:31,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:31,112 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:31,223 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:50:31,223 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:31,223 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:31,223 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:31,223 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:31,223 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:31,223 INFO ]: Start difference. First operand 10 states and 1495 transitions. Second operand 3 states. [2018-06-26 20:50:34,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:34,321 INFO ]: Finished difference Result 13 states and 2330 transitions. [2018-06-26 20:50:34,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:34,321 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:50:34,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:34,324 INFO ]: With dead ends: 13 [2018-06-26 20:50:34,324 INFO ]: Without dead ends: 13 [2018-06-26 20:50:34,327 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:34,327 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 20:50:34,338 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-06-26 20:50:34,338 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 20:50:34,342 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2320 transitions. [2018-06-26 20:50:34,342 INFO ]: Start accepts. Automaton has 12 states and 2320 transitions. Word has length 9 [2018-06-26 20:50:34,342 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:34,342 INFO ]: Abstraction has 12 states and 2320 transitions. [2018-06-26 20:50:34,342 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:34,342 INFO ]: Start isEmpty. Operand 12 states and 2320 transitions. [2018-06-26 20:50:34,343 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:50:34,343 INFO ]: Found error trace [2018-06-26 20:50:34,343 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:34,344 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:34,344 INFO ]: Analyzing trace with hash -1975239833, now seen corresponding path program 1 times [2018-06-26 20:50:34,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:34,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:34,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:34,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:34,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:34,383 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:34,493 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:50:34,494 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:34,494 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:34,494 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:34,494 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:34,494 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:34,494 INFO ]: Start difference. First operand 12 states and 2320 transitions. Second operand 3 states. [2018-06-26 20:50:37,246 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:37,246 INFO ]: Finished difference Result 15 states and 2882 transitions. [2018-06-26 20:50:37,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:37,246 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:50:37,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:37,250 INFO ]: With dead ends: 15 [2018-06-26 20:50:37,250 INFO ]: Without dead ends: 15 [2018-06-26 20:50:37,250 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:37,250 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 20:50:37,261 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-26 20:50:37,262 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 20:50:37,264 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2872 transitions. [2018-06-26 20:50:37,265 INFO ]: Start accepts. Automaton has 14 states and 2872 transitions. Word has length 9 [2018-06-26 20:50:37,265 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:37,265 INFO ]: Abstraction has 14 states and 2872 transitions. [2018-06-26 20:50:37,265 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:37,265 INFO ]: Start isEmpty. Operand 14 states and 2872 transitions. [2018-06-26 20:50:37,266 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:50:37,267 INFO ]: Found error trace [2018-06-26 20:50:37,267 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:37,267 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:37,267 INFO ]: Analyzing trace with hash 1385124211, now seen corresponding path program 1 times [2018-06-26 20:50:37,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:37,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:37,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:37,267 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:37,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:37,293 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:37,371 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:50:37,371 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:37,371 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:37,371 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:37,371 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:37,371 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:37,371 INFO ]: Start difference. First operand 14 states and 2872 transitions. Second operand 3 states. [2018-06-26 20:50:40,024 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:40,024 INFO ]: Finished difference Result 17 states and 3280 transitions. [2018-06-26 20:50:40,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:40,047 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:50:40,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:40,051 INFO ]: With dead ends: 17 [2018-06-26 20:50:40,051 INFO ]: Without dead ends: 16 [2018-06-26 20:50:40,051 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:40,051 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 20:50:40,068 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 20:50:40,068 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 20:50:40,071 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3278 transitions. [2018-06-26 20:50:40,071 INFO ]: Start accepts. Automaton has 16 states and 3278 transitions. Word has length 9 [2018-06-26 20:50:40,071 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:40,071 INFO ]: Abstraction has 16 states and 3278 transitions. [2018-06-26 20:50:40,071 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:40,071 INFO ]: Start isEmpty. Operand 16 states and 3278 transitions. [2018-06-26 20:50:40,073 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:50:40,073 INFO ]: Found error trace [2018-06-26 20:50:40,073 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:40,073 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:40,074 INFO ]: Analyzing trace with hash -1964157581, now seen corresponding path program 1 times [2018-06-26 20:50:40,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:40,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:40,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:40,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:40,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:40,101 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:40,188 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:50:40,188 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:40,189 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:40,189 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:40,189 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:40,189 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:40,189 INFO ]: Start difference. First operand 16 states and 3278 transitions. Second operand 3 states. [2018-06-26 20:50:42,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:42,937 INFO ]: Finished difference Result 19 states and 3876 transitions. [2018-06-26 20:50:42,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:42,937 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:50:42,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:42,940 INFO ]: With dead ends: 19 [2018-06-26 20:50:42,940 INFO ]: Without dead ends: 19 [2018-06-26 20:50:42,941 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:42,941 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 20:50:42,954 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-26 20:50:42,954 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 20:50:42,957 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3866 transitions. [2018-06-26 20:50:42,957 INFO ]: Start accepts. Automaton has 18 states and 3866 transitions. Word has length 9 [2018-06-26 20:50:42,957 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:42,957 INFO ]: Abstraction has 18 states and 3866 transitions. [2018-06-26 20:50:42,957 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:42,957 INFO ]: Start isEmpty. Operand 18 states and 3866 transitions. [2018-06-26 20:50:42,959 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 20:50:42,959 INFO ]: Found error trace [2018-06-26 20:50:42,959 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:42,960 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:42,960 INFO ]: Analyzing trace with hash 1918919349, now seen corresponding path program 1 times [2018-06-26 20:50:42,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:42,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:42,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:42,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:42,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:42,985 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:43,073 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 20:50:43,073 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:50:43,073 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:50:43,073 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:50:43,073 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:50:43,073 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:43,073 INFO ]: Start difference. First operand 18 states and 3866 transitions. Second operand 3 states. [2018-06-26 20:50:45,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:45,861 INFO ]: Finished difference Result 21 states and 4536 transitions. [2018-06-26 20:50:45,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:50:45,862 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-26 20:50:45,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:45,865 INFO ]: With dead ends: 21 [2018-06-26 20:50:45,865 INFO ]: Without dead ends: 21 [2018-06-26 20:50:45,866 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:50:45,866 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 20:50:45,879 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-06-26 20:50:45,879 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 20:50:45,883 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4526 transitions. [2018-06-26 20:50:45,884 INFO ]: Start accepts. Automaton has 20 states and 4526 transitions. Word has length 9 [2018-06-26 20:50:45,884 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:45,884 INFO ]: Abstraction has 20 states and 4526 transitions. [2018-06-26 20:50:45,884 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:50:45,884 INFO ]: Start isEmpty. Operand 20 states and 4526 transitions. [2018-06-26 20:50:45,888 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:45,888 INFO ]: Found error trace [2018-06-26 20:50:45,888 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:45,888 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:45,888 INFO ]: Analyzing trace with hash -495226803, now seen corresponding path program 1 times [2018-06-26 20:50:45,888 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:45,888 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:45,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:45,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:45,889 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:45,916 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:46,157 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-06-26 20:50:46,230 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:50:46,231 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 20:50:46,231 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) [2018-06-26 20:50:46,246 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 20:50:46,440 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:50:46,455 INFO ]: Computing forward predicates... [2018-06-26 20:50:46,678 INFO ]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-26 20:50:46,714 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 20:50:46,714 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-26 20:50:46,714 INFO ]: Interpolant automaton has 6 states [2018-06-26 20:50:46,715 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 20:50:46,715 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-26 20:50:46,715 INFO ]: Start difference. First operand 20 states and 4526 transitions. Second operand 6 states. [2018-06-26 20:50:59,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:50:59,837 INFO ]: Finished difference Result 58 states and 15504 transitions. [2018-06-26 20:50:59,838 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 20:50:59,838 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-26 20:50:59,838 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:50:59,862 INFO ]: With dead ends: 58 [2018-06-26 20:50:59,862 INFO ]: Without dead ends: 58 [2018-06-26 20:50:59,863 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-26 20:50:59,863 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 20:50:59,909 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-06-26 20:50:59,910 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-26 20:50:59,923 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 13216 transitions. [2018-06-26 20:50:59,923 INFO ]: Start accepts. Automaton has 48 states and 13216 transitions. Word has length 10 [2018-06-26 20:50:59,923 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:50:59,923 INFO ]: Abstraction has 48 states and 13216 transitions. [2018-06-26 20:50:59,923 INFO ]: Interpolant automaton has 6 states. [2018-06-26 20:50:59,923 INFO ]: Start isEmpty. Operand 48 states and 13216 transitions. [2018-06-26 20:50:59,931 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:50:59,931 INFO ]: Found error trace [2018-06-26 20:50:59,931 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:50:59,931 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:50:59,933 INFO ]: Analyzing trace with hash -271734721, now seen corresponding path program 1 times [2018-06-26 20:50:59,933 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:50:59,933 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:50:59,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:59,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:50:59,934 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:50:59,970 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:00,060 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:51:00,060 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:00,060 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:00,060 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:00,060 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:00,060 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:00,060 INFO ]: Start difference. First operand 48 states and 13216 transitions. Second operand 3 states. [2018-06-26 20:51:02,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:02,990 INFO ]: Finished difference Result 89 states and 23446 transitions. [2018-06-26 20:51:03,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:03,026 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:51:03,026 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:03,040 INFO ]: With dead ends: 89 [2018-06-26 20:51:03,040 INFO ]: Without dead ends: 89 [2018-06-26 20:51:03,040 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:03,040 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-26 20:51:03,076 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-06-26 20:51:03,076 INFO ]: Start removeUnreachable. Operand 89 states. [2018-06-26 20:51:03,087 INFO ]: Finished removeUnreachable. Reduced from 89 states to 89 states and 23446 transitions. [2018-06-26 20:51:03,087 INFO ]: Start accepts. Automaton has 89 states and 23446 transitions. Word has length 10 [2018-06-26 20:51:03,087 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:03,087 INFO ]: Abstraction has 89 states and 23446 transitions. [2018-06-26 20:51:03,087 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:03,087 INFO ]: Start isEmpty. Operand 89 states and 23446 transitions. [2018-06-26 20:51:03,095 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:03,095 INFO ]: Found error trace [2018-06-26 20:51:03,095 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:03,095 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:03,096 INFO ]: Analyzing trace with hash -739959868, now seen corresponding path program 1 times [2018-06-26 20:51:03,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:03,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:03,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:03,096 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:03,096 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:03,134 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:03,221 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:51:03,221 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:03,222 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:03,222 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:03,222 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:03,222 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:03,222 INFO ]: Start difference. First operand 89 states and 23446 transitions. Second operand 3 states. [2018-06-26 20:51:06,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:06,758 INFO ]: Finished difference Result 130 states and 29768 transitions. [2018-06-26 20:51:06,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:06,758 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:51:06,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:06,782 INFO ]: With dead ends: 130 [2018-06-26 20:51:06,782 INFO ]: Without dead ends: 130 [2018-06-26 20:51:06,783 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:06,783 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-26 20:51:06,843 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-06-26 20:51:06,843 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-26 20:51:06,864 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 29768 transitions. [2018-06-26 20:51:06,864 INFO ]: Start accepts. Automaton has 130 states and 29768 transitions. Word has length 10 [2018-06-26 20:51:06,864 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:06,864 INFO ]: Abstraction has 130 states and 29768 transitions. [2018-06-26 20:51:06,864 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:06,864 INFO ]: Start isEmpty. Operand 130 states and 29768 transitions. [2018-06-26 20:51:06,872 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:06,872 INFO ]: Found error trace [2018-06-26 20:51:06,872 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:06,872 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:06,872 INFO ]: Analyzing trace with hash -213403943, now seen corresponding path program 1 times [2018-06-26 20:51:06,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:06,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:06,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:06,872 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:06,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:06,897 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:07,043 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 20:51:07,043 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:07,043 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:07,043 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:07,043 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:07,043 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:07,043 INFO ]: Start difference. First operand 130 states and 29768 transitions. Second operand 3 states. [2018-06-26 20:51:09,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:09,837 INFO ]: Finished difference Result 151 states and 31672 transitions. [2018-06-26 20:51:09,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:09,837 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:51:09,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:09,857 INFO ]: With dead ends: 151 [2018-06-26 20:51:09,857 INFO ]: Without dead ends: 151 [2018-06-26 20:51:09,858 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:09,858 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-26 20:51:09,914 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 130. [2018-06-26 20:51:09,914 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-26 20:51:09,936 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 28534 transitions. [2018-06-26 20:51:09,936 INFO ]: Start accepts. Automaton has 130 states and 28534 transitions. Word has length 10 [2018-06-26 20:51:09,936 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:09,936 INFO ]: Abstraction has 130 states and 28534 transitions. [2018-06-26 20:51:09,936 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:09,936 INFO ]: Start isEmpty. Operand 130 states and 28534 transitions. [2018-06-26 20:51:09,948 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:09,948 INFO ]: Found error trace [2018-06-26 20:51:09,948 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:09,948 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:09,948 INFO ]: Analyzing trace with hash -1620606923, now seen corresponding path program 1 times [2018-06-26 20:51:09,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:09,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:09,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:09,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:09,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:09,970 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:10,050 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:51:10,050 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:10,051 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:10,051 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:10,051 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:10,051 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:10,051 INFO ]: Start difference. First operand 130 states and 28534 transitions. Second operand 3 states. [2018-06-26 20:51:12,826 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:12,826 INFO ]: Finished difference Result 212 states and 28734 transitions. [2018-06-26 20:51:12,827 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:12,827 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:51:12,827 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:12,839 INFO ]: With dead ends: 212 [2018-06-26 20:51:12,839 INFO ]: Without dead ends: 212 [2018-06-26 20:51:12,840 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:12,840 INFO ]: Start minimizeSevpa. Operand 212 states. [2018-06-26 20:51:12,887 INFO ]: Finished minimizeSevpa. Reduced states from 212 to 133. [2018-06-26 20:51:12,887 INFO ]: Start removeUnreachable. Operand 133 states. [2018-06-26 20:51:12,905 INFO ]: Finished removeUnreachable. Reduced from 133 states to 133 states and 28547 transitions. [2018-06-26 20:51:12,906 INFO ]: Start accepts. Automaton has 133 states and 28547 transitions. Word has length 10 [2018-06-26 20:51:12,906 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:12,906 INFO ]: Abstraction has 133 states and 28547 transitions. [2018-06-26 20:51:12,906 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:12,906 INFO ]: Start isEmpty. Operand 133 states and 28547 transitions. [2018-06-26 20:51:12,913 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 20:51:12,913 INFO ]: Found error trace [2018-06-26 20:51:12,913 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:12,913 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:12,914 INFO ]: Analyzing trace with hash 1359203365, now seen corresponding path program 1 times [2018-06-26 20:51:12,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:12,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:12,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:12,914 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:12,914 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:12,934 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:13,091 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-06-26 20:51:13,092 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-26 20:51:13,092 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:13,092 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:13,092 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:13,092 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:13,092 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:13,092 INFO ]: Start difference. First operand 133 states and 28547 transitions. Second operand 3 states. [2018-06-26 20:51:15,962 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 20:51:15,962 INFO ]: Finished difference Result 162 states and 29841 transitions. [2018-06-26 20:51:15,963 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:15,963 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-26 20:51:15,963 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 20:51:15,972 INFO ]: With dead ends: 162 [2018-06-26 20:51:15,972 INFO ]: Without dead ends: 162 [2018-06-26 20:51:15,972 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:15,972 INFO ]: Start minimizeSevpa. Operand 162 states. [2018-06-26 20:51:16,008 INFO ]: Finished minimizeSevpa. Reduced states from 162 to 151. [2018-06-26 20:51:16,008 INFO ]: Start removeUnreachable. Operand 151 states. [2018-06-26 20:51:16,023 INFO ]: Finished removeUnreachable. Reduced from 151 states to 151 states and 29739 transitions. [2018-06-26 20:51:16,023 INFO ]: Start accepts. Automaton has 151 states and 29739 transitions. Word has length 10 [2018-06-26 20:51:16,023 INFO ]: Finished accepts. word is rejected. [2018-06-26 20:51:16,023 INFO ]: Abstraction has 151 states and 29739 transitions. [2018-06-26 20:51:16,023 INFO ]: Interpolant automaton has 3 states. [2018-06-26 20:51:16,023 INFO ]: Start isEmpty. Operand 151 states and 29739 transitions. [2018-06-26 20:51:16,030 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 20:51:16,030 INFO ]: Found error trace [2018-06-26 20:51:16,030 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 20:51:16,030 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 20:51:16,031 INFO ]: Analyzing trace with hash 1869129415, now seen corresponding path program 1 times [2018-06-26 20:51:16,031 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 20:51:16,031 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 20:51:16,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:16,031 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 20:51:16,031 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 20:51:16,056 INFO ]: Conjunction of SSA is unsat [2018-06-26 20:51:16,142 INFO ]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 20:51:16,142 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 20:51:16,143 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 20:51:16,143 INFO ]: Interpolant automaton has 3 states [2018-06-26 20:51:16,143 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 20:51:16,143 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 20:51:16,143 INFO ]: Start difference. First operand 151 states and 29739 transitions. Second operand 3 states. Received shutdown request... [2018-06-26 20:51:16,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 20:51:16,789 WARN ]: Verification canceled [2018-06-26 20:51:16,791 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 20:51:16,792 WARN ]: Timeout [2018-06-26 20:51:16,792 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 08:51:16 BasicIcfg [2018-06-26 20:51:16,792 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 20:51:16,793 INFO ]: Toolchain (without parser) took 66287.76 ms. Allocated memory was 308.8 MB in the beginning and 1.2 GB in the end (delta: 912.8 MB). Free memory was 239.2 MB in the beginning and 457.0 MB in the end (delta: -217.7 MB). Peak memory consumption was 695.1 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:16,794 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 20:51:16,794 INFO ]: ChcToBoogie took 75.97 ms. Allocated memory is still 308.8 MB. Free memory was 239.2 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:16,794 INFO ]: Boogie Preprocessor took 113.66 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 235.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:16,795 INFO ]: RCFGBuilder took 473.42 ms. Allocated memory is still 308.8 MB. Free memory was 235.3 MB in the beginning and 201.3 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:16,795 INFO ]: BlockEncodingV2 took 2139.96 ms. Allocated memory was 308.8 MB in the beginning and 408.9 MB in the end (delta: 100.1 MB). Free memory was 201.3 MB in the beginning and 312.9 MB in the end (delta: -111.5 MB). Peak memory consumption was 142.6 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:16,803 INFO ]: TraceAbstraction took 63475.29 ms. Allocated memory was 408.9 MB in the beginning and 1.2 GB in the end (delta: 812.6 MB). Free memory was 312.9 MB in the beginning and 457.0 MB in the end (delta: -144.1 MB). Peak memory consumption was 668.6 MB. Max. memory is 3.6 GB. [2018-06-26 20:51:16,806 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, 1116 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 75.97 ms. Allocated memory is still 308.8 MB. Free memory was 239.2 MB in the beginning and 237.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 113.66 ms. Allocated memory is still 308.8 MB. Free memory was 237.3 MB in the beginning and 235.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 473.42 ms. Allocated memory is still 308.8 MB. Free memory was 235.3 MB in the beginning and 201.3 MB in the end (delta: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 2139.96 ms. Allocated memory was 308.8 MB in the beginning and 408.9 MB in the end (delta: 100.1 MB). Free memory was 201.3 MB in the beginning and 312.9 MB in the end (delta: -111.5 MB). Peak memory consumption was 142.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 63475.29 ms. Allocated memory was 408.9 MB in the beginning and 1.2 GB in the end (delta: 812.6 MB). Free memory was 312.9 MB in the beginning and 457.0 MB in the end (delta: -144.1 MB). Peak memory consumption was 668.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (151states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (5 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 63.4s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 59.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 77 SDtfs, 0 SDslu, 62 SDs, 0 SdLazy, 16678 SolverSat, 19863 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 126 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 1422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1195 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 182/184 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_9.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_20-51-16-822.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_9.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_20-51-16-822.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_9.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_20-51-16-822.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_9.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_20-51-16-822.csv Completed graceful shutdown