java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_10.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 00:01:57,632 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 00:01:57,634 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 00:01:57,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 00:01:57,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 00:01:57,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 00:01:57,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 00:01:57,654 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 00:01:57,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 00:01:57,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 00:01:57,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 00:01:57,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 00:01:57,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 00:01:57,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 00:01:57,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 00:01:57,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 00:01:57,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 00:01:57,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 00:01:57,677 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 00:01:57,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 00:01:57,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 00:01:57,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 00:01:57,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 00:01:57,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 00:01:57,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 00:01:57,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 00:01:57,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 00:01:57,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 00:01:57,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 00:01:57,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 00:01:57,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 00:01:57,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 00:01:57,693 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 00:01:57,693 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 00:01:57,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 00:01:57,694 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 00:01:57,717 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 00:01:57,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 00:01:57,717 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 00:01:57,718 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 00:01:57,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 00:01:57,722 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 00:01:57,723 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 00:01:57,723 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 00:01:57,723 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 00:01:57,723 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 00:01:57,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 00:01:57,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 00:01:57,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 00:01:57,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 00:01:57,724 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 00:01:57,724 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 00:01:57,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 00:01:57,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 00:01:57,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 00:01:57,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 00:01:57,725 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 00:01:57,727 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 00:01:57,727 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 00:01:57,776 INFO ]: Repository-Root is: /tmp [2018-06-25 00:01:57,789 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 00:01:57,792 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 00:01:57,793 INFO ]: Initializing SmtParser... [2018-06-25 00:01:57,794 INFO ]: SmtParser initialized [2018-06-25 00:01:57,794 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_10.cil.smt2 [2018-06-25 00:01:57,795 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 00:01:57,886 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_10.cil.smt2 unknown [2018-06-25 00:01:58,377 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_srvr_10.cil.smt2 [2018-06-25 00:01:58,382 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 00:01:58,392 INFO ]: Walking toolchain with 5 elements. [2018-06-25 00:01:58,397 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 00:01:58,397 INFO ]: Initializing ChcToBoogie... [2018-06-25 00:01:58,397 INFO ]: ChcToBoogie initialized [2018-06-25 00:01:58,401 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:01:58" (1/1) ... [2018-06-25 00:01:58,506 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58 Unit [2018-06-25 00:01:58,506 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 00:01:58,506 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 00:01:58,506 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 00:01:58,506 INFO ]: Boogie Preprocessor initialized [2018-06-25 00:01:58,539 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58" (1/1) ... [2018-06-25 00:01:58,540 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58" (1/1) ... [2018-06-25 00:01:58,560 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58" (1/1) ... [2018-06-25 00:01:58,560 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58" (1/1) ... [2018-06-25 00:01:58,582 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58" (1/1) ... [2018-06-25 00:01:58,591 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58" (1/1) ... [2018-06-25 00:01:58,595 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58" (1/1) ... [2018-06-25 00:01:58,610 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 00:01:58,610 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 00:01:58,610 INFO ]: Initializing RCFGBuilder... [2018-06-25 00:01:58,610 INFO ]: RCFGBuilder initialized [2018-06-25 00:01:58,611 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58" (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 00:01:58,636 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 00:01:58,636 INFO ]: Found specification of procedure gotoProc [2018-06-25 00:01:58,637 INFO ]: Found implementation of procedure gotoProc [2018-06-25 00:01:58,637 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 00:01:58,637 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 00:01:58,637 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 00:01:59,081 INFO ]: Using library mode [2018-06-25 00:01:59,081 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:01:59 BoogieIcfgContainer [2018-06-25 00:01:59,081 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 00:01:59,082 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 00:01:59,082 INFO ]: Initializing BlockEncodingV2... [2018-06-25 00:01:59,083 INFO ]: BlockEncodingV2 initialized [2018-06-25 00:01:59,083 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:01:59" (1/1) ... [2018-06-25 00:01:59,098 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 00:01:59,099 INFO ]: Using Remove infeasible edges [2018-06-25 00:01:59,099 INFO ]: Using Maximize final states [2018-06-25 00:01:59,100 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 00:01:59,100 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 00:01:59,102 INFO ]: Using Remove sink states [2018-06-25 00:01:59,103 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 00:01:59,103 INFO ]: Using Use SBE [2018-06-25 00:01:59,944 WARN ]: Simplifying disjunction of 7664 conjuctions. This might take some time... [2018-06-25 00:02:27,749 INFO ]: Simplified to disjunction of 7664 conjuctions. [2018-06-25 00:02:28,727 INFO ]: SBE split 1 edges [2018-06-25 00:02:28,824 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 00:02:28,826 INFO ]: 0 new accepting states [2018-06-25 00:02:28,870 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-25 00:02:28,872 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:02:28,969 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 00:02:28,970 INFO ]: 0 new accepting states [2018-06-25 00:02:28,971 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 00:02:28,971 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 00:02:29,100 INFO ]: Encoded RCFG 6 locations, 963 edges [2018-06-25 00:02:29,101 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:02:29 BasicIcfg [2018-06-25 00:02:29,101 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 00:02:29,102 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 00:02:29,102 INFO ]: Initializing TraceAbstraction... [2018-06-25 00:02:29,106 INFO ]: TraceAbstraction initialized [2018-06-25 00:02:29,106 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 12:01:58" (1/4) ... [2018-06-25 00:02:29,107 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41907641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 12:02:29, skipping insertion in model container [2018-06-25 00:02:29,107 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 12:01:58" (2/4) ... [2018-06-25 00:02:29,108 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41907641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 12:02:29, skipping insertion in model container [2018-06-25 00:02:29,108 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 12:01:59" (3/4) ... [2018-06-25 00:02:29,108 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41907641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:02:29, skipping insertion in model container [2018-06-25 00:02:29,108 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 12:02:29" (4/4) ... [2018-06-25 00:02:29,110 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 00:02:29,122 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 00:02:29,131 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 00:02:29,188 INFO ]: Using default assertion order modulation [2018-06-25 00:02:29,189 INFO ]: Interprodecural is true [2018-06-25 00:02:29,189 INFO ]: Hoare is false [2018-06-25 00:02:29,189 INFO ]: Compute interpolants for FPandBP [2018-06-25 00:02:29,189 INFO ]: Backedges is TWOTRACK [2018-06-25 00:02:29,189 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 00:02:29,189 INFO ]: Difference is false [2018-06-25 00:02:29,189 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 00:02:29,189 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 00:02:29,209 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 00:02:29,232 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 00:02:29,232 INFO ]: Found error trace [2018-06-25 00:02:29,233 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 00:02:29,233 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:29,239 INFO ]: Analyzing trace with hash 64862978, now seen corresponding path program 1 times [2018-06-25 00:02:29,241 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:29,241 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:29,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:29,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:29,275 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:29,345 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:29,425 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:02:29,427 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:29,429 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:29,431 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:29,445 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:29,446 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:29,448 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 00:02:35,655 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:35,655 INFO ]: Finished difference Result 7 states and 1099 transitions. [2018-06-25 00:02:35,655 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:35,656 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 00:02:35,656 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:35,671 INFO ]: With dead ends: 7 [2018-06-25 00:02:35,671 INFO ]: Without dead ends: 7 [2018-06-25 00:02:35,673 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 00:02:35,700 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 00:02:35,742 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 00:02:35,743 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 00:02:35,746 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1099 transitions. [2018-06-25 00:02:35,747 INFO ]: Start accepts. Automaton has 7 states and 1099 transitions. Word has length 5 [2018-06-25 00:02:35,748 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:35,748 INFO ]: Abstraction has 7 states and 1099 transitions. [2018-06-25 00:02:35,748 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:35,748 INFO ]: Start isEmpty. Operand 7 states and 1099 transitions. [2018-06-25 00:02:35,749 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:02:35,749 INFO ]: Found error trace [2018-06-25 00:02:35,749 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:02:35,749 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:35,749 INFO ]: Analyzing trace with hash 1990702173, now seen corresponding path program 1 times [2018-06-25 00:02:35,749 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:35,749 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:35,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:35,750 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:35,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:35,798 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:35,879 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:02:35,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:35,880 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:35,881 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:35,881 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:35,881 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:35,881 INFO ]: Start difference. First operand 7 states and 1099 transitions. Second operand 3 states. [2018-06-25 00:02:38,873 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:38,873 INFO ]: Finished difference Result 9 states and 1104 transitions. [2018-06-25 00:02:38,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:38,912 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:02:38,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:38,914 INFO ]: With dead ends: 9 [2018-06-25 00:02:38,914 INFO ]: Without dead ends: 9 [2018-06-25 00:02:38,915 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 00:02:38,915 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:02:38,928 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:02:38,928 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:02:38,930 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1104 transitions. [2018-06-25 00:02:38,931 INFO ]: Start accepts. Automaton has 9 states and 1104 transitions. Word has length 6 [2018-06-25 00:02:38,931 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:38,931 INFO ]: Abstraction has 9 states and 1104 transitions. [2018-06-25 00:02:38,931 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:38,931 INFO ]: Start isEmpty. Operand 9 states and 1104 transitions. [2018-06-25 00:02:38,931 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 00:02:38,931 INFO ]: Found error trace [2018-06-25 00:02:38,931 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 00:02:38,931 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:38,931 INFO ]: Analyzing trace with hash 2003988959, now seen corresponding path program 1 times [2018-06-25 00:02:38,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:38,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:38,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:38,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:38,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:38,959 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:38,996 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:02:38,996 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:38,996 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:38,996 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:38,996 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:38,996 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:38,996 INFO ]: Start difference. First operand 9 states and 1104 transitions. Second operand 3 states. [2018-06-25 00:02:41,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:41,026 INFO ]: Finished difference Result 9 states and 1099 transitions. [2018-06-25 00:02:41,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:41,027 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 00:02:41,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:41,028 INFO ]: With dead ends: 9 [2018-06-25 00:02:41,028 INFO ]: Without dead ends: 9 [2018-06-25 00:02:41,029 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 00:02:41,029 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:02:41,040 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:02:41,040 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:02:41,042 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1099 transitions. [2018-06-25 00:02:41,042 INFO ]: Start accepts. Automaton has 9 states and 1099 transitions. Word has length 6 [2018-06-25 00:02:41,042 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:41,042 INFO ]: Abstraction has 9 states and 1099 transitions. [2018-06-25 00:02:41,042 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:41,042 INFO ]: Start isEmpty. Operand 9 states and 1099 transitions. [2018-06-25 00:02:41,043 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 00:02:41,043 INFO ]: Found error trace [2018-06-25 00:02:41,043 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:41,043 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:41,043 INFO ]: Analyzing trace with hash 1974065440, now seen corresponding path program 1 times [2018-06-25 00:02:41,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:41,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:41,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:41,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:41,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:41,097 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:41,139 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 00:02:41,139 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:41,139 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:41,140 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:41,140 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:41,140 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:41,140 INFO ]: Start difference. First operand 9 states and 1099 transitions. Second operand 3 states. [2018-06-25 00:02:43,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:43,991 INFO ]: Finished difference Result 9 states and 553 transitions. [2018-06-25 00:02:44,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:44,104 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 00:02:44,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:44,105 INFO ]: With dead ends: 9 [2018-06-25 00:02:44,105 INFO ]: Without dead ends: 9 [2018-06-25 00:02:44,105 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 00:02:44,105 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 00:02:44,108 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 00:02:44,108 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 00:02:44,109 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 553 transitions. [2018-06-25 00:02:44,109 INFO ]: Start accepts. Automaton has 9 states and 553 transitions. Word has length 7 [2018-06-25 00:02:44,109 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:44,110 INFO ]: Abstraction has 9 states and 553 transitions. [2018-06-25 00:02:44,110 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:44,110 INFO ]: Start isEmpty. Operand 9 states and 553 transitions. [2018-06-25 00:02:44,110 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 00:02:44,110 INFO ]: Found error trace [2018-06-25 00:02:44,110 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:44,110 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:44,110 INFO ]: Analyzing trace with hash 1643954438, now seen corresponding path program 1 times [2018-06-25 00:02:44,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:44,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:44,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:44,111 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:44,111 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:44,166 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:44,258 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 00:02:44,258 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:44,258 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:44,258 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:44,258 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:44,258 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:44,258 INFO ]: Start difference. First operand 9 states and 553 transitions. Second operand 3 states. [2018-06-25 00:02:46,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:46,822 INFO ]: Finished difference Result 10 states and 661 transitions. [2018-06-25 00:02:46,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:46,822 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:02:46,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:46,823 INFO ]: With dead ends: 10 [2018-06-25 00:02:46,823 INFO ]: Without dead ends: 10 [2018-06-25 00:02:46,823 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 00:02:46,823 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 00:02:46,827 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 00:02:46,827 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:02:46,828 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 661 transitions. [2018-06-25 00:02:46,828 INFO ]: Start accepts. Automaton has 10 states and 661 transitions. Word has length 8 [2018-06-25 00:02:46,828 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:46,828 INFO ]: Abstraction has 10 states and 661 transitions. [2018-06-25 00:02:46,828 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:46,828 INFO ]: Start isEmpty. Operand 10 states and 661 transitions. [2018-06-25 00:02:46,829 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:02:46,829 INFO ]: Found error trace [2018-06-25 00:02:46,829 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:46,829 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:46,829 INFO ]: Analyzing trace with hash -604458287, now seen corresponding path program 1 times [2018-06-25 00:02:46,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:46,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:46,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:46,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:46,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:46,879 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:46,989 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:02:46,989 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:46,989 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:46,989 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:46,989 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:46,989 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:46,989 INFO ]: Start difference. First operand 10 states and 661 transitions. Second operand 3 states. [2018-06-25 00:02:49,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:49,541 INFO ]: Finished difference Result 11 states and 953 transitions. [2018-06-25 00:02:49,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:49,541 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:02:49,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:49,542 INFO ]: With dead ends: 11 [2018-06-25 00:02:49,542 INFO ]: Without dead ends: 11 [2018-06-25 00:02:49,542 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 00:02:49,543 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:02:49,547 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:02:49,548 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:02:49,551 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 953 transitions. [2018-06-25 00:02:49,551 INFO ]: Start accepts. Automaton has 11 states and 953 transitions. Word has length 9 [2018-06-25 00:02:49,551 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:49,551 INFO ]: Abstraction has 11 states and 953 transitions. [2018-06-25 00:02:49,551 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:49,551 INFO ]: Start isEmpty. Operand 11 states and 953 transitions. [2018-06-25 00:02:49,552 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:02:49,552 INFO ]: Found error trace [2018-06-25 00:02:49,552 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:49,552 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:49,552 INFO ]: Analyzing trace with hash -339407760, now seen corresponding path program 1 times [2018-06-25 00:02:49,552 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:49,552 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:49,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:49,553 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:49,553 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:49,591 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:49,674 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 00:02:49,674 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:49,674 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:49,674 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:49,675 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:49,675 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:49,675 INFO ]: Start difference. First operand 11 states and 953 transitions. Second operand 3 states. [2018-06-25 00:02:51,946 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:51,946 INFO ]: Finished difference Result 12 states and 1143 transitions. [2018-06-25 00:02:51,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:51,947 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:02:51,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:51,949 INFO ]: With dead ends: 12 [2018-06-25 00:02:51,949 INFO ]: Without dead ends: 12 [2018-06-25 00:02:51,949 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 00:02:51,949 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 00:02:51,955 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 00:02:51,955 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 00:02:51,956 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1143 transitions. [2018-06-25 00:02:51,956 INFO ]: Start accepts. Automaton has 12 states and 1143 transitions. Word has length 9 [2018-06-25 00:02:51,956 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:51,956 INFO ]: Abstraction has 12 states and 1143 transitions. [2018-06-25 00:02:51,956 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:51,956 INFO ]: Start isEmpty. Operand 12 states and 1143 transitions. [2018-06-25 00:02:51,957 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:02:51,957 INFO ]: Found error trace [2018-06-25 00:02:51,957 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:51,957 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:51,957 INFO ]: Analyzing trace with hash -1349354650, now seen corresponding path program 1 times [2018-06-25 00:02:51,957 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:51,957 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:51,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:51,960 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:51,960 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:51,994 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:52,094 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:02:52,094 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:52,094 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:52,094 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:52,094 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:52,094 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:52,094 INFO ]: Start difference. First operand 12 states and 1143 transitions. Second operand 3 states. [2018-06-25 00:02:54,731 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:54,731 INFO ]: Finished difference Result 13 states and 1459 transitions. [2018-06-25 00:02:54,732 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:54,732 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:02:54,732 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:54,733 INFO ]: With dead ends: 13 [2018-06-25 00:02:54,733 INFO ]: Without dead ends: 13 [2018-06-25 00:02:54,733 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 00:02:54,733 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 00:02:54,739 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 00:02:54,740 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:02:54,742 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1459 transitions. [2018-06-25 00:02:54,742 INFO ]: Start accepts. Automaton has 13 states and 1459 transitions. Word has length 10 [2018-06-25 00:02:54,742 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:54,742 INFO ]: Abstraction has 13 states and 1459 transitions. [2018-06-25 00:02:54,742 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:54,742 INFO ]: Start isEmpty. Operand 13 states and 1459 transitions. [2018-06-25 00:02:54,743 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:02:54,743 INFO ]: Found error trace [2018-06-25 00:02:54,743 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:54,743 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:54,743 INFO ]: Analyzing trace with hash -1793568251, now seen corresponding path program 1 times [2018-06-25 00:02:54,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:54,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:54,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:54,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:54,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:54,782 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:54,879 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:02:54,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:54,879 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:54,879 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:54,879 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:54,879 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:54,879 INFO ]: Start difference. First operand 13 states and 1459 transitions. Second operand 3 states. [2018-06-25 00:02:58,417 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:02:58,417 INFO ]: Finished difference Result 18 states and 2448 transitions. [2018-06-25 00:02:58,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:02:58,418 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:02:58,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:02:58,420 INFO ]: With dead ends: 18 [2018-06-25 00:02:58,420 INFO ]: Without dead ends: 18 [2018-06-25 00:02:58,421 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 00:02:58,421 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 00:02:58,431 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 00:02:58,431 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 00:02:58,433 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2448 transitions. [2018-06-25 00:02:58,433 INFO ]: Start accepts. Automaton has 18 states and 2448 transitions. Word has length 10 [2018-06-25 00:02:58,433 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:02:58,433 INFO ]: Abstraction has 18 states and 2448 transitions. [2018-06-25 00:02:58,433 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:02:58,433 INFO ]: Start isEmpty. Operand 18 states and 2448 transitions. [2018-06-25 00:02:58,436 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:02:58,436 INFO ]: Found error trace [2018-06-25 00:02:58,436 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:02:58,436 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:02:58,436 INFO ]: Analyzing trace with hash -1745366413, now seen corresponding path program 1 times [2018-06-25 00:02:58,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:02:58,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:02:58,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:58,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:02:58,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:02:58,467 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:02:58,557 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 00:02:58,557 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:02:58,557 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:02:58,557 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:02:58,557 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:02:58,557 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:02:58,558 INFO ]: Start difference. First operand 18 states and 2448 transitions. Second operand 3 states. [2018-06-25 00:03:01,237 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:01,237 INFO ]: Finished difference Result 28 states and 4884 transitions. [2018-06-25 00:03:01,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:01,238 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:03:01,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:01,242 INFO ]: With dead ends: 28 [2018-06-25 00:03:01,242 INFO ]: Without dead ends: 28 [2018-06-25 00:03:01,242 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 00:03:01,242 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 00:03:01,258 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-25 00:03:01,258 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 00:03:01,260 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3358 transitions. [2018-06-25 00:03:01,261 INFO ]: Start accepts. Automaton has 20 states and 3358 transitions. Word has length 10 [2018-06-25 00:03:01,264 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:01,264 INFO ]: Abstraction has 20 states and 3358 transitions. [2018-06-25 00:03:01,264 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:01,264 INFO ]: Start isEmpty. Operand 20 states and 3358 transitions. [2018-06-25 00:03:01,266 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:03:01,266 INFO ]: Found error trace [2018-06-25 00:03:01,266 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:03:01,266 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:01,266 INFO ]: Analyzing trace with hash -1692725716, now seen corresponding path program 1 times [2018-06-25 00:03:01,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:01,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:01,267 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:01,269 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:01,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:01,295 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:01,378 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:03:01,378 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:01,379 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:01,379 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:01,379 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:01,379 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:01,379 INFO ]: Start difference. First operand 20 states and 3358 transitions. Second operand 3 states. [2018-06-25 00:03:03,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:03,971 INFO ]: Finished difference Result 30 states and 5674 transitions. [2018-06-25 00:03:03,971 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:03,971 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:03:03,971 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:03,977 INFO ]: With dead ends: 30 [2018-06-25 00:03:03,977 INFO ]: Without dead ends: 30 [2018-06-25 00:03:03,978 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 00:03:03,978 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 00:03:03,990 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-25 00:03:03,991 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 00:03:03,996 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5674 transitions. [2018-06-25 00:03:03,996 INFO ]: Start accepts. Automaton has 30 states and 5674 transitions. Word has length 10 [2018-06-25 00:03:03,996 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:03,996 INFO ]: Abstraction has 30 states and 5674 transitions. [2018-06-25 00:03:03,996 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:03,996 INFO ]: Start isEmpty. Operand 30 states and 5674 transitions. [2018-06-25 00:03:03,999 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:03:03,999 INFO ]: Found error trace [2018-06-25 00:03:03,999 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:03:03,999 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:03,999 INFO ]: Analyzing trace with hash -61700605, now seen corresponding path program 1 times [2018-06-25 00:03:03,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:03,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:04,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:04,000 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:04,000 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:04,032 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:04,110 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 00:03:04,110 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:04,110 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:04,110 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:04,110 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:04,110 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:04,111 INFO ]: Start difference. First operand 30 states and 5674 transitions. Second operand 3 states. [2018-06-25 00:03:06,764 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:06,764 INFO ]: Finished difference Result 40 states and 7400 transitions. [2018-06-25 00:03:06,764 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:06,765 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:03:06,765 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:06,770 INFO ]: With dead ends: 40 [2018-06-25 00:03:06,770 INFO ]: Without dead ends: 40 [2018-06-25 00:03:06,770 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 00:03:06,770 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 00:03:06,780 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-25 00:03:06,780 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 00:03:06,786 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 7400 transitions. [2018-06-25 00:03:06,786 INFO ]: Start accepts. Automaton has 40 states and 7400 transitions. Word has length 10 [2018-06-25 00:03:06,786 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:06,786 INFO ]: Abstraction has 40 states and 7400 transitions. [2018-06-25 00:03:06,786 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:06,786 INFO ]: Start isEmpty. Operand 40 states and 7400 transitions. [2018-06-25 00:03:06,789 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:03:06,789 INFO ]: Found error trace [2018-06-25 00:03:06,789 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:03:06,789 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:06,789 INFO ]: Analyzing trace with hash 544654089, now seen corresponding path program 1 times [2018-06-25 00:03:06,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:06,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:06,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:06,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:06,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:06,832 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:06,928 INFO ]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 00:03:06,928 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:06,929 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:06,929 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:06,929 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:06,929 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:06,929 INFO ]: Start difference. First operand 40 states and 7400 transitions. Second operand 3 states. [2018-06-25 00:03:09,810 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:03:09,810 INFO ]: Finished difference Result 50 states and 9166 transitions. [2018-06-25 00:03:09,811 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:09,811 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:03:09,811 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:03:09,817 INFO ]: With dead ends: 50 [2018-06-25 00:03:09,817 INFO ]: Without dead ends: 50 [2018-06-25 00:03:09,817 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 00:03:09,817 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-25 00:03:09,830 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-25 00:03:09,830 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-25 00:03:09,835 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 9166 transitions. [2018-06-25 00:03:09,835 INFO ]: Start accepts. Automaton has 50 states and 9166 transitions. Word has length 12 [2018-06-25 00:03:09,835 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:03:09,835 INFO ]: Abstraction has 50 states and 9166 transitions. [2018-06-25 00:03:09,835 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:03:09,835 INFO ]: Start isEmpty. Operand 50 states and 9166 transitions. [2018-06-25 00:03:09,837 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:03:09,837 INFO ]: Found error trace [2018-06-25 00:03:09,837 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:03:09,837 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:03:09,837 INFO ]: Analyzing trace with hash -961041397, now seen corresponding path program 1 times [2018-06-25 00:03:09,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:03:09,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:03:09,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:09,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:03:09,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:03:09,878 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:03:09,948 INFO ]: Checked inductivity of 36 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 00:03:09,948 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:03:09,948 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:03:09,948 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:03:09,948 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:03:09,948 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:03:09,948 INFO ]: Start difference. First operand 50 states and 9166 transitions. Second operand 3 states. Received shutdown request... [2018-06-25 00:03:10,747 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:03:10,747 WARN ]: Verification canceled [2018-06-25 00:03:10,750 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:03:10,751 WARN ]: Timeout [2018-06-25 00:03:10,751 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:03:10 BasicIcfg [2018-06-25 00:03:10,751 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:03:10,752 INFO ]: Toolchain (without parser) took 72369.88 ms. Allocated memory was 306.7 MB in the beginning and 1.2 GB in the end (delta: 874.0 MB). Free memory was 241.1 MB in the beginning and 489.2 MB in the end (delta: -248.1 MB). Peak memory consumption was 625.9 MB. Max. memory is 3.6 GB. [2018-06-25 00:03:10,753 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:03:10,753 INFO ]: ChcToBoogie took 108.88 ms. Allocated memory is still 306.7 MB. Free memory was 239.1 MB in the beginning and 237.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:03:10,754 INFO ]: Boogie Preprocessor took 103.33 ms. Allocated memory is still 306.7 MB. Free memory was 237.2 MB in the beginning and 235.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:03:10,754 INFO ]: RCFGBuilder took 471.29 ms. Allocated memory is still 306.7 MB. Free memory was 235.2 MB in the beginning and 203.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:03:10,755 INFO ]: BlockEncodingV2 took 30019.05 ms. Allocated memory was 306.7 MB in the beginning and 399.5 MB in the end (delta: 92.8 MB). Free memory was 203.2 MB in the beginning and 311.3 MB in the end (delta: -108.1 MB). Peak memory consumption was 131.2 MB. Max. memory is 3.6 GB. [2018-06-25 00:03:10,755 INFO ]: TraceAbstraction took 41649.45 ms. Allocated memory was 399.5 MB in the beginning and 1.2 GB in the end (delta: 781.2 MB). Free memory was 307.6 MB in the beginning and 489.2 MB in the end (delta: -181.7 MB). Peak memory consumption was 599.5 MB. Max. memory is 3.6 GB. [2018-06-25 00:03:10,761 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 963 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 108.88 ms. Allocated memory is still 306.7 MB. Free memory was 239.1 MB in the beginning and 237.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 103.33 ms. Allocated memory is still 306.7 MB. Free memory was 237.2 MB in the beginning and 235.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 471.29 ms. Allocated memory is still 306.7 MB. Free memory was 235.2 MB in the beginning and 203.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 30019.05 ms. Allocated memory was 306.7 MB in the beginning and 399.5 MB in the end (delta: 92.8 MB). Free memory was 203.2 MB in the beginning and 311.3 MB in the end (delta: -108.1 MB). Peak memory consumption was 131.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 41649.45 ms. Allocated memory was 399.5 MB in the beginning and 1.2 GB in the end (delta: 781.2 MB). Free memory was 307.6 MB in the beginning and 489.2 MB in the end (delta: -181.7 MB). Peak memory consumption was 599.5 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 (50states) and interpolant automaton (currently 3 states, 3 states before enhancement), while ReachableStatesComputation was computing reachable states (22 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 41.5s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 39.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 1 SDslu, 49 SDs, 0 SdLazy, 12670 SolverSat, 9617 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=13, 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, 13 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 1170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 170/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_10.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-03-10-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_10.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-03-10-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_10.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-03-10-774.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr_10.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-03-10-774.csv Completed graceful shutdown