java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:30:46,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:30:46,627 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:30:46,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:30:46,642 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:30:46,643 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:30:46,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:30:46,646 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:30:46,648 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:30:46,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:30:46,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:30:46,650 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:30:46,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:30:46,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:30:46,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:30:46,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:30:46,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:30:46,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:30:46,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:30:46,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:30:46,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:30:46,665 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:30:46,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:30:46,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:30:46,666 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:30:46,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:30:46,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:30:46,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:30:46,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:30:46,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:30:46,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:30:46,672 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:30:46,672 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:30:46,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:30:46,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:30:46,674 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:30:46,696 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:30:46,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:30:46,697 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:30:46,697 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:30:46,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:30:46,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:30:46,705 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:30:46,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:30:46,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:30:46,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:30:46,707 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:30:46,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:30:46,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:30:46,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:30:46,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:30:46,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:30:46,708 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:30:46,709 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:30:46,709 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:30:46,750 INFO ]: Repository-Root is: /tmp [2018-06-22 02:30:46,770 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:30:46,776 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:30:46,777 INFO ]: Initializing SmtParser... [2018-06-22 02:30:46,778 INFO ]: SmtParser initialized [2018-06-22 02:30:46,778 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 [2018-06-22 02:30:46,779 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-22 02:30:46,877 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@7258e90c [2018-06-22 02:30:47,135 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__limit1unrolled.smt2 [2018-06-22 02:30:47,140 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:30:47,147 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:30:47,147 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:30:47,147 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:30:47,148 INFO ]: ChcToBoogie initialized [2018-06-22 02:30:47,151 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:30:47" (1/1) ... [2018-06-22 02:30:47,231 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47 Unit [2018-06-22 02:30:47,231 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:30:47,232 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:30:47,232 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:30:47,232 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:30:47,254 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47" (1/1) ... [2018-06-22 02:30:47,254 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47" (1/1) ... [2018-06-22 02:30:47,265 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47" (1/1) ... [2018-06-22 02:30:47,266 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47" (1/1) ... [2018-06-22 02:30:47,272 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47" (1/1) ... [2018-06-22 02:30:47,276 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47" (1/1) ... [2018-06-22 02:30:47,280 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47" (1/1) ... [2018-06-22 02:30:47,282 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:30:47,283 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:30:47,283 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:30:47,283 INFO ]: RCFGBuilder initialized [2018-06-22 02:30:47,284 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 02:30:47,306 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:30:47,306 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:30:47,306 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:30:47,306 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:30:47,306 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:30:47,306 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:30:47,857 INFO ]: Using library mode [2018-06-22 02:30:47,858 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:30:47 BoogieIcfgContainer [2018-06-22 02:30:47,858 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:30:47,859 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:30:47,860 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:30:47,863 INFO ]: TraceAbstraction initialized [2018-06-22 02:30:47,863 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:30:47" (1/3) ... [2018-06-22 02:30:47,867 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d026f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:30:47, skipping insertion in model container [2018-06-22 02:30:47,867 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:30:47" (2/3) ... [2018-06-22 02:30:47,868 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d026f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:30:47, skipping insertion in model container [2018-06-22 02:30:47,868 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:30:47" (3/3) ... [2018-06-22 02:30:47,870 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:30:47,877 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:30:47,885 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:30:47,930 INFO ]: Using default assertion order modulation [2018-06-22 02:30:47,931 INFO ]: Interprodecural is true [2018-06-22 02:30:47,931 INFO ]: Hoare is false [2018-06-22 02:30:47,931 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:30:47,931 INFO ]: Backedges is TWOTRACK [2018-06-22 02:30:47,931 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:30:47,931 INFO ]: Difference is false [2018-06-22 02:30:47,931 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:30:47,931 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:30:47,948 INFO ]: Start isEmpty. Operand 31 states. [2018-06-22 02:30:47,959 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:30:47,959 INFO ]: Found error trace [2018-06-22 02:30:47,960 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:47,960 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:47,963 INFO ]: Analyzing trace with hash 109750059, now seen corresponding path program 1 times [2018-06-22 02:30:47,964 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:47,965 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:48,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:48,002 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:48,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:48,032 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:48,109 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:48,111 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:48,111 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:30:48,113 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:48,126 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:48,126 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:48,129 INFO ]: Start difference. First operand 31 states. Second operand 4 states. [2018-06-22 02:30:48,697 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:48,697 INFO ]: Finished difference Result 51 states and 93 transitions. [2018-06-22 02:30:48,698 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:48,699 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 02:30:48,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:48,712 INFO ]: With dead ends: 51 [2018-06-22 02:30:48,713 INFO ]: Without dead ends: 51 [2018-06-22 02:30:48,714 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:48,728 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-22 02:30:48,764 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-06-22 02:30:48,765 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 02:30:48,771 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 93 transitions. [2018-06-22 02:30:48,773 INFO ]: Start accepts. Automaton has 51 states and 93 transitions. Word has length 8 [2018-06-22 02:30:48,773 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:48,773 INFO ]: Abstraction has 51 states and 93 transitions. [2018-06-22 02:30:48,773 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:48,773 INFO ]: Start isEmpty. Operand 51 states and 93 transitions. [2018-06-22 02:30:48,775 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:30:48,775 INFO ]: Found error trace [2018-06-22 02:30:48,775 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:48,775 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:48,775 INFO ]: Analyzing trace with hash -1873243328, now seen corresponding path program 1 times [2018-06-22 02:30:48,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:48,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:48,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:48,776 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:48,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:48,781 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:48,903 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:48,903 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:48,903 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:30:48,905 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:48,905 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:48,905 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:48,905 INFO ]: Start difference. First operand 51 states and 93 transitions. Second operand 4 states. [2018-06-22 02:30:49,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:49,149 INFO ]: Finished difference Result 73 states and 134 transitions. [2018-06-22 02:30:49,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:49,150 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:30:49,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:49,154 INFO ]: With dead ends: 73 [2018-06-22 02:30:49,154 INFO ]: Without dead ends: 73 [2018-06-22 02:30:49,155 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:49,155 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-22 02:30:49,166 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-06-22 02:30:49,166 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 02:30:49,169 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2018-06-22 02:30:49,169 INFO ]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 9 [2018-06-22 02:30:49,170 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:49,170 INFO ]: Abstraction has 73 states and 134 transitions. [2018-06-22 02:30:49,170 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:49,170 INFO ]: Start isEmpty. Operand 73 states and 134 transitions. [2018-06-22 02:30:49,171 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:30:49,171 INFO ]: Found error trace [2018-06-22 02:30:49,171 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:49,172 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:49,172 INFO ]: Analyzing trace with hash -1881406062, now seen corresponding path program 1 times [2018-06-22 02:30:49,172 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:49,172 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:49,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:49,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:49,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:49,180 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:49,271 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:49,271 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:49,271 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:30:49,271 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:49,271 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:49,271 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:49,272 INFO ]: Start difference. First operand 73 states and 134 transitions. Second operand 4 states. [2018-06-22 02:30:49,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:49,720 INFO ]: Finished difference Result 95 states and 175 transitions. [2018-06-22 02:30:49,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:49,721 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 02:30:49,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:49,724 INFO ]: With dead ends: 95 [2018-06-22 02:30:49,724 INFO ]: Without dead ends: 95 [2018-06-22 02:30:49,724 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:49,724 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-22 02:30:49,735 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-06-22 02:30:49,735 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-22 02:30:49,738 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 175 transitions. [2018-06-22 02:30:49,738 INFO ]: Start accepts. Automaton has 95 states and 175 transitions. Word has length 9 [2018-06-22 02:30:49,738 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:49,738 INFO ]: Abstraction has 95 states and 175 transitions. [2018-06-22 02:30:49,738 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:49,738 INFO ]: Start isEmpty. Operand 95 states and 175 transitions. [2018-06-22 02:30:49,740 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 02:30:49,740 INFO ]: Found error trace [2018-06-22 02:30:49,740 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:49,740 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:49,740 INFO ]: Analyzing trace with hash 268100100, now seen corresponding path program 1 times [2018-06-22 02:30:49,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:49,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:49,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:49,741 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:49,741 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:49,751 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:49,820 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:49,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:49,820 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:30:49,820 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:49,820 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:49,820 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:49,820 INFO ]: Start difference. First operand 95 states and 175 transitions. Second operand 4 states. [2018-06-22 02:30:49,924 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:49,924 INFO ]: Finished difference Result 117 states and 216 transitions. [2018-06-22 02:30:49,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:49,924 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 02:30:49,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:49,926 INFO ]: With dead ends: 117 [2018-06-22 02:30:49,926 INFO ]: Without dead ends: 117 [2018-06-22 02:30:49,927 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:49,927 INFO ]: Start minimizeSevpa. Operand 117 states. [2018-06-22 02:30:49,940 INFO ]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-06-22 02:30:49,940 INFO ]: Start removeUnreachable. Operand 117 states. [2018-06-22 02:30:49,942 INFO ]: Finished removeUnreachable. Reduced from 117 states to 117 states and 216 transitions. [2018-06-22 02:30:49,943 INFO ]: Start accepts. Automaton has 117 states and 216 transitions. Word has length 11 [2018-06-22 02:30:49,943 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:49,943 INFO ]: Abstraction has 117 states and 216 transitions. [2018-06-22 02:30:49,943 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:49,943 INFO ]: Start isEmpty. Operand 117 states and 216 transitions. [2018-06-22 02:30:49,947 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:30:49,947 INFO ]: Found error trace [2018-06-22 02:30:49,947 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:49,947 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:49,947 INFO ]: Analyzing trace with hash 530424345, now seen corresponding path program 1 times [2018-06-22 02:30:49,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:49,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:49,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:49,948 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:49,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:49,961 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:50,024 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:50,025 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:50,025 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:30:50,025 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:30:50,025 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:30:50,025 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:30:50,025 INFO ]: Start difference. First operand 117 states and 216 transitions. Second operand 3 states. [2018-06-22 02:30:50,092 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:50,092 INFO ]: Finished difference Result 152 states and 303 transitions. [2018-06-22 02:30:50,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:30:50,095 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:30:50,095 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:50,101 INFO ]: With dead ends: 152 [2018-06-22 02:30:50,101 INFO ]: Without dead ends: 152 [2018-06-22 02:30:50,101 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-22 02:30:50,101 INFO ]: Start minimizeSevpa. Operand 152 states. [2018-06-22 02:30:50,143 INFO ]: Finished minimizeSevpa. Reduced states from 152 to 122. [2018-06-22 02:30:50,143 INFO ]: Start removeUnreachable. Operand 122 states. [2018-06-22 02:30:50,149 INFO ]: Finished removeUnreachable. Reduced from 122 states to 122 states and 221 transitions. [2018-06-22 02:30:50,150 INFO ]: Start accepts. Automaton has 122 states and 221 transitions. Word has length 12 [2018-06-22 02:30:50,150 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:50,150 INFO ]: Abstraction has 122 states and 221 transitions. [2018-06-22 02:30:50,150 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:30:50,150 INFO ]: Start isEmpty. Operand 122 states and 221 transitions. [2018-06-22 02:30:50,155 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:30:50,155 INFO ]: Found error trace [2018-06-22 02:30:50,155 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:50,155 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:50,156 INFO ]: Analyzing trace with hash 399433318, now seen corresponding path program 1 times [2018-06-22 02:30:50,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:50,156 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:50,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,156 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:50,156 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,169 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:50,235 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:50,236 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:50,236 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:30:50,236 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:30:50,236 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:30:50,236 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:30:50,236 INFO ]: Start difference. First operand 122 states and 221 transitions. Second operand 3 states. [2018-06-22 02:30:50,377 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:50,377 INFO ]: Finished difference Result 184 states and 378 transitions. [2018-06-22 02:30:50,379 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:30:50,379 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:30:50,379 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:50,388 INFO ]: With dead ends: 184 [2018-06-22 02:30:50,388 INFO ]: Without dead ends: 184 [2018-06-22 02:30:50,388 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-22 02:30:50,388 INFO ]: Start minimizeSevpa. Operand 184 states. [2018-06-22 02:30:50,431 INFO ]: Finished minimizeSevpa. Reduced states from 184 to 126. [2018-06-22 02:30:50,431 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-22 02:30:50,433 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 240 transitions. [2018-06-22 02:30:50,433 INFO ]: Start accepts. Automaton has 126 states and 240 transitions. Word has length 12 [2018-06-22 02:30:50,433 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:50,433 INFO ]: Abstraction has 126 states and 240 transitions. [2018-06-22 02:30:50,433 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:30:50,433 INFO ]: Start isEmpty. Operand 126 states and 240 transitions. [2018-06-22 02:30:50,435 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-22 02:30:50,435 INFO ]: Found error trace [2018-06-22 02:30:50,435 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:50,436 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:50,438 INFO ]: Analyzing trace with hash 390198108, now seen corresponding path program 1 times [2018-06-22 02:30:50,438 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:50,438 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:50,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:50,439 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,450 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:50,530 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:30:50,530 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:50,530 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:30:50,530 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:30:50,530 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:30:50,530 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:30:50,530 INFO ]: Start difference. First operand 126 states and 240 transitions. Second operand 3 states. [2018-06-22 02:30:50,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:50,663 INFO ]: Finished difference Result 164 states and 328 transitions. [2018-06-22 02:30:50,664 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:30:50,665 INFO ]: Start accepts. Automaton has 3 states. Word has length 12 [2018-06-22 02:30:50,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:50,668 INFO ]: With dead ends: 164 [2018-06-22 02:30:50,668 INFO ]: Without dead ends: 164 [2018-06-22 02:30:50,670 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-22 02:30:50,670 INFO ]: Start minimizeSevpa. Operand 164 states. [2018-06-22 02:30:50,690 INFO ]: Finished minimizeSevpa. Reduced states from 164 to 124. [2018-06-22 02:30:50,690 INFO ]: Start removeUnreachable. Operand 124 states. [2018-06-22 02:30:50,692 INFO ]: Finished removeUnreachable. Reduced from 124 states to 124 states and 227 transitions. [2018-06-22 02:30:50,692 INFO ]: Start accepts. Automaton has 124 states and 227 transitions. Word has length 12 [2018-06-22 02:30:50,693 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:50,693 INFO ]: Abstraction has 124 states and 227 transitions. [2018-06-22 02:30:50,693 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:30:50,698 INFO ]: Start isEmpty. Operand 124 states and 227 transitions. [2018-06-22 02:30:50,705 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 02:30:50,705 INFO ]: Found error trace [2018-06-22 02:30:50,705 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:50,705 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:50,705 INFO ]: Analyzing trace with hash 1916971085, now seen corresponding path program 1 times [2018-06-22 02:30:50,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:50,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:50,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:50,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,722 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:50,759 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:30:50,759 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:50,759 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-22 02:30:50,773 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:50,789 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:50,797 INFO ]: Computing forward predicates... [2018-06-22 02:30:50,827 INFO ]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 02:30:50,852 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:30:50,852 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-22 02:30:50,852 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:30:50,853 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:30:50,853 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:30:50,853 INFO ]: Start difference. First operand 124 states and 227 transitions. Second operand 3 states. [2018-06-22 02:30:50,880 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:50,880 INFO ]: Finished difference Result 124 states and 222 transitions. [2018-06-22 02:30:50,882 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:30:50,882 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-22 02:30:50,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:50,884 INFO ]: With dead ends: 124 [2018-06-22 02:30:50,884 INFO ]: Without dead ends: 119 [2018-06-22 02:30:50,885 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 22 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-22 02:30:50,885 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-22 02:30:50,895 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-06-22 02:30:50,895 INFO ]: Start removeUnreachable. Operand 119 states. [2018-06-22 02:30:50,896 INFO ]: Finished removeUnreachable. Reduced from 119 states to 119 states and 217 transitions. [2018-06-22 02:30:50,897 INFO ]: Start accepts. Automaton has 119 states and 217 transitions. Word has length 21 [2018-06-22 02:30:50,897 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:50,897 INFO ]: Abstraction has 119 states and 217 transitions. [2018-06-22 02:30:50,897 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:30:50,897 INFO ]: Start isEmpty. Operand 119 states and 217 transitions. [2018-06-22 02:30:50,900 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-22 02:30:50,900 INFO ]: Found error trace [2018-06-22 02:30:50,900 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:50,900 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:50,900 INFO ]: Analyzing trace with hash -2133368700, now seen corresponding path program 1 times [2018-06-22 02:30:50,900 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:50,900 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:50,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:50,901 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:50,913 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:51,124 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 02:30:51,124 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:51,124 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 02:30:51,124 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:30:51,125 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:30:51,125 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:51,125 INFO ]: Start difference. First operand 119 states and 217 transitions. Second operand 5 states. [2018-06-22 02:30:51,669 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:51,669 INFO ]: Finished difference Result 186 states and 394 transitions. [2018-06-22 02:30:51,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:51,669 INFO ]: Start accepts. Automaton has 5 states. Word has length 22 [2018-06-22 02:30:51,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:51,673 INFO ]: With dead ends: 186 [2018-06-22 02:30:51,673 INFO ]: Without dead ends: 186 [2018-06-22 02:30:51,674 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:30:51,674 INFO ]: Start minimizeSevpa. Operand 186 states. [2018-06-22 02:30:51,688 INFO ]: Finished minimizeSevpa. Reduced states from 186 to 139. [2018-06-22 02:30:51,688 INFO ]: Start removeUnreachable. Operand 139 states. [2018-06-22 02:30:51,690 INFO ]: Finished removeUnreachable. Reduced from 139 states to 139 states and 244 transitions. [2018-06-22 02:30:51,690 INFO ]: Start accepts. Automaton has 139 states and 244 transitions. Word has length 22 [2018-06-22 02:30:51,690 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:51,690 INFO ]: Abstraction has 139 states and 244 transitions. [2018-06-22 02:30:51,690 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:30:51,690 INFO ]: Start isEmpty. Operand 139 states and 244 transitions. [2018-06-22 02:30:51,695 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:30:51,695 INFO ]: Found error trace [2018-06-22 02:30:51,695 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:51,695 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:51,696 INFO ]: Analyzing trace with hash 1404851399, now seen corresponding path program 1 times [2018-06-22 02:30:51,696 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:51,696 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:51,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:51,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:51,697 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:51,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:51,892 INFO ]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:30:51,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:51,893 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-22 02:30:51,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:51,929 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:51,932 INFO ]: Computing forward predicates... [2018-06-22 02:30:52,180 INFO ]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 02:30:52,207 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:52,207 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 02:30:52,208 INFO ]: Interpolant automaton has 10 states [2018-06-22 02:30:52,208 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 02:30:52,208 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 02:30:52,208 INFO ]: Start difference. First operand 139 states and 244 transitions. Second operand 10 states. [2018-06-22 02:30:53,877 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:53,877 INFO ]: Finished difference Result 299 states and 685 transitions. [2018-06-22 02:30:53,877 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 02:30:53,877 INFO ]: Start accepts. Automaton has 10 states. Word has length 23 [2018-06-22 02:30:53,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:53,881 INFO ]: With dead ends: 299 [2018-06-22 02:30:53,881 INFO ]: Without dead ends: 235 [2018-06-22 02:30:53,882 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-06-22 02:30:53,882 INFO ]: Start minimizeSevpa. Operand 235 states. [2018-06-22 02:30:53,899 INFO ]: Finished minimizeSevpa. Reduced states from 235 to 165. [2018-06-22 02:30:53,899 INFO ]: Start removeUnreachable. Operand 165 states. [2018-06-22 02:30:53,902 INFO ]: Finished removeUnreachable. Reduced from 165 states to 165 states and 302 transitions. [2018-06-22 02:30:53,902 INFO ]: Start accepts. Automaton has 165 states and 302 transitions. Word has length 23 [2018-06-22 02:30:53,902 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:53,902 INFO ]: Abstraction has 165 states and 302 transitions. [2018-06-22 02:30:53,902 INFO ]: Interpolant automaton has 10 states. [2018-06-22 02:30:53,903 INFO ]: Start isEmpty. Operand 165 states and 302 transitions. [2018-06-22 02:30:53,906 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-22 02:30:53,906 INFO ]: Found error trace [2018-06-22 02:30:53,906 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:53,906 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:53,906 INFO ]: Analyzing trace with hash -1995440451, now seen corresponding path program 1 times [2018-06-22 02:30:53,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:53,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:53,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:53,907 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:53,907 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:53,923 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:53,948 INFO ]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 02:30:53,948 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:53,948 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:30:53,948 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:30:53,948 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:30:53,948 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:30:53,949 INFO ]: Start difference. First operand 165 states and 302 transitions. Second operand 3 states. [2018-06-22 02:30:53,977 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:53,977 INFO ]: Finished difference Result 166 states and 295 transitions. [2018-06-22 02:30:53,978 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:30:53,978 INFO ]: Start accepts. Automaton has 3 states. Word has length 23 [2018-06-22 02:30:53,978 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:53,981 INFO ]: With dead ends: 166 [2018-06-22 02:30:53,981 INFO ]: Without dead ends: 158 [2018-06-22 02:30:53,981 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-22 02:30:53,981 INFO ]: Start minimizeSevpa. Operand 158 states. [2018-06-22 02:30:53,989 INFO ]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-06-22 02:30:53,989 INFO ]: Start removeUnreachable. Operand 158 states. [2018-06-22 02:30:53,991 INFO ]: Finished removeUnreachable. Reduced from 158 states to 158 states and 275 transitions. [2018-06-22 02:30:53,991 INFO ]: Start accepts. Automaton has 158 states and 275 transitions. Word has length 23 [2018-06-22 02:30:53,991 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:53,991 INFO ]: Abstraction has 158 states and 275 transitions. [2018-06-22 02:30:53,991 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:30:53,991 INFO ]: Start isEmpty. Operand 158 states and 275 transitions. [2018-06-22 02:30:53,995 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-22 02:30:53,995 INFO ]: Found error trace [2018-06-22 02:30:53,995 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:53,995 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:53,995 INFO ]: Analyzing trace with hash -36638142, now seen corresponding path program 1 times [2018-06-22 02:30:53,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:53,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:53,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:53,996 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:53,996 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:54,006 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:54,076 INFO ]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 02:30:54,076 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:54,076 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:30:54,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:54,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:54,105 INFO ]: Computing forward predicates... [2018-06-22 02:30:54,111 INFO ]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 02:30:54,133 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:30:54,133 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-06-22 02:30:54,134 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:30:54,134 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:30:54,134 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:54,134 INFO ]: Start difference. First operand 158 states and 275 transitions. Second operand 5 states. [2018-06-22 02:30:54,209 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:54,210 INFO ]: Finished difference Result 193 states and 373 transitions. [2018-06-22 02:30:54,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 02:30:54,210 INFO ]: Start accepts. Automaton has 5 states. Word has length 31 [2018-06-22 02:30:54,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:54,212 INFO ]: With dead ends: 193 [2018-06-22 02:30:54,212 INFO ]: Without dead ends: 151 [2018-06-22 02:30:54,212 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:30:54,212 INFO ]: Start minimizeSevpa. Operand 151 states. [2018-06-22 02:30:54,225 INFO ]: Finished minimizeSevpa. Reduced states from 151 to 114. [2018-06-22 02:30:54,226 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-22 02:30:54,227 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 187 transitions. [2018-06-22 02:30:54,227 INFO ]: Start accepts. Automaton has 114 states and 187 transitions. Word has length 31 [2018-06-22 02:30:54,227 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:54,227 INFO ]: Abstraction has 114 states and 187 transitions. [2018-06-22 02:30:54,227 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:30:54,227 INFO ]: Start isEmpty. Operand 114 states and 187 transitions. [2018-06-22 02:30:54,233 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-22 02:30:54,233 INFO ]: Found error trace [2018-06-22 02:30:54,234 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:54,235 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:54,235 INFO ]: Analyzing trace with hash 692508414, now seen corresponding path program 1 times [2018-06-22 02:30:54,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:54,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:54,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:54,236 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:54,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:54,254 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:54,332 INFO ]: Checked inductivity of 19 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 02:30:54,332 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:30:54,332 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 02:30:54,332 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:30:54,332 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:30:54,332 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:30:54,333 INFO ]: Start difference. First operand 114 states and 187 transitions. Second operand 4 states. [2018-06-22 02:30:54,406 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:54,406 INFO ]: Finished difference Result 118 states and 191 transitions. [2018-06-22 02:30:54,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 02:30:54,407 INFO ]: Start accepts. Automaton has 4 states. Word has length 32 [2018-06-22 02:30:54,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:54,408 INFO ]: With dead ends: 118 [2018-06-22 02:30:54,408 INFO ]: Without dead ends: 102 [2018-06-22 02:30:54,408 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:30:54,408 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 02:30:54,413 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-06-22 02:30:54,413 INFO ]: Start removeUnreachable. Operand 102 states. [2018-06-22 02:30:54,414 INFO ]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2018-06-22 02:30:54,415 INFO ]: Start accepts. Automaton has 102 states and 158 transitions. Word has length 32 [2018-06-22 02:30:54,415 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:54,415 INFO ]: Abstraction has 102 states and 158 transitions. [2018-06-22 02:30:54,415 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:30:54,415 INFO ]: Start isEmpty. Operand 102 states and 158 transitions. [2018-06-22 02:30:54,417 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 02:30:54,417 INFO ]: Found error trace [2018-06-22 02:30:54,418 INFO ]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:54,418 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:54,418 INFO ]: Analyzing trace with hash 1447796773, now seen corresponding path program 1 times [2018-06-22 02:30:54,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:54,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:54,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:54,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:54,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:54,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:54,890 INFO ]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 02:30:54,890 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:54,890 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:30:54,906 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:54,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:54,939 INFO ]: Computing forward predicates... [2018-06-22 02:30:55,669 INFO ]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 02:30:55,690 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:30:55,690 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-06-22 02:30:55,690 INFO ]: Interpolant automaton has 17 states [2018-06-22 02:30:55,690 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 02:30:55,690 INFO ]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-06-22 02:30:55,690 INFO ]: Start difference. First operand 102 states and 158 transitions. Second operand 17 states. [2018-06-22 02:30:58,935 WARN ]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 02:30:59,753 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:30:59,753 INFO ]: Finished difference Result 315 states and 646 transitions. [2018-06-22 02:30:59,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 02:30:59,753 INFO ]: Start accepts. Automaton has 17 states. Word has length 33 [2018-06-22 02:30:59,754 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:30:59,754 INFO ]: With dead ends: 315 [2018-06-22 02:30:59,754 INFO ]: Without dead ends: 80 [2018-06-22 02:30:59,755 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=389, Invalid=2161, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 02:30:59,756 INFO ]: Start minimizeSevpa. Operand 80 states. [2018-06-22 02:30:59,758 INFO ]: Finished minimizeSevpa. Reduced states from 80 to 64. [2018-06-22 02:30:59,758 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 02:30:59,758 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-06-22 02:30:59,758 INFO ]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 33 [2018-06-22 02:30:59,759 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:30:59,759 INFO ]: Abstraction has 64 states and 84 transitions. [2018-06-22 02:30:59,759 INFO ]: Interpolant automaton has 17 states. [2018-06-22 02:30:59,759 INFO ]: Start isEmpty. Operand 64 states and 84 transitions. [2018-06-22 02:30:59,759 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 02:30:59,759 INFO ]: Found error trace [2018-06-22 02:30:59,760 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-22 02:30:59,760 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:30:59,760 INFO ]: Analyzing trace with hash -159300542, now seen corresponding path program 2 times [2018-06-22 02:30:59,760 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:30:59,760 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:30:59,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:59,760 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:30:59,760 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:30:59,779 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:59,905 INFO ]: Checked inductivity of 29 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 02:30:59,905 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:30:59,905 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 02:30:59,920 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:30:59,940 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:30:59,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:30:59,943 INFO ]: Computing forward predicates... [2018-06-22 02:31:00,039 INFO ]: Checked inductivity of 29 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 02:31:00,059 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:00,059 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-22 02:31:00,059 INFO ]: Interpolant automaton has 15 states [2018-06-22 02:31:00,060 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 02:31:00,060 INFO ]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-06-22 02:31:00,060 INFO ]: Start difference. First operand 64 states and 84 transitions. Second operand 15 states. [2018-06-22 02:31:00,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:00,318 INFO ]: Finished difference Result 89 states and 123 transitions. [2018-06-22 02:31:00,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 02:31:00,318 INFO ]: Start accepts. Automaton has 15 states. Word has length 34 [2018-06-22 02:31:00,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:00,318 INFO ]: With dead ends: 89 [2018-06-22 02:31:00,318 INFO ]: Without dead ends: 89 [2018-06-22 02:31:00,319 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:31:00,319 INFO ]: Start minimizeSevpa. Operand 89 states. [2018-06-22 02:31:00,322 INFO ]: Finished minimizeSevpa. Reduced states from 89 to 68. [2018-06-22 02:31:00,322 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 02:31:00,322 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2018-06-22 02:31:00,323 INFO ]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 34 [2018-06-22 02:31:00,323 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:00,323 INFO ]: Abstraction has 68 states and 90 transitions. [2018-06-22 02:31:00,323 INFO ]: Interpolant automaton has 15 states. [2018-06-22 02:31:00,323 INFO ]: Start isEmpty. Operand 68 states and 90 transitions. [2018-06-22 02:31:00,324 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 02:31:00,324 INFO ]: Found error trace [2018-06-22 02:31:00,324 INFO ]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:00,324 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:00,324 INFO ]: Analyzing trace with hash 1419968608, now seen corresponding path program 2 times [2018-06-22 02:31:00,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:00,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:00,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:00,325 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:31:00,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:00,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:00,603 INFO ]: Checked inductivity of 47 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 02:31:00,603 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:00,603 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:31:00,621 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 02:31:00,641 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 02:31:00,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:00,645 INFO ]: Computing forward predicates... [2018-06-22 02:31:01,141 INFO ]: Checked inductivity of 47 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 02:31:01,175 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:01,175 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2018-06-22 02:31:01,175 INFO ]: Interpolant automaton has 23 states [2018-06-22 02:31:01,175 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 02:31:01,175 INFO ]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-06-22 02:31:01,176 INFO ]: Start difference. First operand 68 states and 90 transitions. Second operand 23 states. [2018-06-22 02:31:01,669 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-06-22 02:31:02,814 WARN ]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2018-06-22 02:31:03,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:03,606 INFO ]: Finished difference Result 120 states and 171 transitions. [2018-06-22 02:31:03,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 02:31:03,606 INFO ]: Start accepts. Automaton has 23 states. Word has length 44 [2018-06-22 02:31:03,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:03,607 INFO ]: With dead ends: 120 [2018-06-22 02:31:03,607 INFO ]: Without dead ends: 54 [2018-06-22 02:31:03,607 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=300, Invalid=1680, Unknown=0, NotChecked=0, Total=1980 [2018-06-22 02:31:03,608 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 02:31:03,610 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-06-22 02:31:03,610 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 02:31:03,610 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-06-22 02:31:03,610 INFO ]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 44 [2018-06-22 02:31:03,610 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:03,610 INFO ]: Abstraction has 50 states and 60 transitions. [2018-06-22 02:31:03,610 INFO ]: Interpolant automaton has 23 states. [2018-06-22 02:31:03,610 INFO ]: Start isEmpty. Operand 50 states and 60 transitions. [2018-06-22 02:31:03,611 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 02:31:03,611 INFO ]: Found error trace [2018-06-22 02:31:03,611 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:03,611 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:03,611 INFO ]: Analyzing trace with hash -1954985885, now seen corresponding path program 3 times [2018-06-22 02:31:03,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:03,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:03,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:03,612 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:31:03,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:03,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:03,913 INFO ]: Checked inductivity of 60 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 02:31:03,913 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:03,913 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:31:03,920 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 02:31:03,945 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 02:31:03,945 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:03,949 INFO ]: Computing forward predicates... [2018-06-22 02:31:07,302 INFO ]: Checked inductivity of 60 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 02:31:07,321 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:07,321 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-06-22 02:31:07,321 INFO ]: Interpolant automaton has 25 states [2018-06-22 02:31:07,321 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 02:31:07,321 INFO ]: CoverageRelationStatistics Valid=55, Invalid=541, Unknown=4, NotChecked=0, Total=600 [2018-06-22 02:31:07,321 INFO ]: Start difference. First operand 50 states and 60 transitions. Second operand 25 states. [2018-06-22 02:31:08,181 WARN ]: Spent 839.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-06-22 02:31:10,773 WARN ]: Spent 2.47 s on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-06-22 02:31:14,866 WARN ]: Spent 4.05 s on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2018-06-22 02:31:15,653 WARN ]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 02:31:20,307 WARN ]: Spent 847.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-06-22 02:31:22,363 WARN ]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 63 [2018-06-22 02:31:26,270 WARN ]: Spent 358.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-06-22 02:31:41,203 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:41,203 INFO ]: Finished difference Result 77 states and 97 transitions. [2018-06-22 02:31:41,204 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-22 02:31:41,204 INFO ]: Start accepts. Automaton has 25 states. Word has length 45 [2018-06-22 02:31:41,204 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:41,204 INFO ]: With dead ends: 77 [2018-06-22 02:31:41,204 INFO ]: Without dead ends: 45 [2018-06-22 02:31:41,205 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=368, Invalid=2068, Unknown=14, NotChecked=0, Total=2450 [2018-06-22 02:31:41,205 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-22 02:31:41,207 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-06-22 02:31:41,207 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 02:31:41,207 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-06-22 02:31:41,207 INFO ]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 45 [2018-06-22 02:31:41,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:41,207 INFO ]: Abstraction has 41 states and 49 transitions. [2018-06-22 02:31:41,207 INFO ]: Interpolant automaton has 25 states. [2018-06-22 02:31:41,207 INFO ]: Start isEmpty. Operand 41 states and 49 transitions. [2018-06-22 02:31:41,208 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 02:31:41,208 INFO ]: Found error trace [2018-06-22 02:31:41,213 INFO ]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:31:41,213 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:31:41,213 INFO ]: Analyzing trace with hash 661236253, now seen corresponding path program 1 times [2018-06-22 02:31:41,213 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:31:41,213 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:31:41,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:41,214 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 02:31:41,214 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:31:41,233 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:41,614 INFO ]: Checked inductivity of 107 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 02:31:41,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:31:41,614 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:31:41,620 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:31:41,646 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:31:41,651 INFO ]: Computing forward predicates... [2018-06-22 02:31:41,893 INFO ]: Checked inductivity of 107 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-06-22 02:31:41,914 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:31:41,914 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2018-06-22 02:31:41,914 INFO ]: Interpolant automaton has 25 states [2018-06-22 02:31:41,914 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 02:31:41,914 INFO ]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-06-22 02:31:41,915 INFO ]: Start difference. First operand 41 states and 49 transitions. Second operand 25 states. [2018-06-22 02:31:42,524 WARN ]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2018-06-22 02:31:42,883 WARN ]: Spent 324.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2018-06-22 02:31:43,044 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2018-06-22 02:31:43,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:31:43,608 INFO ]: Finished difference Result 39 states and 46 transitions. [2018-06-22 02:31:43,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 02:31:43,609 INFO ]: Start accepts. Automaton has 25 states. Word has length 57 [2018-06-22 02:31:43,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:31:43,609 INFO ]: With dead ends: 39 [2018-06-22 02:31:43,609 INFO ]: Without dead ends: 0 [2018-06-22 02:31:43,610 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=254, Invalid=1306, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 02:31:43,610 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 02:31:43,610 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 02:31:43,610 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 02:31:43,610 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 02:31:43,610 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-06-22 02:31:43,610 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:31:43,610 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 02:31:43,610 INFO ]: Interpolant automaton has 25 states. [2018-06-22 02:31:43,610 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 02:31:43,610 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 02:31:43,615 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:31:43 BoogieIcfgContainer [2018-06-22 02:31:43,615 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:31:43,618 INFO ]: Toolchain (without parser) took 56476.01 ms. Allocated memory was 309.3 MB in the beginning and 477.6 MB in the end (delta: 168.3 MB). Free memory was 262.7 MB in the beginning and 412.7 MB in the end (delta: -150.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:43,619 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:31:43,619 INFO ]: ChcToBoogie took 84.36 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:43,619 INFO ]: Boogie Preprocessor took 50.10 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:43,620 INFO ]: RCFGBuilder took 575.09 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 243.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:31:43,620 INFO ]: TraceAbstraction took 55755.77 ms. Allocated memory was 309.3 MB in the beginning and 477.6 MB in the end (delta: 168.3 MB). Free memory was 243.7 MB in the beginning and 412.8 MB in the end (delta: -169.0 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:31:43,628 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 84.36 ms. Allocated memory is still 309.3 MB. Free memory was 262.7 MB in the beginning and 260.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 50.10 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 258.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 575.09 ms. Allocated memory is still 309.3 MB. Free memory was 258.8 MB in the beginning and 243.7 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55755.77 ms. Allocated memory was 309.3 MB in the beginning and 477.6 MB in the end (delta: 168.3 MB). Free memory was 243.7 MB in the beginning and 412.8 MB in the end (delta: -169.0 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. SAFE Result, 55.6s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 46.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 956 SDtfs, 1399 SDslu, 2393 SDs, 0 SdLazy, 4403 SolverSat, 972 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 548 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 30.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=10, 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.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 327 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 726 NumberOfCodeBlocks, 726 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 700 ConstructedInterpolants, 24 QuantifiedInterpolants, 179736 SizeOfPredicates, 122 NumberOfNonLiveVariables, 1266 ConjunctsInSsa, 380 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 482/630 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit1unrolled.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-31-43-645.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__limit1unrolled.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-31-43-645.csv Received shutdown request...