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/027-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:23:43,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:23:43,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:23:43,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:23:43,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:23:43,962 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:23:43,963 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:23:43,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:23:43,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:23:43,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:23:43,968 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:23:43,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:23:43,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:23:43,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:23:43,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:23:43,973 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:23:43,975 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:23:43,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:23:43,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:23:43,987 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:23:43,988 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:23:43,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:23:43,990 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:23:43,994 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:23:43,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:23:43,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:23:43,996 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:23:43,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:23:43,998 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:23:43,998 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:23:43,999 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:23:43,999 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:23:43,999 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:23:44,000 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:23:44,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:23:44,004 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:23:44,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:23:44,022 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:23:44,022 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:23:44,022 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:23:44,024 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:23:44,024 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:23:44,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:23:44,024 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:23:44,024 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:23:44,025 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:23:44,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:23:44,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:23:44,025 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:23:44,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:23:44,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:23:44,026 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:23:44,026 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:23:44,026 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:23:44,026 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:23:44,030 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:23:44,030 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:23:44,072 INFO ]: Repository-Root is: /tmp [2018-06-22 11:23:44,087 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:23:44,093 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:23:44,096 INFO ]: Initializing SmtParser... [2018-06-22 11:23:44,096 INFO ]: SmtParser initialized [2018-06-22 11:23:44,097 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/027-horn.smt2 [2018-06-22 11:23:44,098 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:23:44,191 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/027-horn.smt2 unknown [2018-06-22 11:23:44,428 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/027-horn.smt2 [2018-06-22 11:23:44,433 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:23:44,440 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:23:44,440 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:23:44,440 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:23:44,441 INFO ]: ChcToBoogie initialized [2018-06-22 11:23:44,444 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:23:44" (1/1) ... [2018-06-22 11:23:44,489 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44 Unit [2018-06-22 11:23:44,490 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:23:44,490 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:23:44,490 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:23:44,490 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:23:44,514 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44" (1/1) ... [2018-06-22 11:23:44,514 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44" (1/1) ... [2018-06-22 11:23:44,522 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44" (1/1) ... [2018-06-22 11:23:44,522 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44" (1/1) ... [2018-06-22 11:23:44,526 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44" (1/1) ... [2018-06-22 11:23:44,527 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44" (1/1) ... [2018-06-22 11:23:44,529 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44" (1/1) ... [2018-06-22 11:23:44,530 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:23:44,531 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:23:44,531 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:23:44,531 INFO ]: RCFGBuilder initialized [2018-06-22 11:23:44,532 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44" (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:23:44,547 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:23:44,547 INFO ]: Found specification of procedure False [2018-06-22 11:23:44,548 INFO ]: Found implementation of procedure False [2018-06-22 11:23:44,548 INFO ]: Specification and implementation of procedure INV2 given in one single declaration [2018-06-22 11:23:44,548 INFO ]: Found specification of procedure INV2 [2018-06-22 11:23:44,548 INFO ]: Found implementation of procedure INV2 [2018-06-22 11:23:44,548 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:23:44,548 INFO ]: Found specification of procedure INV1 [2018-06-22 11:23:44,548 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:23:44,548 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:23:44,548 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:23:44,548 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:23:44,882 INFO ]: Using library mode [2018-06-22 11:23:44,883 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:23:44 BoogieIcfgContainer [2018-06-22 11:23:44,883 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:23:44,884 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:23:44,884 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:23:44,888 INFO ]: TraceAbstraction initialized [2018-06-22 11:23:44,888 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:23:44" (1/3) ... [2018-06-22 11:23:44,889 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51116f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:23:44, skipping insertion in model container [2018-06-22 11:23:44,889 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:44" (2/3) ... [2018-06-22 11:23:44,889 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51116f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:23:44, skipping insertion in model container [2018-06-22 11:23:44,889 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:23:44" (3/3) ... [2018-06-22 11:23:44,891 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:23:44,900 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:23:44,907 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:23:44,950 INFO ]: Using default assertion order modulation [2018-06-22 11:23:44,950 INFO ]: Interprodecural is true [2018-06-22 11:23:44,950 INFO ]: Hoare is false [2018-06-22 11:23:44,950 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:23:44,950 INFO ]: Backedges is TWOTRACK [2018-06-22 11:23:44,950 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:23:44,950 INFO ]: Difference is false [2018-06-22 11:23:44,951 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:23:44,951 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:23:44,965 INFO ]: Start isEmpty. Operand 23 states. [2018-06-22 11:23:44,977 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:23:44,977 INFO ]: Found error trace [2018-06-22 11:23:44,978 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:44,978 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:44,983 INFO ]: Analyzing trace with hash -1384514580, now seen corresponding path program 1 times [2018-06-22 11:23:44,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:44,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:45,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,020 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:45,020 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,057 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:45,184 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:23:45,186 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:45,186 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:45,187 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:45,197 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:45,198 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:45,200 INFO ]: Start difference. First operand 23 states. Second operand 4 states. [2018-06-22 11:23:45,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:45,401 INFO ]: Finished difference Result 25 states and 43 transitions. [2018-06-22 11:23:45,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:23:45,402 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:23:45,402 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:45,411 INFO ]: With dead ends: 25 [2018-06-22 11:23:45,411 INFO ]: Without dead ends: 25 [2018-06-22 11:23:45,413 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:23:45,428 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:23:45,456 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:23:45,458 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:23:45,459 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 41 transitions. [2018-06-22 11:23:45,460 INFO ]: Start accepts. Automaton has 23 states and 41 transitions. Word has length 9 [2018-06-22 11:23:45,461 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:45,461 INFO ]: Abstraction has 23 states and 41 transitions. [2018-06-22 11:23:45,461 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:45,461 INFO ]: Start isEmpty. Operand 23 states and 41 transitions. [2018-06-22 11:23:45,463 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:23:45,463 INFO ]: Found error trace [2018-06-22 11:23:45,463 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:45,464 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:45,464 INFO ]: Analyzing trace with hash 500219346, now seen corresponding path program 1 times [2018-06-22 11:23:45,464 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:45,464 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:45,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,465 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:45,465 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:45,563 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:23:45,563 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:45,563 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:45,565 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:45,565 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:45,565 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:45,565 INFO ]: Start difference. First operand 23 states and 41 transitions. Second operand 4 states. [2018-06-22 11:23:45,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:45,609 INFO ]: Finished difference Result 25 states and 44 transitions. [2018-06-22 11:23:45,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:23:45,609 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:23:45,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:45,610 INFO ]: With dead ends: 25 [2018-06-22 11:23:45,611 INFO ]: Without dead ends: 25 [2018-06-22 11:23:45,611 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:23:45,611 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:23:45,618 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 11:23:45,618 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:23:45,619 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2018-06-22 11:23:45,619 INFO ]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 9 [2018-06-22 11:23:45,619 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:45,619 INFO ]: Abstraction has 25 states and 44 transitions. [2018-06-22 11:23:45,619 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:45,620 INFO ]: Start isEmpty. Operand 25 states and 44 transitions. [2018-06-22 11:23:45,621 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:45,621 INFO ]: Found error trace [2018-06-22 11:23:45,621 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:45,621 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:45,621 INFO ]: Analyzing trace with hash -1181329739, now seen corresponding path program 1 times [2018-06-22 11:23:45,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:45,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:45,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,622 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:45,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:45,673 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:23:45,673 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:45,673 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:45,674 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:45,674 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:45,674 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:45,674 INFO ]: Start difference. First operand 25 states and 44 transitions. Second operand 4 states. [2018-06-22 11:23:45,892 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:45,892 INFO ]: Finished difference Result 27 states and 44 transitions. [2018-06-22 11:23:45,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:23:45,892 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:23:45,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:45,893 INFO ]: With dead ends: 27 [2018-06-22 11:23:45,893 INFO ]: Without dead ends: 23 [2018-06-22 11:23:45,894 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:23:45,894 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:23:45,898 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:23:45,898 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:23:45,899 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2018-06-22 11:23:45,899 INFO ]: Start accepts. Automaton has 23 states and 36 transitions. Word has length 13 [2018-06-22 11:23:45,899 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:45,899 INFO ]: Abstraction has 23 states and 36 transitions. [2018-06-22 11:23:45,900 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:45,900 INFO ]: Start isEmpty. Operand 23 states and 36 transitions. [2018-06-22 11:23:45,901 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:45,901 INFO ]: Found error trace [2018-06-22 11:23:45,901 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:45,901 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:45,901 INFO ]: Analyzing trace with hash -445577180, now seen corresponding path program 1 times [2018-06-22 11:23:45,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:45,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:45,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,902 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:45,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,911 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:45,970 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:23:45,970 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:45,970 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:45,971 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:45,971 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:45,971 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:45,971 INFO ]: Start difference. First operand 23 states and 36 transitions. Second operand 4 states. [2018-06-22 11:23:46,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:46,167 INFO ]: Finished difference Result 28 states and 48 transitions. [2018-06-22 11:23:46,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:23:46,167 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:23:46,168 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:46,169 INFO ]: With dead ends: 28 [2018-06-22 11:23:46,169 INFO ]: Without dead ends: 28 [2018-06-22 11:23:46,169 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:23:46,169 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:23:46,176 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 11:23:46,176 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:23:46,177 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2018-06-22 11:23:46,177 INFO ]: Start accepts. Automaton has 28 states and 48 transitions. Word has length 13 [2018-06-22 11:23:46,178 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:46,178 INFO ]: Abstraction has 28 states and 48 transitions. [2018-06-22 11:23:46,178 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:46,178 INFO ]: Start isEmpty. Operand 28 states and 48 transitions. [2018-06-22 11:23:46,179 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:46,179 INFO ]: Found error trace [2018-06-22 11:23:46,179 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:46,179 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:46,179 INFO ]: Analyzing trace with hash -1426580592, now seen corresponding path program 1 times [2018-06-22 11:23:46,180 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:46,180 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:46,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:46,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:46,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:46,189 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:46,315 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:23:46,315 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:46,315 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:46,315 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:46,315 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:46,315 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:46,316 INFO ]: Start difference. First operand 28 states and 48 transitions. Second operand 4 states. [2018-06-22 11:23:46,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:46,712 INFO ]: Finished difference Result 39 states and 69 transitions. [2018-06-22 11:23:46,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:23:46,712 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:23:46,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:46,714 INFO ]: With dead ends: 39 [2018-06-22 11:23:46,714 INFO ]: Without dead ends: 35 [2018-06-22 11:23:46,714 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:46,714 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:23:46,722 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 11:23:46,722 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:23:46,724 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2018-06-22 11:23:46,724 INFO ]: Start accepts. Automaton has 35 states and 60 transitions. Word has length 13 [2018-06-22 11:23:46,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:46,725 INFO ]: Abstraction has 35 states and 60 transitions. [2018-06-22 11:23:46,725 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:46,725 INFO ]: Start isEmpty. Operand 35 states and 60 transitions. [2018-06-22 11:23:46,726 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:46,726 INFO ]: Found error trace [2018-06-22 11:23:46,726 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:46,726 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:46,726 INFO ]: Analyzing trace with hash -936078886, now seen corresponding path program 1 times [2018-06-22 11:23:46,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:46,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:46,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:46,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:46,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:46,742 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:46,938 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:23:46,938 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:46,938 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:23:46,939 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:23:46,939 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:23:46,939 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:46,939 INFO ]: Start difference. First operand 35 states and 60 transitions. Second operand 5 states. [2018-06-22 11:23:47,169 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:47,169 INFO ]: Finished difference Result 43 states and 70 transitions. [2018-06-22 11:23:47,170 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:23:47,171 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:23:47,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:47,172 INFO ]: With dead ends: 43 [2018-06-22 11:23:47,172 INFO ]: Without dead ends: 43 [2018-06-22 11:23:47,172 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:47,172 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:23:47,181 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-06-22 11:23:47,181 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:23:47,182 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 60 transitions. [2018-06-22 11:23:47,182 INFO ]: Start accepts. Automaton has 35 states and 60 transitions. Word has length 13 [2018-06-22 11:23:47,182 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:47,182 INFO ]: Abstraction has 35 states and 60 transitions. [2018-06-22 11:23:47,182 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:23:47,182 INFO ]: Start isEmpty. Operand 35 states and 60 transitions. [2018-06-22 11:23:47,184 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:47,184 INFO ]: Found error trace [2018-06-22 11:23:47,184 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:47,184 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:47,184 INFO ]: Analyzing trace with hash -780168940, now seen corresponding path program 1 times [2018-06-22 11:23:47,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:47,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:47,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:47,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:47,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:47,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:47,221 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:23:47,222 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:47,222 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:47,222 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:47,222 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:47,222 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:47,222 INFO ]: Start difference. First operand 35 states and 60 transitions. Second operand 4 states. [2018-06-22 11:23:47,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:47,249 INFO ]: Finished difference Result 35 states and 58 transitions. [2018-06-22 11:23:47,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:23:47,249 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:23:47,249 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:47,250 INFO ]: With dead ends: 35 [2018-06-22 11:23:47,250 INFO ]: Without dead ends: 27 [2018-06-22 11:23:47,250 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:23:47,250 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:23:47,257 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 11:23:47,257 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:23:47,258 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2018-06-22 11:23:47,258 INFO ]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 13 [2018-06-22 11:23:47,258 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:47,258 INFO ]: Abstraction has 27 states and 46 transitions. [2018-06-22 11:23:47,258 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:47,258 INFO ]: Start isEmpty. Operand 27 states and 46 transitions. [2018-06-22 11:23:47,259 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:23:47,259 INFO ]: Found error trace [2018-06-22 11:23:47,259 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:47,259 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:47,259 INFO ]: Analyzing trace with hash 342990994, now seen corresponding path program 1 times [2018-06-22 11:23:47,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:47,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:47,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:47,260 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:47,260 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:47,273 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:47,356 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:23:47,356 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:47,357 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:23:47,357 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:23:47,357 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:23:47,357 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:47,357 INFO ]: Start difference. First operand 27 states and 46 transitions. Second operand 5 states. [2018-06-22 11:23:47,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:47,447 INFO ]: Finished difference Result 27 states and 43 transitions. [2018-06-22 11:23:47,448 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:23:47,448 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:23:47,448 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:47,449 INFO ]: With dead ends: 27 [2018-06-22 11:23:47,449 INFO ]: Without dead ends: 22 [2018-06-22 11:23:47,449 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:23:47,449 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:23:47,453 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 11:23:47,453 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:23:47,453 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-06-22 11:23:47,453 INFO ]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 17 [2018-06-22 11:23:47,454 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:47,454 INFO ]: Abstraction has 20 states and 29 transitions. [2018-06-22 11:23:47,454 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:23:47,454 INFO ]: Start isEmpty. Operand 20 states and 29 transitions. [2018-06-22 11:23:47,454 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:23:47,454 INFO ]: Found error trace [2018-06-22 11:23:47,454 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:47,454 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:47,454 INFO ]: Analyzing trace with hash 998529534, now seen corresponding path program 1 times [2018-06-22 11:23:47,455 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:47,455 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:47,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:47,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:47,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:47,466 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:47,550 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:23:47,550 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:47,550 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:23:47,550 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:23:47,551 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:23:47,551 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:47,551 INFO ]: Start difference. First operand 20 states and 29 transitions. Second operand 5 states. [2018-06-22 11:23:47,604 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:47,605 INFO ]: Finished difference Result 14 states and 19 transitions. [2018-06-22 11:23:47,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:23:47,605 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:23:47,605 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:47,605 INFO ]: With dead ends: 14 [2018-06-22 11:23:47,605 INFO ]: Without dead ends: 0 [2018-06-22 11:23:47,605 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:23:47,605 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:23:47,605 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:23:47,605 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:23:47,605 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:23:47,605 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 11:23:47,605 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:47,605 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:23:47,605 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:23:47,605 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:23:47,606 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:23:47,610 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:23:47 BoogieIcfgContainer [2018-06-22 11:23:47,610 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:23:47,611 INFO ]: Toolchain (without parser) took 3178.10 ms. Allocated memory was 309.3 MB in the beginning and 326.1 MB in the end (delta: 16.8 MB). Free memory was 263.7 MB in the beginning and 245.2 MB in the end (delta: 18.5 MB). Peak memory consumption was 35.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:47,612 INFO ]: SmtParser took 0.07 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 11:23:47,613 INFO ]: ChcToBoogie took 49.39 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.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 11:23:47,613 INFO ]: Boogie Preprocessor took 40.07 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-22 11:23:47,614 INFO ]: RCFGBuilder took 352.14 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 249.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:47,614 INFO ]: TraceAbstraction took 2725.94 ms. Allocated memory was 309.3 MB in the beginning and 326.1 MB in the end (delta: 16.8 MB). Free memory was 249.6 MB in the beginning and 245.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:47,624 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 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.39 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.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 40.07 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 260.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 352.14 ms. Allocated memory is still 309.3 MB. Free memory was 260.7 MB in the beginning and 249.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2725.94 ms. Allocated memory was 309.3 MB in the beginning and 326.1 MB in the end (delta: 16.8 MB). Free memory was 249.6 MB in the beginning and 245.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 21.2 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 4 procedures, 23 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 231 SDtfs, 19 SDslu, 318 SDs, 0 SdLazy, 233 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=5, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 3088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 33/33 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/027-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-23-47-637.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/027-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-23-47-637.csv Received shutdown request...