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_clnt_2.cil.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 23:59:42,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 23:59:42,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 23:59:42,625 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 23:59:42,625 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 23:59:42,627 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 23:59:42,628 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 23:59:42,632 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 23:59:42,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 23:59:42,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 23:59:42,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 23:59:42,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 23:59:42,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 23:59:42,641 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 23:59:42,642 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 23:59:42,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 23:59:42,645 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 23:59:42,647 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 23:59:42,648 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 23:59:42,649 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 23:59:42,650 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 23:59:42,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 23:59:42,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 23:59:42,653 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 23:59:42,653 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 23:59:42,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 23:59:42,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 23:59:42,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 23:59:42,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 23:59:42,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 23:59:42,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 23:59:42,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 23:59:42,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 23:59:42,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 23:59:42,660 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 23:59:42,660 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 23:59:42,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 23:59:42,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 23:59:42,675 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 23:59:42,675 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 23:59:42,676 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 23:59:42,676 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 23:59:42,676 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 23:59:42,677 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 23:59:42,677 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 23:59:42,677 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 23:59:42,677 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 23:59:42,677 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 23:59:42,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:59:42,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 23:59:42,678 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 23:59:42,678 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 23:59:42,678 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 23:59:42,679 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 23:59:42,679 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 23:59:42,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 23:59:42,679 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 23:59:42,681 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 23:59:42,681 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 23:59:42,731 INFO ]: Repository-Root is: /tmp [2018-06-24 23:59:42,747 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 23:59:42,753 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 23:59:42,754 INFO ]: Initializing SmtParser... [2018-06-24 23:59:42,755 INFO ]: SmtParser initialized [2018-06-24 23:59:42,755 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_2.cil.smt2 [2018-06-24 23:59:42,756 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 23:59:42,845 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_2.cil.smt2 unknown [2018-06-24 23:59:43,416 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/cav12/s3_clnt_2.cil.smt2 [2018-06-24 23:59:43,420 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 23:59:43,433 INFO ]: Walking toolchain with 5 elements. [2018-06-24 23:59:43,433 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 23:59:43,433 INFO ]: Initializing ChcToBoogie... [2018-06-24 23:59:43,434 INFO ]: ChcToBoogie initialized [2018-06-24 23:59:43,437 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:59:43" (1/1) ... [2018-06-24 23:59:43,538 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43 Unit [2018-06-24 23:59:43,538 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 23:59:43,539 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 23:59:43,539 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 23:59:43,539 INFO ]: Boogie Preprocessor initialized [2018-06-24 23:59:43,554 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43" (1/1) ... [2018-06-24 23:59:43,554 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43" (1/1) ... [2018-06-24 23:59:43,565 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43" (1/1) ... [2018-06-24 23:59:43,565 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43" (1/1) ... [2018-06-24 23:59:43,582 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43" (1/1) ... [2018-06-24 23:59:43,584 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43" (1/1) ... [2018-06-24 23:59:43,587 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43" (1/1) ... [2018-06-24 23:59:43,593 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 23:59:43,594 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 23:59:43,594 INFO ]: Initializing RCFGBuilder... [2018-06-24 23:59:43,594 INFO ]: RCFGBuilder initialized [2018-06-24 23:59:43,595 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 23:59:43,608 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 23:59:43,608 INFO ]: Found specification of procedure gotoProc [2018-06-24 23:59:43,608 INFO ]: Found implementation of procedure gotoProc [2018-06-24 23:59:43,608 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 23:59:43,608 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 23:59:43,608 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 23:59:43,982 INFO ]: Using library mode [2018-06-24 23:59:43,983 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:59:43 BoogieIcfgContainer [2018-06-24 23:59:43,983 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 23:59:43,983 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 23:59:43,983 INFO ]: Initializing BlockEncodingV2... [2018-06-24 23:59:43,985 INFO ]: BlockEncodingV2 initialized [2018-06-24 23:59:43,986 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:59:43" (1/1) ... [2018-06-24 23:59:44,006 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-24 23:59:44,008 INFO ]: Using Remove infeasible edges [2018-06-24 23:59:44,008 INFO ]: Using Maximize final states [2018-06-24 23:59:44,008 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 23:59:44,009 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 23:59:44,012 INFO ]: Using Remove sink states [2018-06-24 23:59:44,015 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 23:59:44,015 INFO ]: Using Use SBE [2018-06-24 23:59:50,535 INFO ]: SBE split 1 edges [2018-06-24 23:59:50,574 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 23:59:50,576 INFO ]: 0 new accepting states [2018-06-24 23:59:50,625 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 23:59:50,627 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:59:50,669 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 23:59:50,670 INFO ]: 0 new accepting states [2018-06-24 23:59:50,670 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 23:59:50,670 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 23:59:50,724 INFO ]: Encoded RCFG 6 locations, 524 edges [2018-06-24 23:59:50,725 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:59:50 BasicIcfg [2018-06-24 23:59:50,725 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 23:59:50,726 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 23:59:50,726 INFO ]: Initializing TraceAbstraction... [2018-06-24 23:59:50,732 INFO ]: TraceAbstraction initialized [2018-06-24 23:59:50,732 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 11:59:43" (1/4) ... [2018-06-24 23:59:50,733 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c323503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 11:59:50, skipping insertion in model container [2018-06-24 23:59:50,733 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 11:59:43" (2/4) ... [2018-06-24 23:59:50,734 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c323503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 11:59:50, skipping insertion in model container [2018-06-24 23:59:50,734 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 11:59:43" (3/4) ... [2018-06-24 23:59:50,734 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c323503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 11:59:50, skipping insertion in model container [2018-06-24 23:59:50,734 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 11:59:50" (4/4) ... [2018-06-24 23:59:50,736 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 23:59:50,747 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 23:59:50,760 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 23:59:50,803 INFO ]: Using default assertion order modulation [2018-06-24 23:59:50,803 INFO ]: Interprodecural is true [2018-06-24 23:59:50,803 INFO ]: Hoare is false [2018-06-24 23:59:50,803 INFO ]: Compute interpolants for FPandBP [2018-06-24 23:59:50,803 INFO ]: Backedges is TWOTRACK [2018-06-24 23:59:50,803 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 23:59:50,803 INFO ]: Difference is false [2018-06-24 23:59:50,803 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 23:59:50,803 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 23:59:50,815 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 23:59:50,828 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 23:59:50,828 INFO ]: Found error trace [2018-06-24 23:59:50,829 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 23:59:50,829 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:59:50,834 INFO ]: Analyzing trace with hash 51362850, now seen corresponding path program 1 times [2018-06-24 23:59:50,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:59:50,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:59:50,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:59:50,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:59:50,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:59:50,937 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:59:51,048 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:59:51,052 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:59:51,052 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:59:51,054 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:59:51,069 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:59:51,069 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:59:51,072 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 23:59:54,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:59:54,992 INFO ]: Finished difference Result 7 states and 394 transitions. [2018-06-24 23:59:54,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:59:54,994 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 23:59:54,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:59:55,006 INFO ]: With dead ends: 7 [2018-06-24 23:59:55,006 INFO ]: Without dead ends: 7 [2018-06-24 23:59:55,008 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:59:55,022 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 23:59:55,046 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 23:59:55,047 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 23:59:55,048 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2018-06-24 23:59:55,049 INFO ]: Start accepts. Automaton has 7 states and 394 transitions. Word has length 5 [2018-06-24 23:59:55,049 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:59:55,049 INFO ]: Abstraction has 7 states and 394 transitions. [2018-06-24 23:59:55,049 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:59:55,049 INFO ]: Start isEmpty. Operand 7 states and 394 transitions. [2018-06-24 23:59:55,049 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 23:59:55,049 INFO ]: Found error trace [2018-06-24 23:59:55,049 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 23:59:55,050 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:59:55,050 INFO ]: Analyzing trace with hash 1586790990, now seen corresponding path program 1 times [2018-06-24 23:59:55,050 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:59:55,050 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:59:55,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:59:55,051 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:59:55,051 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:59:55,079 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:59:55,127 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 23:59:55,128 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:59:55,128 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:59:55,129 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:59:55,129 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:59:55,129 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:59:55,129 INFO ]: Start difference. First operand 7 states and 394 transitions. Second operand 3 states. [2018-06-24 23:59:57,543 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:59:57,543 INFO ]: Finished difference Result 8 states and 396 transitions. [2018-06-24 23:59:57,544 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:59:57,544 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 23:59:57,544 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:59:57,545 INFO ]: With dead ends: 8 [2018-06-24 23:59:57,545 INFO ]: Without dead ends: 8 [2018-06-24 23:59:57,546 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:59:57,546 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 23:59:57,564 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 23:59:57,564 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 23:59:57,565 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 396 transitions. [2018-06-24 23:59:57,565 INFO ]: Start accepts. Automaton has 8 states and 396 transitions. Word has length 6 [2018-06-24 23:59:57,565 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:59:57,565 INFO ]: Abstraction has 8 states and 396 transitions. [2018-06-24 23:59:57,565 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:59:57,565 INFO ]: Start isEmpty. Operand 8 states and 396 transitions. [2018-06-24 23:59:57,565 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 23:59:57,565 INFO ]: Found error trace [2018-06-24 23:59:57,565 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:59:57,565 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:59:57,566 INFO ]: Analyzing trace with hash 1936133170, now seen corresponding path program 1 times [2018-06-24 23:59:57,566 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:59:57,566 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:59:57,566 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:59:57,566 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:59:57,567 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:59:57,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:59:57,658 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 23:59:57,658 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:59:57,658 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:59:57,658 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:59:57,658 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:59:57,658 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:59:57,658 INFO ]: Start difference. First operand 8 states and 396 transitions. Second operand 3 states. [2018-06-24 23:59:59,600 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 23:59:59,600 INFO ]: Finished difference Result 9 states and 779 transitions. [2018-06-24 23:59:59,601 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 23:59:59,601 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-24 23:59:59,601 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 23:59:59,602 INFO ]: With dead ends: 9 [2018-06-24 23:59:59,602 INFO ]: Without dead ends: 9 [2018-06-24 23:59:59,602 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:59:59,602 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 23:59:59,607 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 23:59:59,608 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 23:59:59,610 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 779 transitions. [2018-06-24 23:59:59,610 INFO ]: Start accepts. Automaton has 9 states and 779 transitions. Word has length 7 [2018-06-24 23:59:59,611 INFO ]: Finished accepts. word is rejected. [2018-06-24 23:59:59,611 INFO ]: Abstraction has 9 states and 779 transitions. [2018-06-24 23:59:59,611 INFO ]: Interpolant automaton has 3 states. [2018-06-24 23:59:59,611 INFO ]: Start isEmpty. Operand 9 states and 779 transitions. [2018-06-24 23:59:59,612 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 23:59:59,612 INFO ]: Found error trace [2018-06-24 23:59:59,612 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 23:59:59,612 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 23:59:59,612 INFO ]: Analyzing trace with hash -123451042, now seen corresponding path program 1 times [2018-06-24 23:59:59,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 23:59:59,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 23:59:59,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:59:59,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 23:59:59,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 23:59:59,649 INFO ]: Conjunction of SSA is unsat [2018-06-24 23:59:59,719 INFO ]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 23:59:59,719 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 23:59:59,719 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 23:59:59,719 INFO ]: Interpolant automaton has 3 states [2018-06-24 23:59:59,719 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 23:59:59,719 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 23:59:59,719 INFO ]: Start difference. First operand 9 states and 779 transitions. Second operand 3 states. [2018-06-25 00:00:01,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:01,708 INFO ]: Finished difference Result 10 states and 1159 transitions. [2018-06-25 00:00:01,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:01,708 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 00:00:01,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:01,709 INFO ]: With dead ends: 10 [2018-06-25 00:00:01,709 INFO ]: Without dead ends: 10 [2018-06-25 00:00:01,709 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:00:01,709 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 00:00:01,714 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 00:00:01,714 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 00:00:01,717 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1159 transitions. [2018-06-25 00:00:01,717 INFO ]: Start accepts. Automaton has 10 states and 1159 transitions. Word has length 8 [2018-06-25 00:00:01,717 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:01,717 INFO ]: Abstraction has 10 states and 1159 transitions. [2018-06-25 00:00:01,717 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:01,717 INFO ]: Start isEmpty. Operand 10 states and 1159 transitions. [2018-06-25 00:00:01,718 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 00:00:01,718 INFO ]: Found error trace [2018-06-25 00:00:01,718 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:01,718 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:01,718 INFO ]: Analyzing trace with hash 888002696, now seen corresponding path program 1 times [2018-06-25 00:00:01,718 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:01,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:01,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:01,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:01,719 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:01,762 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:01,808 INFO ]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 00:00:01,808 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:01,808 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:01,808 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:01,809 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:01,809 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:01,809 INFO ]: Start difference. First operand 10 states and 1159 transitions. Second operand 3 states. [2018-06-25 00:00:03,561 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:03,561 INFO ]: Finished difference Result 11 states and 1419 transitions. [2018-06-25 00:00:03,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:03,567 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 00:00:03,567 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:03,569 INFO ]: With dead ends: 11 [2018-06-25 00:00:03,569 INFO ]: Without dead ends: 11 [2018-06-25 00:00:03,570 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:00:03,570 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 00:00:03,578 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 00:00:03,579 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 00:00:03,582 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1419 transitions. [2018-06-25 00:00:03,582 INFO ]: Start accepts. Automaton has 11 states and 1419 transitions. Word has length 9 [2018-06-25 00:00:03,582 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:03,582 INFO ]: Abstraction has 11 states and 1419 transitions. [2018-06-25 00:00:03,582 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:03,582 INFO ]: Start isEmpty. Operand 11 states and 1419 transitions. [2018-06-25 00:00:03,585 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:00:03,585 INFO ]: Found error trace [2018-06-25 00:00:03,585 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:03,585 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:03,585 INFO ]: Analyzing trace with hash 1178061155, now seen corresponding path program 1 times [2018-06-25 00:00:03,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:03,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:03,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:03,586 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:03,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:03,634 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:03,735 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:00:03,736 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:03,736 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:03,736 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:03,736 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:03,736 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:03,736 INFO ]: Start difference. First operand 11 states and 1419 transitions. Second operand 3 states. [2018-06-25 00:00:06,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:06,215 INFO ]: Finished difference Result 14 states and 2259 transitions. [2018-06-25 00:00:06,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:06,216 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:00:06,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:06,219 INFO ]: With dead ends: 14 [2018-06-25 00:00:06,219 INFO ]: Without dead ends: 14 [2018-06-25 00:00:06,220 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:00:06,220 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 00:00:06,230 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-25 00:00:06,230 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 00:00:06,232 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1999 transitions. [2018-06-25 00:00:06,232 INFO ]: Start accepts. Automaton has 13 states and 1999 transitions. Word has length 10 [2018-06-25 00:00:06,232 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:06,232 INFO ]: Abstraction has 13 states and 1999 transitions. [2018-06-25 00:00:06,232 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:06,233 INFO ]: Start isEmpty. Operand 13 states and 1999 transitions. [2018-06-25 00:00:06,234 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 00:00:06,234 INFO ]: Found error trace [2018-06-25 00:00:06,234 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:06,234 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:06,234 INFO ]: Analyzing trace with hash -1885852648, now seen corresponding path program 1 times [2018-06-25 00:00:06,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:06,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:06,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:06,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:06,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:06,268 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:06,344 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:00:06,344 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:06,344 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:06,344 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:06,344 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:06,344 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:06,344 INFO ]: Start difference. First operand 13 states and 1999 transitions. Second operand 3 states. [2018-06-25 00:00:07,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:07,902 INFO ]: Finished difference Result 15 states and 2423 transitions. [2018-06-25 00:00:07,902 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:07,902 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-25 00:00:07,902 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:07,907 INFO ]: With dead ends: 15 [2018-06-25 00:00:07,908 INFO ]: Without dead ends: 15 [2018-06-25 00:00:07,908 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:00:07,908 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 00:00:07,920 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 00:00:07,920 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 00:00:07,922 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2423 transitions. [2018-06-25 00:00:07,930 INFO ]: Start accepts. Automaton has 15 states and 2423 transitions. Word has length 10 [2018-06-25 00:00:07,930 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:07,930 INFO ]: Abstraction has 15 states and 2423 transitions. [2018-06-25 00:00:07,930 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:07,930 INFO ]: Start isEmpty. Operand 15 states and 2423 transitions. [2018-06-25 00:00:07,931 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:00:07,932 INFO ]: Found error trace [2018-06-25 00:00:07,932 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:07,932 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:07,932 INFO ]: Analyzing trace with hash 1376139145, now seen corresponding path program 1 times [2018-06-25 00:00:07,932 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:07,932 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:07,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:07,932 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:07,932 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:07,968 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:08,062 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:00:08,063 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:08,063 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:08,063 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:08,063 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:08,063 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:08,063 INFO ]: Start difference. First operand 15 states and 2423 transitions. Second operand 3 states. [2018-06-25 00:00:09,647 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:09,647 INFO ]: Finished difference Result 17 states and 2115 transitions. [2018-06-25 00:00:09,648 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:09,648 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:00:09,648 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:09,650 INFO ]: With dead ends: 17 [2018-06-25 00:00:09,650 INFO ]: Without dead ends: 17 [2018-06-25 00:00:09,650 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:00:09,650 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 00:00:09,658 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 00:00:09,658 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 00:00:09,659 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2115 transitions. [2018-06-25 00:00:09,660 INFO ]: Start accepts. Automaton has 17 states and 2115 transitions. Word has length 11 [2018-06-25 00:00:09,660 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:09,660 INFO ]: Abstraction has 17 states and 2115 transitions. [2018-06-25 00:00:09,660 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:09,660 INFO ]: Start isEmpty. Operand 17 states and 2115 transitions. [2018-06-25 00:00:09,661 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:00:09,661 INFO ]: Found error trace [2018-06-25 00:00:09,661 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:09,661 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:09,661 INFO ]: Analyzing trace with hash 1495835277, now seen corresponding path program 1 times [2018-06-25 00:00:09,661 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:09,661 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:09,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:09,662 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:09,662 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:09,694 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:09,781 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:00:09,782 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:09,782 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:09,782 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:09,782 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:09,782 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:09,782 INFO ]: Start difference. First operand 17 states and 2115 transitions. Second operand 3 states. [2018-06-25 00:00:11,665 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:11,665 INFO ]: Finished difference Result 19 states and 1887 transitions. [2018-06-25 00:00:11,666 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:11,666 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:00:11,666 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:11,667 INFO ]: With dead ends: 19 [2018-06-25 00:00:11,667 INFO ]: Without dead ends: 19 [2018-06-25 00:00:11,668 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:00:11,668 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 00:00:11,676 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 00:00:11,676 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 00:00:11,678 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1887 transitions. [2018-06-25 00:00:11,678 INFO ]: Start accepts. Automaton has 19 states and 1887 transitions. Word has length 11 [2018-06-25 00:00:11,678 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:11,678 INFO ]: Abstraction has 19 states and 1887 transitions. [2018-06-25 00:00:11,678 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:11,678 INFO ]: Start isEmpty. Operand 19 states and 1887 transitions. [2018-06-25 00:00:11,679 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 00:00:11,679 INFO ]: Found error trace [2018-06-25 00:00:11,679 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:11,679 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:11,679 INFO ]: Analyzing trace with hash -1369950200, now seen corresponding path program 1 times [2018-06-25 00:00:11,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:11,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:11,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:11,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:11,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:11,711 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:11,800 INFO ]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 00:00:11,800 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:11,801 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:11,801 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:11,801 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:11,801 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:11,801 INFO ]: Start difference. First operand 19 states and 1887 transitions. Second operand 3 states. [2018-06-25 00:00:13,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:13,321 INFO ]: Finished difference Result 21 states and 1947 transitions. [2018-06-25 00:00:13,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:13,322 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 00:00:13,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:13,323 INFO ]: With dead ends: 21 [2018-06-25 00:00:13,323 INFO ]: Without dead ends: 21 [2018-06-25 00:00:13,324 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:00:13,324 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-25 00:00:13,329 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-25 00:00:13,329 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 00:00:13,334 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1887 transitions. [2018-06-25 00:00:13,334 INFO ]: Start accepts. Automaton has 19 states and 1887 transitions. Word has length 11 [2018-06-25 00:00:13,334 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:13,334 INFO ]: Abstraction has 19 states and 1887 transitions. [2018-06-25 00:00:13,334 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:13,334 INFO ]: Start isEmpty. Operand 19 states and 1887 transitions. [2018-06-25 00:00:13,337 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:00:13,337 INFO ]: Found error trace [2018-06-25 00:00:13,337 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:13,337 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:13,337 INFO ]: Analyzing trace with hash 1609567904, now seen corresponding path program 1 times [2018-06-25 00:00:13,337 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:13,337 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:13,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:13,338 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:13,338 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:13,371 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:13,477 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:00:13,477 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:13,478 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:13,478 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:13,478 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:13,478 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:13,478 INFO ]: Start difference. First operand 19 states and 1887 transitions. Second operand 3 states. [2018-06-25 00:00:15,161 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:15,162 INFO ]: Finished difference Result 30 states and 2872 transitions. [2018-06-25 00:00:15,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:15,180 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:00:15,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:15,184 INFO ]: With dead ends: 30 [2018-06-25 00:00:15,184 INFO ]: Without dead ends: 30 [2018-06-25 00:00:15,184 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:00:15,184 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 00:00:15,192 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-25 00:00:15,192 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 00:00:15,197 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2872 transitions. [2018-06-25 00:00:15,197 INFO ]: Start accepts. Automaton has 30 states and 2872 transitions. Word has length 12 [2018-06-25 00:00:15,197 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:15,197 INFO ]: Abstraction has 30 states and 2872 transitions. [2018-06-25 00:00:15,197 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:15,197 INFO ]: Start isEmpty. Operand 30 states and 2872 transitions. [2018-06-25 00:00:15,200 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 00:00:15,200 INFO ]: Found error trace [2018-06-25 00:00:15,200 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:15,200 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:15,200 INFO ]: Analyzing trace with hash 447157130, now seen corresponding path program 1 times [2018-06-25 00:00:15,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:15,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:15,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:15,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:15,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:15,231 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:15,317 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:00:15,317 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:15,317 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:15,317 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:15,317 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:15,318 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:15,318 INFO ]: Start difference. First operand 30 states and 2872 transitions. Second operand 3 states. [2018-06-25 00:00:16,982 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:16,982 INFO ]: Finished difference Result 34 states and 3096 transitions. [2018-06-25 00:00:16,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:16,982 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-25 00:00:16,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:16,984 INFO ]: With dead ends: 34 [2018-06-25 00:00:16,984 INFO ]: Without dead ends: 34 [2018-06-25 00:00:16,985 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:00:16,985 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 00:00:16,992 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-25 00:00:16,992 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 00:00:16,996 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3096 transitions. [2018-06-25 00:00:16,996 INFO ]: Start accepts. Automaton has 34 states and 3096 transitions. Word has length 12 [2018-06-25 00:00:16,997 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:16,997 INFO ]: Abstraction has 34 states and 3096 transitions. [2018-06-25 00:00:16,997 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:16,997 INFO ]: Start isEmpty. Operand 34 states and 3096 transitions. [2018-06-25 00:00:17,002 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:00:17,002 INFO ]: Found error trace [2018-06-25 00:00:17,002 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:17,002 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:17,002 INFO ]: Analyzing trace with hash -424111057, now seen corresponding path program 1 times [2018-06-25 00:00:17,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:17,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:17,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:17,003 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:17,003 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:17,033 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:17,198 INFO ]: Checked inductivity of 36 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 00:00:17,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:00:17,198 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:00:17,204 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:17,484 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:17,504 INFO ]: Computing forward predicates... [2018-06-25 00:00:17,726 INFO ]: Checked inductivity of 36 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-25 00:00:17,760 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:00:17,760 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 00:00:17,760 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:00:17,760 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:00:17,760 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:00:17,761 INFO ]: Start difference. First operand 34 states and 3096 transitions. Second operand 6 states. [2018-06-25 00:00:23,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:23,385 INFO ]: Finished difference Result 110 states and 9856 transitions. [2018-06-25 00:00:23,386 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 00:00:23,386 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-25 00:00:23,386 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:23,399 INFO ]: With dead ends: 110 [2018-06-25 00:00:23,399 INFO ]: Without dead ends: 110 [2018-06-25 00:00:23,400 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-06-25 00:00:23,400 INFO ]: Start minimizeSevpa. Operand 110 states. [2018-06-25 00:00:23,426 INFO ]: Finished minimizeSevpa. Reduced states from 110 to 68. [2018-06-25 00:00:23,426 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-25 00:00:23,432 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 6556 transitions. [2018-06-25 00:00:23,432 INFO ]: Start accepts. Automaton has 68 states and 6556 transitions. Word has length 13 [2018-06-25 00:00:23,432 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:23,432 INFO ]: Abstraction has 68 states and 6556 transitions. [2018-06-25 00:00:23,432 INFO ]: Interpolant automaton has 6 states. [2018-06-25 00:00:23,432 INFO ]: Start isEmpty. Operand 68 states and 6556 transitions. [2018-06-25 00:00:23,436 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:00:23,436 INFO ]: Found error trace [2018-06-25 00:00:23,436 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:23,436 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:23,436 INFO ]: Analyzing trace with hash -612872268, now seen corresponding path program 1 times [2018-06-25 00:00:23,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:23,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:23,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:23,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:23,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:23,473 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:23,556 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:00:23,557 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:23,557 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:23,557 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:23,557 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:23,557 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:23,557 INFO ]: Start difference. First operand 68 states and 6556 transitions. Second operand 3 states. [2018-06-25 00:00:25,270 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:25,270 INFO ]: Finished difference Result 76 states and 6564 transitions. [2018-06-25 00:00:25,271 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:25,271 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:00:25,271 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:25,275 INFO ]: With dead ends: 76 [2018-06-25 00:00:25,275 INFO ]: Without dead ends: 76 [2018-06-25 00:00:25,275 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:00:25,275 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-25 00:00:25,291 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-06-25 00:00:25,291 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-25 00:00:25,295 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 6564 transitions. [2018-06-25 00:00:25,295 INFO ]: Start accepts. Automaton has 76 states and 6564 transitions. Word has length 13 [2018-06-25 00:00:25,295 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:25,295 INFO ]: Abstraction has 76 states and 6564 transitions. [2018-06-25 00:00:25,295 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:25,295 INFO ]: Start isEmpty. Operand 76 states and 6564 transitions. [2018-06-25 00:00:25,298 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:00:25,298 INFO ]: Found error trace [2018-06-25 00:00:25,298 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:25,298 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:25,298 INFO ]: Analyzing trace with hash -1622742514, now seen corresponding path program 1 times [2018-06-25 00:00:25,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:25,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:25,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:25,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:25,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:25,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:25,415 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:00:25,415 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:25,415 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:25,415 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:25,415 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:25,415 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:25,415 INFO ]: Start difference. First operand 76 states and 6564 transitions. Second operand 3 states. [2018-06-25 00:00:27,812 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:27,812 INFO ]: Finished difference Result 84 states and 6292 transitions. [2018-06-25 00:00:27,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:27,812 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:00:27,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:27,819 INFO ]: With dead ends: 84 [2018-06-25 00:00:27,819 INFO ]: Without dead ends: 84 [2018-06-25 00:00:27,819 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:00:27,819 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-25 00:00:27,842 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-06-25 00:00:27,842 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-25 00:00:27,850 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 6292 transitions. [2018-06-25 00:00:27,850 INFO ]: Start accepts. Automaton has 84 states and 6292 transitions. Word has length 13 [2018-06-25 00:00:27,850 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:27,850 INFO ]: Abstraction has 84 states and 6292 transitions. [2018-06-25 00:00:27,850 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:27,850 INFO ]: Start isEmpty. Operand 84 states and 6292 transitions. [2018-06-25 00:00:27,852 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:00:27,853 INFO ]: Found error trace [2018-06-25 00:00:27,853 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:27,854 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:27,854 INFO ]: Analyzing trace with hash -1426229009, now seen corresponding path program 1 times [2018-06-25 00:00:27,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:27,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:27,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:27,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:27,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:27,878 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:27,961 INFO ]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 00:00:27,961 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:27,961 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:27,962 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:27,962 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:27,962 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:27,962 INFO ]: Start difference. First operand 84 states and 6292 transitions. Second operand 3 states. [2018-06-25 00:00:29,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:29,564 INFO ]: Finished difference Result 160 states and 6292 transitions. [2018-06-25 00:00:29,564 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:29,564 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:00:29,564 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:29,568 INFO ]: With dead ends: 160 [2018-06-25 00:00:29,568 INFO ]: Without dead ends: 84 [2018-06-25 00:00:29,568 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:00:29,568 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-25 00:00:29,590 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-06-25 00:00:29,590 INFO ]: Start removeUnreachable. Operand 84 states. [2018-06-25 00:00:29,593 INFO ]: Finished removeUnreachable. Reduced from 84 states to 84 states and 5078 transitions. [2018-06-25 00:00:29,593 INFO ]: Start accepts. Automaton has 84 states and 5078 transitions. Word has length 13 [2018-06-25 00:00:29,593 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:29,593 INFO ]: Abstraction has 84 states and 5078 transitions. [2018-06-25 00:00:29,593 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:29,593 INFO ]: Start isEmpty. Operand 84 states and 5078 transitions. [2018-06-25 00:00:29,595 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:00:29,595 INFO ]: Found error trace [2018-06-25 00:00:29,595 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:29,595 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:29,595 INFO ]: Analyzing trace with hash 1117968177, now seen corresponding path program 1 times [2018-06-25 00:00:29,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:29,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:29,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:29,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:29,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:29,617 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:29,699 INFO ]: Checked inductivity of 36 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-25 00:00:29,699 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:29,699 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:29,699 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:29,699 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:29,699 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:29,699 INFO ]: Start difference. First operand 84 states and 5078 transitions. Second operand 3 states. [2018-06-25 00:00:31,256 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:31,256 INFO ]: Finished difference Result 160 states and 8046 transitions. [2018-06-25 00:00:31,256 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:31,256 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:00:31,256 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:31,266 INFO ]: With dead ends: 160 [2018-06-25 00:00:31,266 INFO ]: Without dead ends: 160 [2018-06-25 00:00:31,266 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 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:00:31,266 INFO ]: Start minimizeSevpa. Operand 160 states. [2018-06-25 00:00:31,291 INFO ]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-06-25 00:00:31,291 INFO ]: Start removeUnreachable. Operand 160 states. [2018-06-25 00:00:31,297 INFO ]: Finished removeUnreachable. Reduced from 160 states to 160 states and 8046 transitions. [2018-06-25 00:00:31,297 INFO ]: Start accepts. Automaton has 160 states and 8046 transitions. Word has length 13 [2018-06-25 00:00:31,297 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:31,297 INFO ]: Abstraction has 160 states and 8046 transitions. [2018-06-25 00:00:31,297 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:31,297 INFO ]: Start isEmpty. Operand 160 states and 8046 transitions. [2018-06-25 00:00:31,299 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:00:31,299 INFO ]: Found error trace [2018-06-25 00:00:31,299 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:31,299 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:31,299 INFO ]: Analyzing trace with hash -755922707, now seen corresponding path program 1 times [2018-06-25 00:00:31,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:31,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:31,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:31,300 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:31,300 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:31,317 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:31,391 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:00:31,391 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:31,392 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:31,392 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:31,392 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:31,392 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:31,392 INFO ]: Start difference. First operand 160 states and 8046 transitions. Second operand 3 states. [2018-06-25 00:00:32,749 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:32,750 INFO ]: Finished difference Result 198 states and 8708 transitions. [2018-06-25 00:00:32,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:32,750 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:00:32,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:32,762 INFO ]: With dead ends: 198 [2018-06-25 00:00:32,762 INFO ]: Without dead ends: 198 [2018-06-25 00:00:32,762 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:00:32,762 INFO ]: Start minimizeSevpa. Operand 198 states. [2018-06-25 00:00:32,789 INFO ]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-06-25 00:00:32,789 INFO ]: Start removeUnreachable. Operand 198 states. [2018-06-25 00:00:32,796 INFO ]: Finished removeUnreachable. Reduced from 198 states to 198 states and 8708 transitions. [2018-06-25 00:00:32,796 INFO ]: Start accepts. Automaton has 198 states and 8708 transitions. Word has length 13 [2018-06-25 00:00:32,796 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:32,796 INFO ]: Abstraction has 198 states and 8708 transitions. [2018-06-25 00:00:32,796 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:32,796 INFO ]: Start isEmpty. Operand 198 states and 8708 transitions. [2018-06-25 00:00:32,799 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 00:00:32,799 INFO ]: Found error trace [2018-06-25 00:00:32,799 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:32,799 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:32,799 INFO ]: Analyzing trace with hash -389604061, now seen corresponding path program 1 times [2018-06-25 00:00:32,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:32,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:32,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:32,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:32,802 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:32,824 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:32,979 INFO ]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-25 00:00:32,979 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:32,979 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:32,979 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:32,979 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:32,979 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:32,979 INFO ]: Start difference. First operand 198 states and 8708 transitions. Second operand 3 states. [2018-06-25 00:00:34,297 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:34,297 INFO ]: Finished difference Result 298 states and 13612 transitions. [2018-06-25 00:00:34,298 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:34,298 INFO ]: Start accepts. Automaton has 3 states. Word has length 13 [2018-06-25 00:00:34,298 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:34,303 INFO ]: With dead ends: 298 [2018-06-25 00:00:34,303 INFO ]: Without dead ends: 298 [2018-06-25 00:00:34,304 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 00:00:34,304 INFO ]: Start minimizeSevpa. Operand 298 states. [2018-06-25 00:00:34,329 INFO ]: Finished minimizeSevpa. Reduced states from 298 to 208. [2018-06-25 00:00:34,329 INFO ]: Start removeUnreachable. Operand 208 states. [2018-06-25 00:00:34,338 INFO ]: Finished removeUnreachable. Reduced from 208 states to 208 states and 9260 transitions. [2018-06-25 00:00:34,338 INFO ]: Start accepts. Automaton has 208 states and 9260 transitions. Word has length 13 [2018-06-25 00:00:34,339 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:34,339 INFO ]: Abstraction has 208 states and 9260 transitions. [2018-06-25 00:00:34,339 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:34,339 INFO ]: Start isEmpty. Operand 208 states and 9260 transitions. [2018-06-25 00:00:34,342 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:00:34,342 INFO ]: Found error trace [2018-06-25 00:00:34,342 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:34,342 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:34,342 INFO ]: Analyzing trace with hash 1370346691, now seen corresponding path program 1 times [2018-06-25 00:00:34,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:34,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:34,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:34,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:34,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:34,371 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:34,470 INFO ]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-25 00:00:34,471 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:34,471 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:34,471 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:34,471 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:34,471 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:34,471 INFO ]: Start difference. First operand 208 states and 9260 transitions. Second operand 3 states. [2018-06-25 00:00:36,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:36,048 INFO ]: Finished difference Result 228 states and 8604 transitions. [2018-06-25 00:00:36,048 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:36,048 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:00:36,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:36,051 INFO ]: With dead ends: 228 [2018-06-25 00:00:36,051 INFO ]: Without dead ends: 228 [2018-06-25 00:00:36,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-25 00:00:36,051 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-25 00:00:36,063 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 208. [2018-06-25 00:00:36,063 INFO ]: Start removeUnreachable. Operand 208 states. [2018-06-25 00:00:36,068 INFO ]: Finished removeUnreachable. Reduced from 208 states to 208 states and 8324 transitions. [2018-06-25 00:00:36,068 INFO ]: Start accepts. Automaton has 208 states and 8324 transitions. Word has length 17 [2018-06-25 00:00:36,068 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:36,068 INFO ]: Abstraction has 208 states and 8324 transitions. [2018-06-25 00:00:36,068 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:36,068 INFO ]: Start isEmpty. Operand 208 states and 8324 transitions. [2018-06-25 00:00:36,071 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:00:36,071 INFO ]: Found error trace [2018-06-25 00:00:36,071 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:36,071 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:36,071 INFO ]: Analyzing trace with hash 1566860196, now seen corresponding path program 1 times [2018-06-25 00:00:36,071 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:36,071 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:36,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:36,072 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:36,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:36,102 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:36,193 INFO ]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-25 00:00:36,193 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:36,193 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:36,193 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:36,193 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:36,193 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:36,193 INFO ]: Start difference. First operand 208 states and 8324 transitions. Second operand 3 states. [2018-06-25 00:00:37,193 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:37,193 INFO ]: Finished difference Result 228 states and 7764 transitions. [2018-06-25 00:00:37,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:37,193 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:00:37,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:37,196 INFO ]: With dead ends: 228 [2018-06-25 00:00:37,196 INFO ]: Without dead ends: 228 [2018-06-25 00:00:37,196 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:00:37,197 INFO ]: Start minimizeSevpa. Operand 228 states. [2018-06-25 00:00:37,205 INFO ]: Finished minimizeSevpa. Reduced states from 228 to 213. [2018-06-25 00:00:37,205 INFO ]: Start removeUnreachable. Operand 213 states. [2018-06-25 00:00:37,208 INFO ]: Finished removeUnreachable. Reduced from 213 states to 213 states and 7669 transitions. [2018-06-25 00:00:37,208 INFO ]: Start accepts. Automaton has 213 states and 7669 transitions. Word has length 17 [2018-06-25 00:00:37,208 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:37,208 INFO ]: Abstraction has 213 states and 7669 transitions. [2018-06-25 00:00:37,208 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:37,208 INFO ]: Start isEmpty. Operand 213 states and 7669 transitions. [2018-06-25 00:00:37,211 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:00:37,211 INFO ]: Found error trace [2018-06-25 00:00:37,211 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:37,211 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:37,211 INFO ]: Analyzing trace with hash -670310705, now seen corresponding path program 1 times [2018-06-25 00:00:37,211 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:37,211 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:37,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:37,212 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:37,212 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:37,242 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:37,324 INFO ]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-25 00:00:37,325 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:37,325 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:37,325 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:37,325 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:37,325 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:37,325 INFO ]: Start difference. First operand 213 states and 7669 transitions. Second operand 3 states. [2018-06-25 00:00:38,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:38,464 INFO ]: Finished difference Result 128 states and 3929 transitions. [2018-06-25 00:00:38,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:38,464 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:00:38,464 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:38,467 INFO ]: With dead ends: 128 [2018-06-25 00:00:38,467 INFO ]: Without dead ends: 128 [2018-06-25 00:00:38,468 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:00:38,468 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-25 00:00:38,477 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-06-25 00:00:38,477 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-25 00:00:38,481 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 3929 transitions. [2018-06-25 00:00:38,481 INFO ]: Start accepts. Automaton has 128 states and 3929 transitions. Word has length 17 [2018-06-25 00:00:38,481 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:38,481 INFO ]: Abstraction has 128 states and 3929 transitions. [2018-06-25 00:00:38,481 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:38,481 INFO ]: Start isEmpty. Operand 128 states and 3929 transitions. [2018-06-25 00:00:38,483 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:00:38,483 INFO ]: Found error trace [2018-06-25 00:00:38,483 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:38,483 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:38,484 INFO ]: Analyzing trace with hash -44080762, now seen corresponding path program 1 times [2018-06-25 00:00:38,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:38,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:38,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:38,484 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:38,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:38,519 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:38,620 INFO ]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-25 00:00:38,620 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:38,620 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:38,620 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:38,620 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:38,620 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:38,620 INFO ]: Start difference. First operand 128 states and 3929 transitions. Second operand 3 states. [2018-06-25 00:00:39,842 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:39,842 INFO ]: Finished difference Result 138 states and 3985 transitions. [2018-06-25 00:00:39,843 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:39,843 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:00:39,843 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:39,844 INFO ]: With dead ends: 138 [2018-06-25 00:00:39,845 INFO ]: Without dead ends: 138 [2018-06-25 00:00:39,845 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:00:39,845 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-25 00:00:39,850 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 128. [2018-06-25 00:00:39,850 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-25 00:00:39,853 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 3929 transitions. [2018-06-25 00:00:39,853 INFO ]: Start accepts. Automaton has 128 states and 3929 transitions. Word has length 17 [2018-06-25 00:00:39,853 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:39,853 INFO ]: Abstraction has 128 states and 3929 transitions. [2018-06-25 00:00:39,853 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:39,853 INFO ]: Start isEmpty. Operand 128 states and 3929 transitions. [2018-06-25 00:00:39,854 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:00:39,854 INFO ]: Found error trace [2018-06-25 00:00:39,855 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:39,855 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:39,855 INFO ]: Analyzing trace with hash -1564503865, now seen corresponding path program 1 times [2018-06-25 00:00:39,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:39,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:39,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:39,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:39,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:39,885 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:39,964 INFO ]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-25 00:00:39,964 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:39,964 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:39,964 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:39,964 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:39,964 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:39,964 INFO ]: Start difference. First operand 128 states and 3929 transitions. Second operand 3 states. [2018-06-25 00:00:40,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:40,974 INFO ]: Finished difference Result 138 states and 3985 transitions. [2018-06-25 00:00:40,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:40,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:00:40,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:40,976 INFO ]: With dead ends: 138 [2018-06-25 00:00:40,976 INFO ]: Without dead ends: 138 [2018-06-25 00:00:40,976 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:00:40,977 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-25 00:00:40,984 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 128. [2018-06-25 00:00:40,984 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-25 00:00:40,987 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 3929 transitions. [2018-06-25 00:00:40,987 INFO ]: Start accepts. Automaton has 128 states and 3929 transitions. Word has length 17 [2018-06-25 00:00:40,987 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:40,987 INFO ]: Abstraction has 128 states and 3929 transitions. [2018-06-25 00:00:40,987 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:40,987 INFO ]: Start isEmpty. Operand 128 states and 3929 transitions. [2018-06-25 00:00:40,988 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:00:40,988 INFO ]: Found error trace [2018-06-25 00:00:40,988 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:40,988 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:40,988 INFO ]: Analyzing trace with hash -765481723, now seen corresponding path program 1 times [2018-06-25 00:00:40,988 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:40,988 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:40,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:40,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:40,989 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:41,024 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:41,115 INFO ]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-25 00:00:41,116 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:41,116 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:41,116 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:41,116 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:41,116 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:41,116 INFO ]: Start difference. First operand 128 states and 3929 transitions. Second operand 3 states. [2018-06-25 00:00:42,662 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:42,663 INFO ]: Finished difference Result 138 states and 4117 transitions. [2018-06-25 00:00:42,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:42,663 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:00:42,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:42,666 INFO ]: With dead ends: 138 [2018-06-25 00:00:42,666 INFO ]: Without dead ends: 138 [2018-06-25 00:00:42,666 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:00:42,666 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-25 00:00:42,673 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 128. [2018-06-25 00:00:42,673 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-25 00:00:42,676 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 3929 transitions. [2018-06-25 00:00:42,676 INFO ]: Start accepts. Automaton has 128 states and 3929 transitions. Word has length 17 [2018-06-25 00:00:42,676 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:42,676 INFO ]: Abstraction has 128 states and 3929 transitions. [2018-06-25 00:00:42,676 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:42,676 INFO ]: Start isEmpty. Operand 128 states and 3929 transitions. [2018-06-25 00:00:42,677 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:00:42,677 INFO ]: Found error trace [2018-06-25 00:00:42,678 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:42,678 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:42,678 INFO ]: Analyzing trace with hash 1830652536, now seen corresponding path program 1 times [2018-06-25 00:00:42,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:42,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:42,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:42,678 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:42,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:42,708 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:42,791 INFO ]: Checked inductivity of 78 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-25 00:00:42,792 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:42,792 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:42,792 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:42,792 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:42,792 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:42,792 INFO ]: Start difference. First operand 128 states and 3929 transitions. Second operand 3 states. [2018-06-25 00:00:43,935 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:43,936 INFO ]: Finished difference Result 128 states and 3685 transitions. [2018-06-25 00:00:43,936 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:43,936 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:00:43,936 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:43,937 INFO ]: With dead ends: 128 [2018-06-25 00:00:43,937 INFO ]: Without dead ends: 128 [2018-06-25 00:00:43,937 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:00:43,938 INFO ]: Start minimizeSevpa. Operand 128 states. [2018-06-25 00:00:43,942 INFO ]: Finished minimizeSevpa. Reduced states from 128 to 118. [2018-06-25 00:00:43,942 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-25 00:00:43,944 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 3629 transitions. [2018-06-25 00:00:43,944 INFO ]: Start accepts. Automaton has 118 states and 3629 transitions. Word has length 17 [2018-06-25 00:00:43,944 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:43,944 INFO ]: Abstraction has 118 states and 3629 transitions. [2018-06-25 00:00:43,944 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:43,944 INFO ]: Start isEmpty. Operand 118 states and 3629 transitions. [2018-06-25 00:00:43,945 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 00:00:43,945 INFO ]: Found error trace [2018-06-25 00:00:43,946 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:43,946 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:43,946 INFO ]: Analyzing trace with hash -558786642, now seen corresponding path program 1 times [2018-06-25 00:00:43,946 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:43,946 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:43,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:43,946 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:43,946 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:43,969 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:44,048 INFO ]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-25 00:00:44,048 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 00:00:44,048 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 00:00:44,049 INFO ]: Interpolant automaton has 3 states [2018-06-25 00:00:44,049 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 00:00:44,049 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 00:00:44,049 INFO ]: Start difference. First operand 118 states and 3629 transitions. Second operand 3 states. [2018-06-25 00:00:45,512 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 00:00:45,513 INFO ]: Finished difference Result 138 states and 3741 transitions. [2018-06-25 00:00:45,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 00:00:45,513 INFO ]: Start accepts. Automaton has 3 states. Word has length 17 [2018-06-25 00:00:45,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 00:00:45,514 INFO ]: With dead ends: 138 [2018-06-25 00:00:45,514 INFO ]: Without dead ends: 138 [2018-06-25 00:00:45,514 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:00:45,514 INFO ]: Start minimizeSevpa. Operand 138 states. [2018-06-25 00:00:45,520 INFO ]: Finished minimizeSevpa. Reduced states from 138 to 118. [2018-06-25 00:00:45,520 INFO ]: Start removeUnreachable. Operand 118 states. [2018-06-25 00:00:45,523 INFO ]: Finished removeUnreachable. Reduced from 118 states to 118 states and 3629 transitions. [2018-06-25 00:00:45,523 INFO ]: Start accepts. Automaton has 118 states and 3629 transitions. Word has length 17 [2018-06-25 00:00:45,523 INFO ]: Finished accepts. word is rejected. [2018-06-25 00:00:45,523 INFO ]: Abstraction has 118 states and 3629 transitions. [2018-06-25 00:00:45,523 INFO ]: Interpolant automaton has 3 states. [2018-06-25 00:00:45,523 INFO ]: Start isEmpty. Operand 118 states and 3629 transitions. [2018-06-25 00:00:45,524 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 00:00:45,524 INFO ]: Found error trace [2018-06-25 00:00:45,524 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 00:00:45,524 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 00:00:45,524 INFO ]: Analyzing trace with hash -2103676327, now seen corresponding path program 1 times [2018-06-25 00:00:45,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 00:00:45,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 00:00:45,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:45,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:45,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 00:00:45,550 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:45,671 INFO ]: Checked inductivity of 91 backedges. 60 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-25 00:00:45,671 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 00:00:45,671 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 00:00:45,680 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 00:00:45,990 INFO ]: Conjunction of SSA is unsat [2018-06-25 00:00:46,003 INFO ]: Computing forward predicates... [2018-06-25 00:00:46,015 INFO ]: Checked inductivity of 91 backedges. 60 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-25 00:00:46,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 00:00:46,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 00:00:46,038 INFO ]: Interpolant automaton has 6 states [2018-06-25 00:00:46,038 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 00:00:46,038 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 00:00:46,038 INFO ]: Start difference. First operand 118 states and 3629 transitions. Second operand 6 states. Received shutdown request... [2018-06-25 00:00:47,859 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 00:00:47,860 WARN ]: Verification canceled [2018-06-25 00:00:47,862 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 00:00:47,863 WARN ]: Timeout [2018-06-25 00:00:47,863 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 12:00:47 BasicIcfg [2018-06-25 00:00:47,863 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 00:00:48,030 INFO ]: Toolchain (without parser) took 64443.03 ms. Allocated memory was 302.5 MB in the beginning and 974.7 MB in the end (delta: 672.1 MB). Free memory was 241.0 MB in the beginning and 398.8 MB in the end (delta: -157.8 MB). Peak memory consumption was 514.3 MB. Max. memory is 3.6 GB. [2018-06-25 00:00:48,032 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 302.5 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 00:00:48,032 INFO ]: ChcToBoogie took 104.81 ms. Allocated memory is still 302.5 MB. Free memory was 241.0 MB in the beginning and 237.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 00:00:48,033 INFO ]: Boogie Preprocessor took 54.89 ms. Allocated memory is still 302.5 MB. Free memory was 237.9 MB in the beginning and 236.0 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:00:48,033 INFO ]: RCFGBuilder took 388.88 ms. Allocated memory is still 302.5 MB. Free memory was 236.0 MB in the beginning and 208.5 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 3.6 GB. [2018-06-25 00:00:48,033 INFO ]: BlockEncodingV2 took 6741.76 ms. Allocated memory was 302.5 MB in the beginning and 356.0 MB in the end (delta: 53.5 MB). Free memory was 208.5 MB in the beginning and 249.8 MB in the end (delta: -41.3 MB). Peak memory consumption was 63.7 MB. Max. memory is 3.6 GB. [2018-06-25 00:00:48,034 INFO ]: TraceAbstraction took 57136.74 ms. Allocated memory was 356.0 MB in the beginning and 974.7 MB in the end (delta: 618.7 MB). Free memory was 247.5 MB in the beginning and 398.8 MB in the end (delta: -151.3 MB). Peak memory consumption was 467.4 MB. Max. memory is 3.6 GB. [2018-06-25 00:00:48,037 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, 524 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 302.5 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 104.81 ms. Allocated memory is still 302.5 MB. Free memory was 241.0 MB in the beginning and 237.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 54.89 ms. Allocated memory is still 302.5 MB. Free memory was 237.9 MB in the beginning and 236.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 388.88 ms. Allocated memory is still 302.5 MB. Free memory was 236.0 MB in the beginning and 208.5 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 6741.76 ms. Allocated memory was 302.5 MB in the beginning and 356.0 MB in the end (delta: 53.5 MB). Free memory was 208.5 MB in the beginning and 249.8 MB in the end (delta: -41.3 MB). Peak memory consumption was 63.7 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57136.74 ms. Allocated memory was 356.0 MB in the beginning and 974.7 MB in the end (delta: 618.7 MB). Free memory was 247.5 MB in the beginning and 398.8 MB in the end (delta: -151.3 MB). Peak memory consumption was 467.4 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 (118states) and interpolant automaton (currently 6 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (145 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 57.0s OverallTime, 28 OverallIterations, 2 TraceHistogramMax, 52.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 138 SDtfs, 0 SDslu, 121 SDs, 0 SdLazy, 17425 SolverSat, 15201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=21, 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.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 230 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 5723 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4021 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 1259/1263 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_clnt_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_00-00-48-053.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_00-00-48-053.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_00-00-48-053.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_00-00-48-053.csv Completed graceful shutdown