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_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:17:35,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:17:35,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:17:35,671 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:17:35,672 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:17:35,673 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:17:35,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:17:35,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:17:35,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:17:35,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:17:35,680 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:17:35,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:17:35,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:17:35,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:17:35,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:17:35,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:17:35,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:17:35,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:17:35,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:17:35,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:17:35,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:17:35,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:17:35,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:17:35,694 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:17:35,695 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:17:35,696 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:17:35,697 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:17:35,698 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:17:35,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:17:35,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:17:35,700 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:17:35,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:17:35,701 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:17:35,702 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:17:35,702 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:17:35,703 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:17:35,716 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:17:35,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:17:35,717 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:17:35,717 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:17:35,718 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:17:35,718 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:17:35,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:17:35,719 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:17:35,719 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:17:35,719 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:17:35,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:17:35,719 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:17:35,720 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:17:35,720 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:17:35,720 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:17:35,720 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:17:35,721 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:17:35,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:17:35,721 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:17:35,722 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:17:35,723 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:17:35,774 INFO ]: Repository-Root is: /tmp [2018-06-22 11:17:35,791 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:17:35,798 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:17:35,799 INFO ]: Initializing SmtParser... [2018-06-22 11:17:35,799 INFO ]: SmtParser initialized [2018-06-22 11:17:35,800 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 [2018-06-22 11:17:35,802 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 11:17:35,891 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 unknown [2018-06-22 11:17:36,163 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 [2018-06-22 11:17:36,167 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:17:36,174 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:17:36,175 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:17:36,175 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:17:36,175 INFO ]: ChcToBoogie initialized [2018-06-22 11:17:36,178 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:36" (1/1) ... [2018-06-22 11:17:36,233 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36 Unit [2018-06-22 11:17:36,233 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:17:36,233 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:17:36,233 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:17:36,233 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:17:36,257 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36" (1/1) ... [2018-06-22 11:17:36,257 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36" (1/1) ... [2018-06-22 11:17:36,269 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36" (1/1) ... [2018-06-22 11:17:36,279 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36" (1/1) ... [2018-06-22 11:17:36,289 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36" (1/1) ... [2018-06-22 11:17:36,291 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36" (1/1) ... [2018-06-22 11:17:36,293 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36" (1/1) ... [2018-06-22 11:17:36,295 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:17:36,296 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:17:36,296 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:17:36,296 INFO ]: RCFGBuilder initialized [2018-06-22 11:17:36,297 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36" (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 11:17:36,326 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:17:36,326 INFO ]: Found specification of procedure False [2018-06-22 11:17:36,326 INFO ]: Found implementation of procedure False [2018-06-22 11:17:36,326 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:17:36,326 INFO ]: Found specification of procedure INV1 [2018-06-22 11:17:36,326 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:17:36,326 INFO ]: Specification and implementation of procedure INV3 given in one single declaration [2018-06-22 11:17:36,326 INFO ]: Found specification of procedure INV3 [2018-06-22 11:17:36,326 INFO ]: Found implementation of procedure INV3 [2018-06-22 11:17:36,326 INFO ]: Specification and implementation of procedure INV2 given in one single declaration [2018-06-22 11:17:36,326 INFO ]: Found specification of procedure INV2 [2018-06-22 11:17:36,326 INFO ]: Found implementation of procedure INV2 [2018-06-22 11:17:36,326 INFO ]: Specification and implementation of procedure INV4 given in one single declaration [2018-06-22 11:17:36,327 INFO ]: Found specification of procedure INV4 [2018-06-22 11:17:36,327 INFO ]: Found implementation of procedure INV4 [2018-06-22 11:17:36,327 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:17:36,327 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:17:36,327 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 11:17:36,788 INFO ]: Using library mode [2018-06-22 11:17:36,788 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:36 BoogieIcfgContainer [2018-06-22 11:17:36,788 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:17:36,790 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:17:36,790 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:17:36,793 INFO ]: TraceAbstraction initialized [2018-06-22 11:17:36,793 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:36" (1/3) ... [2018-06-22 11:17:36,794 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a25a6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:17:36, skipping insertion in model container [2018-06-22 11:17:36,794 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:36" (2/3) ... [2018-06-22 11:17:36,794 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a25a6a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:17:36, skipping insertion in model container [2018-06-22 11:17:36,794 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:36" (3/3) ... [2018-06-22 11:17:36,796 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:17:36,805 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:17:36,813 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:17:36,863 INFO ]: Using default assertion order modulation [2018-06-22 11:17:36,863 INFO ]: Interprodecural is true [2018-06-22 11:17:36,863 INFO ]: Hoare is false [2018-06-22 11:17:36,863 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:17:36,863 INFO ]: Backedges is TWOTRACK [2018-06-22 11:17:36,863 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:17:36,863 INFO ]: Difference is false [2018-06-22 11:17:36,864 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:17:36,864 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:17:36,879 INFO ]: Start isEmpty. Operand 36 states. [2018-06-22 11:17:36,897 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:36,897 INFO ]: Found error trace [2018-06-22 11:17:36,899 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:36,900 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:36,905 INFO ]: Analyzing trace with hash -45343328, now seen corresponding path program 1 times [2018-06-22 11:17:36,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:36,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:36,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:36,945 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:36,945 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:36,962 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:36,987 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:36,989 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:36,989 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:17:36,991 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:17:37,001 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:17:37,002 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:37,004 INFO ]: Start difference. First operand 36 states. Second operand 2 states. [2018-06-22 11:17:37,025 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:37,025 INFO ]: Finished difference Result 22 states and 32 transitions. [2018-06-22 11:17:37,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:17:37,027 INFO ]: Start accepts. Automaton has 2 states. Word has length 9 [2018-06-22 11:17:37,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:37,041 INFO ]: With dead ends: 22 [2018-06-22 11:17:37,041 INFO ]: Without dead ends: 20 [2018-06-22 11:17:37,043 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:37,058 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:17:37,080 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 11:17:37,082 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:17:37,083 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2018-06-22 11:17:37,084 INFO ]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 9 [2018-06-22 11:17:37,084 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:37,084 INFO ]: Abstraction has 20 states and 32 transitions. [2018-06-22 11:17:37,084 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:17:37,084 INFO ]: Start isEmpty. Operand 20 states and 32 transitions. [2018-06-22 11:17:37,086 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:37,086 INFO ]: Found error trace [2018-06-22 11:17:37,086 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:37,086 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:37,087 INFO ]: Analyzing trace with hash 942497907, now seen corresponding path program 1 times [2018-06-22 11:17:37,087 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:37,087 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:37,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:37,088 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:37,088 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:37,113 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:37,230 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:37,230 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:37,230 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:37,232 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:37,232 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:37,232 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:37,232 INFO ]: Start difference. First operand 20 states and 32 transitions. Second operand 4 states. [2018-06-22 11:17:37,281 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:37,281 INFO ]: Finished difference Result 22 states and 36 transitions. [2018-06-22 11:17:37,281 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:37,281 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:37,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:37,282 INFO ]: With dead ends: 22 [2018-06-22 11:17:37,282 INFO ]: Without dead ends: 22 [2018-06-22 11:17:37,283 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:37,283 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:17:37,291 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-22 11:17:37,291 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:17:37,292 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2018-06-22 11:17:37,292 INFO ]: Start accepts. Automaton has 22 states and 36 transitions. Word has length 9 [2018-06-22 11:17:37,293 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:37,293 INFO ]: Abstraction has 22 states and 36 transitions. [2018-06-22 11:17:37,293 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:37,293 INFO ]: Start isEmpty. Operand 22 states and 36 transitions. [2018-06-22 11:17:37,294 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:37,294 INFO ]: Found error trace [2018-06-22 11:17:37,294 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:37,294 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:37,294 INFO ]: Analyzing trace with hash -508452200, now seen corresponding path program 1 times [2018-06-22 11:17:37,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:37,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:37,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:37,295 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:37,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:37,305 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:37,362 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:37,362 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:37,362 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:37,362 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:37,362 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:37,363 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:37,363 INFO ]: Start difference. First operand 22 states and 36 transitions. Second operand 4 states. [2018-06-22 11:17:37,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:37,580 INFO ]: Finished difference Result 24 states and 40 transitions. [2018-06-22 11:17:37,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:37,580 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:37,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:37,581 INFO ]: With dead ends: 24 [2018-06-22 11:17:37,581 INFO ]: Without dead ends: 24 [2018-06-22 11:17:37,582 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:37,582 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:17:37,588 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-22 11:17:37,588 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:17:37,589 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 40 transitions. [2018-06-22 11:17:37,589 INFO ]: Start accepts. Automaton has 24 states and 40 transitions. Word has length 9 [2018-06-22 11:17:37,589 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:37,589 INFO ]: Abstraction has 24 states and 40 transitions. [2018-06-22 11:17:37,589 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:37,589 INFO ]: Start isEmpty. Operand 24 states and 40 transitions. [2018-06-22 11:17:37,592 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:37,592 INFO ]: Found error trace [2018-06-22 11:17:37,592 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:37,592 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:37,592 INFO ]: Analyzing trace with hash -886967115, now seen corresponding path program 1 times [2018-06-22 11:17:37,592 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:37,592 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:37,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:37,594 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:37,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:37,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:37,892 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:37,892 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:37,892 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 11:17:37,901 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:37,944 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:37,952 INFO ]: Computing forward predicates... [2018-06-22 11:17:38,386 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:38,422 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:38,422 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:17:38,423 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:17:38,423 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:17:38,423 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:17:38,423 INFO ]: Start difference. First operand 24 states and 40 transitions. Second operand 8 states. [2018-06-22 11:17:38,780 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:38,780 INFO ]: Finished difference Result 30 states and 53 transitions. [2018-06-22 11:17:38,781 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:38,781 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:17:38,781 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:38,783 INFO ]: With dead ends: 30 [2018-06-22 11:17:38,783 INFO ]: Without dead ends: 30 [2018-06-22 11:17:38,784 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:17:38,784 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:17:38,790 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-22 11:17:38,790 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:17:38,791 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2018-06-22 11:17:38,791 INFO ]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 13 [2018-06-22 11:17:38,792 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:38,792 INFO ]: Abstraction has 28 states and 48 transitions. [2018-06-22 11:17:38,792 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:17:38,792 INFO ]: Start isEmpty. Operand 28 states and 48 transitions. [2018-06-22 11:17:38,793 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:38,793 INFO ]: Found error trace [2018-06-22 11:17:38,793 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:38,793 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:38,793 INFO ]: Analyzing trace with hash -1034743272, now seen corresponding path program 1 times [2018-06-22 11:17:38,793 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:38,793 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:38,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:38,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:38,794 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:38,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:38,962 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:38,962 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:38,962 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 11:17:38,969 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:38,995 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:38,998 INFO ]: Computing forward predicates... [2018-06-22 11:17:39,355 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:17:39,452 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:39,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:39,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:17:39,476 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:17:39,476 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:17:39,476 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:17:39,476 INFO ]: Start difference. First operand 28 states and 48 transitions. Second operand 10 states. [2018-06-22 11:17:39,905 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:39,905 INFO ]: Finished difference Result 36 states and 63 transitions. [2018-06-22 11:17:39,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:17:39,906 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:17:39,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:39,909 INFO ]: With dead ends: 36 [2018-06-22 11:17:39,909 INFO ]: Without dead ends: 36 [2018-06-22 11:17:39,909 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:17:39,909 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:17:39,920 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-22 11:17:39,920 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:17:39,921 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2018-06-22 11:17:39,921 INFO ]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 13 [2018-06-22 11:17:39,921 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:39,921 INFO ]: Abstraction has 28 states and 48 transitions. [2018-06-22 11:17:39,921 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:17:39,921 INFO ]: Start isEmpty. Operand 28 states and 48 transitions. [2018-06-22 11:17:39,924 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:39,924 INFO ]: Found error trace [2018-06-22 11:17:39,924 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:39,924 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:39,925 INFO ]: Analyzing trace with hash -130497508, now seen corresponding path program 1 times [2018-06-22 11:17:39,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:39,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:39,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:39,925 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:39,925 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:39,935 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:40,055 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:40,055 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:40,055 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 11:17:40,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:40,072 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:40,073 INFO ]: Computing forward predicates... [2018-06-22 11:17:40,105 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:40,125 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:40,125 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:17:40,126 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:17:40,126 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:17:40,126 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:17:40,126 INFO ]: Start difference. First operand 28 states and 48 transitions. Second operand 8 states. [2018-06-22 11:17:40,269 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:40,269 INFO ]: Finished difference Result 34 states and 61 transitions. [2018-06-22 11:17:40,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:40,269 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:17:40,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:40,270 INFO ]: With dead ends: 34 [2018-06-22 11:17:40,270 INFO ]: Without dead ends: 34 [2018-06-22 11:17:40,270 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:17:40,270 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:17:40,278 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-06-22 11:17:40,278 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:17:40,279 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 56 transitions. [2018-06-22 11:17:40,279 INFO ]: Start accepts. Automaton has 32 states and 56 transitions. Word has length 13 [2018-06-22 11:17:40,280 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:40,280 INFO ]: Abstraction has 32 states and 56 transitions. [2018-06-22 11:17:40,280 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:17:40,280 INFO ]: Start isEmpty. Operand 32 states and 56 transitions. [2018-06-22 11:17:40,281 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:40,281 INFO ]: Found error trace [2018-06-22 11:17:40,281 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:40,281 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:40,281 INFO ]: Analyzing trace with hash 360004198, now seen corresponding path program 1 times [2018-06-22 11:17:40,281 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:40,281 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:40,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:40,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:40,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:40,290 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:40,345 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:40,345 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:40,345 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:40,345 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:40,345 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:40,345 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:40,345 INFO ]: Start difference. First operand 32 states and 56 transitions. Second operand 4 states. [2018-06-22 11:17:40,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:40,461 INFO ]: Finished difference Result 43 states and 79 transitions. [2018-06-22 11:17:40,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:17:40,462 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:40,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:40,464 INFO ]: With dead ends: 43 [2018-06-22 11:17:40,464 INFO ]: Without dead ends: 43 [2018-06-22 11:17:40,464 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 11:17:40,464 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:17:40,473 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-06-22 11:17:40,473 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:17:40,475 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2018-06-22 11:17:40,475 INFO ]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 13 [2018-06-22 11:17:40,475 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:40,475 INFO ]: Abstraction has 39 states and 71 transitions. [2018-06-22 11:17:40,475 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:40,475 INFO ]: Start isEmpty. Operand 39 states and 71 transitions. [2018-06-22 11:17:40,476 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:40,476 INFO ]: Found error trace [2018-06-22 11:17:40,476 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:40,476 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:40,477 INFO ]: Analyzing trace with hash -591920125, now seen corresponding path program 1 times [2018-06-22 11:17:40,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:40,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:40,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:40,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:40,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:40,489 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:40,544 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:40,544 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:40,544 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:40,544 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:40,544 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:40,544 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:40,544 INFO ]: Start difference. First operand 39 states and 71 transitions. Second operand 4 states. [2018-06-22 11:17:40,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:40,678 INFO ]: Finished difference Result 56 states and 104 transitions. [2018-06-22 11:17:40,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:17:40,679 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:40,679 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:40,680 INFO ]: With dead ends: 56 [2018-06-22 11:17:40,680 INFO ]: Without dead ends: 56 [2018-06-22 11:17:40,680 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 11:17:40,680 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:17:40,695 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-06-22 11:17:40,696 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:17:40,700 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2018-06-22 11:17:40,700 INFO ]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 17 [2018-06-22 11:17:40,701 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:40,701 INFO ]: Abstraction has 48 states and 89 transitions. [2018-06-22 11:17:40,701 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:40,701 INFO ]: Start isEmpty. Operand 48 states and 89 transitions. [2018-06-22 11:17:40,702 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:40,702 INFO ]: Found error trace [2018-06-22 11:17:40,703 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:40,703 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:40,703 INFO ]: Analyzing trace with hash 872215543, now seen corresponding path program 2 times [2018-06-22 11:17:40,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:40,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:40,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:40,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:40,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:40,727 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:40,795 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:40,795 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:40,795 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 11:17:40,803 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:40,835 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:40,835 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:40,837 INFO ]: Computing forward predicates... [2018-06-22 11:17:41,119 INFO ]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:41,151 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:41,151 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-22 11:17:41,151 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:17:41,151 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:17:41,151 INFO ]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:17:41,151 INFO ]: Start difference. First operand 48 states and 89 transitions. Second operand 11 states. [2018-06-22 11:17:41,429 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:41,429 INFO ]: Finished difference Result 62 states and 114 transitions. [2018-06-22 11:17:41,429 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:17:41,430 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:17:41,430 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:41,431 INFO ]: With dead ends: 62 [2018-06-22 11:17:41,431 INFO ]: Without dead ends: 62 [2018-06-22 11:17:41,432 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:17:41,432 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:17:41,440 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 48. [2018-06-22 11:17:41,441 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:17:41,441 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 89 transitions. [2018-06-22 11:17:41,442 INFO ]: Start accepts. Automaton has 48 states and 89 transitions. Word has length 17 [2018-06-22 11:17:41,442 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:41,442 INFO ]: Abstraction has 48 states and 89 transitions. [2018-06-22 11:17:41,442 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:17:41,442 INFO ]: Start isEmpty. Operand 48 states and 89 transitions. [2018-06-22 11:17:41,443 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:41,443 INFO ]: Found error trace [2018-06-22 11:17:41,443 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:41,443 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:41,443 INFO ]: Analyzing trace with hash -1376528166, now seen corresponding path program 1 times [2018-06-22 11:17:41,443 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:41,443 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:41,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:41,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:41,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:41,453 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:41,486 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:41,486 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:41,486 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:41,486 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:41,487 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:41,487 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:41,487 INFO ]: Start difference. First operand 48 states and 89 transitions. Second operand 4 states. [2018-06-22 11:17:41,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:41,668 INFO ]: Finished difference Result 52 states and 96 transitions. [2018-06-22 11:17:41,668 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:17:41,668 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:41,668 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:41,669 INFO ]: With dead ends: 52 [2018-06-22 11:17:41,669 INFO ]: Without dead ends: 47 [2018-06-22 11:17:41,669 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 11:17:41,669 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-22 11:17:41,676 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-22 11:17:41,676 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-22 11:17:41,677 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2018-06-22 11:17:41,678 INFO ]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 17 [2018-06-22 11:17:41,678 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:41,678 INFO ]: Abstraction has 43 states and 75 transitions. [2018-06-22 11:17:41,678 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:41,678 INFO ]: Start isEmpty. Operand 43 states and 75 transitions. [2018-06-22 11:17:41,679 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:41,679 INFO ]: Found error trace [2018-06-22 11:17:41,679 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:41,679 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:41,679 INFO ]: Analyzing trace with hash 1586010598, now seen corresponding path program 1 times [2018-06-22 11:17:41,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:41,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:41,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:41,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:41,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:41,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:41,724 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:17:41,724 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:41,724 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:41,724 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:41,724 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:41,724 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:41,724 INFO ]: Start difference. First operand 43 states and 75 transitions. Second operand 4 states. [2018-06-22 11:17:41,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:41,773 INFO ]: Finished difference Result 52 states and 94 transitions. [2018-06-22 11:17:41,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:41,774 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:41,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:41,775 INFO ]: With dead ends: 52 [2018-06-22 11:17:41,775 INFO ]: Without dead ends: 49 [2018-06-22 11:17:41,775 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:41,775 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-22 11:17:41,782 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-22 11:17:41,782 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-22 11:17:41,783 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 89 transitions. [2018-06-22 11:17:41,783 INFO ]: Start accepts. Automaton has 49 states and 89 transitions. Word has length 17 [2018-06-22 11:17:41,783 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:41,783 INFO ]: Abstraction has 49 states and 89 transitions. [2018-06-22 11:17:41,783 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:41,783 INFO ]: Start isEmpty. Operand 49 states and 89 transitions. [2018-06-22 11:17:41,784 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:41,784 INFO ]: Found error trace [2018-06-22 11:17:41,784 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:41,784 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:41,784 INFO ]: Analyzing trace with hash -1655494275, now seen corresponding path program 2 times [2018-06-22 11:17:41,784 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:41,784 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:41,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:41,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:41,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:41,795 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:41,840 INFO ]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:17:41,840 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:41,840 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:41,848 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:41,866 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:41,866 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:41,867 INFO ]: Computing forward predicates... [2018-06-22 11:17:41,974 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:41,994 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:41,994 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-06-22 11:17:41,994 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:17:41,994 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:17:41,994 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:17:41,994 INFO ]: Start difference. First operand 49 states and 89 transitions. Second operand 12 states. [2018-06-22 11:17:42,165 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:42,165 INFO ]: Finished difference Result 71 states and 121 transitions. [2018-06-22 11:17:42,165 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:17:42,165 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:17:42,165 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:42,166 INFO ]: With dead ends: 71 [2018-06-22 11:17:42,166 INFO ]: Without dead ends: 71 [2018-06-22 11:17:42,167 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:17:42,167 INFO ]: Start minimizeSevpa. Operand 71 states. [2018-06-22 11:17:42,175 INFO ]: Finished minimizeSevpa. Reduced states from 71 to 51. [2018-06-22 11:17:42,175 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 11:17:42,176 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2018-06-22 11:17:42,176 INFO ]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 17 [2018-06-22 11:17:42,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:42,176 INFO ]: Abstraction has 51 states and 89 transitions. [2018-06-22 11:17:42,176 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:17:42,176 INFO ]: Start isEmpty. Operand 51 states and 89 transitions. [2018-06-22 11:17:42,177 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:42,177 INFO ]: Found error trace [2018-06-22 11:17:42,177 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:42,177 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:42,177 INFO ]: Analyzing trace with hash -1060504288, now seen corresponding path program 2 times [2018-06-22 11:17:42,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:42,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:42,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:42,178 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:42,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:42,185 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:42,220 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:42,220 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:42,220 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 11:17:42,226 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:42,242 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:42,242 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:42,244 INFO ]: Computing forward predicates... [2018-06-22 11:17:42,269 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:42,288 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:42,288 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:17:42,288 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:17:42,289 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:17:42,289 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:17:42,289 INFO ]: Start difference. First operand 51 states and 89 transitions. Second operand 8 states. [2018-06-22 11:17:42,478 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:42,478 INFO ]: Finished difference Result 62 states and 105 transitions. [2018-06-22 11:17:42,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:17:42,478 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:17:42,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:42,479 INFO ]: With dead ends: 62 [2018-06-22 11:17:42,479 INFO ]: Without dead ends: 57 [2018-06-22 11:17:42,479 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:17:42,479 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-22 11:17:42,488 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-06-22 11:17:42,488 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:17:42,489 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 88 transitions. [2018-06-22 11:17:42,489 INFO ]: Start accepts. Automaton has 53 states and 88 transitions. Word has length 17 [2018-06-22 11:17:42,490 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:42,490 INFO ]: Abstraction has 53 states and 88 transitions. [2018-06-22 11:17:42,490 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:17:42,490 INFO ]: Start isEmpty. Operand 53 states and 88 transitions. [2018-06-22 11:17:42,490 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:42,490 INFO ]: Found error trace [2018-06-22 11:17:42,491 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:42,491 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:42,491 INFO ]: Analyzing trace with hash 593249434, now seen corresponding path program 2 times [2018-06-22 11:17:42,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:42,491 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:42,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:42,491 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:42,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:42,501 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:42,940 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:17:42,940 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:42,940 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) [2018-06-22 11:17:42,953 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:42,992 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:42,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:42,994 INFO ]: Computing forward predicates... [2018-06-22 11:17:43,216 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:43,236 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:43,236 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2018-06-22 11:17:43,236 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:17:43,236 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:17:43,236 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:17:43,237 INFO ]: Start difference. First operand 53 states and 88 transitions. Second operand 10 states. [2018-06-22 11:17:43,333 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:43,333 INFO ]: Finished difference Result 67 states and 106 transitions. [2018-06-22 11:17:43,334 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:17:43,334 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:17:43,334 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:43,334 INFO ]: With dead ends: 67 [2018-06-22 11:17:43,334 INFO ]: Without dead ends: 67 [2018-06-22 11:17:43,335 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:17:43,335 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 11:17:43,343 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-06-22 11:17:43,343 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:17:43,344 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 90 transitions. [2018-06-22 11:17:43,344 INFO ]: Start accepts. Automaton has 55 states and 90 transitions. Word has length 17 [2018-06-22 11:17:43,345 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:43,345 INFO ]: Abstraction has 55 states and 90 transitions. [2018-06-22 11:17:43,345 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:17:43,345 INFO ]: Start isEmpty. Operand 55 states and 90 transitions. [2018-06-22 11:17:43,346 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:43,346 INFO ]: Found error trace [2018-06-22 11:17:43,346 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:43,346 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:43,346 INFO ]: Analyzing trace with hash 1996836549, now seen corresponding path program 1 times [2018-06-22 11:17:43,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:43,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:43,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,347 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:43,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,353 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:43,392 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:17:43,392 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:43,392 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:43,392 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:43,392 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:43,392 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:43,392 INFO ]: Start difference. First operand 55 states and 90 transitions. Second operand 4 states. [2018-06-22 11:17:43,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:43,438 INFO ]: Finished difference Result 47 states and 71 transitions. [2018-06-22 11:17:43,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:43,438 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:43,439 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:43,439 INFO ]: With dead ends: 47 [2018-06-22 11:17:43,439 INFO ]: Without dead ends: 33 [2018-06-22 11:17:43,439 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:43,439 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:17:43,442 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 11:17:43,443 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:17:43,443 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2018-06-22 11:17:43,443 INFO ]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 17 [2018-06-22 11:17:43,443 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:43,443 INFO ]: Abstraction has 33 states and 50 transitions. [2018-06-22 11:17:43,443 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:43,443 INFO ]: Start isEmpty. Operand 33 states and 50 transitions. [2018-06-22 11:17:43,444 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:17:43,444 INFO ]: Found error trace [2018-06-22 11:17:43,444 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:43,444 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:43,444 INFO ]: Analyzing trace with hash -1774743012, now seen corresponding path program 3 times [2018-06-22 11:17:43,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:43,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:43,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,445 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:43,445 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:43,530 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:17:43,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:43,530 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 11:17:43,536 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:17:43,578 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:17:43,578 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:43,580 INFO ]: Computing forward predicates... [2018-06-22 11:17:43,708 INFO ]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:17:43,728 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:43,728 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 14 [2018-06-22 11:17:43,728 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:17:43,728 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:17:43,728 INFO ]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:17:43,728 INFO ]: Start difference. First operand 33 states and 50 transitions. Second operand 14 states. [2018-06-22 11:17:43,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:43,974 INFO ]: Finished difference Result 43 states and 60 transitions. [2018-06-22 11:17:43,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:17:43,975 INFO ]: Start accepts. Automaton has 14 states. Word has length 21 [2018-06-22 11:17:43,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:43,975 INFO ]: With dead ends: 43 [2018-06-22 11:17:43,975 INFO ]: Without dead ends: 30 [2018-06-22 11:17:43,976 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:17:43,976 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:17:43,978 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-06-22 11:17:43,978 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:17:43,979 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-06-22 11:17:43,979 INFO ]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 21 [2018-06-22 11:17:43,979 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:43,979 INFO ]: Abstraction has 24 states and 34 transitions. [2018-06-22 11:17:43,979 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:17:43,979 INFO ]: Start isEmpty. Operand 24 states and 34 transitions. [2018-06-22 11:17:43,979 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:17:43,979 INFO ]: Found error trace [2018-06-22 11:17:43,979 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:43,979 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:43,979 INFO ]: Analyzing trace with hash 167492491, now seen corresponding path program 2 times [2018-06-22 11:17:43,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:43,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:43,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,980 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:43,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:43,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:44,005 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:17:44,005 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:44,005 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:44,011 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:17:44,025 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:44,025 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:44,027 INFO ]: Computing forward predicates... [2018-06-22 11:17:44,043 INFO ]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:17:44,071 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:44,071 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 11:17:44,071 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:44,071 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:44,071 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:44,072 INFO ]: Start difference. First operand 24 states and 34 transitions. Second operand 4 states. [2018-06-22 11:17:44,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:44,101 INFO ]: Finished difference Result 16 states and 21 transitions. [2018-06-22 11:17:44,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:17:44,101 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:17:44,101 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:44,101 INFO ]: With dead ends: 16 [2018-06-22 11:17:44,101 INFO ]: Without dead ends: 0 [2018-06-22 11:17:44,102 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 1 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 11:17:44,102 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:17:44,102 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:17:44,102 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:17:44,102 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:17:44,102 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:17:44,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:44,102 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:17:44,102 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:44,102 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:17:44,102 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:17:44,106 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:17:44 BoogieIcfgContainer [2018-06-22 11:17:44,106 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:17:44,107 INFO ]: Toolchain (without parser) took 7939.11 ms. Allocated memory was 306.7 MB in the beginning and 366.0 MB in the end (delta: 59.2 MB). Free memory was 258.1 MB in the beginning and 201.0 MB in the end (delta: 57.1 MB). Peak memory consumption was 116.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:44,107 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:17:44,109 INFO ]: ChcToBoogie took 58.06 ms. Allocated memory is still 306.7 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:44,110 INFO ]: Boogie Preprocessor took 61.73 ms. Allocated memory is still 306.7 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:44,110 INFO ]: RCFGBuilder took 492.56 ms. Allocated memory is still 306.7 MB. Free memory was 254.1 MB in the beginning and 237.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:44,111 INFO ]: TraceAbstraction took 7316.36 ms. Allocated memory was 306.7 MB in the beginning and 366.0 MB in the end (delta: 59.2 MB). Free memory was 237.1 MB in the beginning and 201.0 MB in the end (delta: 36.1 MB). Peak memory consumption was 95.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:44,119 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.06 ms. Allocated memory is still 306.7 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 61.73 ms. Allocated memory is still 306.7 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 492.56 ms. Allocated memory is still 306.7 MB. Free memory was 254.1 MB in the beginning and 237.1 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 7316.36 ms. Allocated memory was 306.7 MB in the beginning and 366.0 MB in the end (delta: 59.2 MB). Free memory was 237.1 MB in the beginning and 201.0 MB in the end (delta: 36.1 MB). Peak memory consumption was 95.3 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. SAFE Result, 7.2s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 503 SDtfs, 78 SDslu, 1306 SDs, 0 SdLazy, 1007 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 146 SyntacticMatches, 6 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 84 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 406 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 18960 SizeOfPredicates, 42 NumberOfNonLiveVariables, 995 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 151/211 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/018b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-17-44-132.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/018b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-17-44-132.csv Received shutdown request...