java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:13:15,937 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:13:15,939 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:13:15,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:13:15,953 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:13:15,954 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:13:15,955 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:13:15,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:13:15,959 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:13:15,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:13:15,962 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:13:15,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:13:15,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:13:15,964 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:13:15,964 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:13:15,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:13:15,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:13:15,979 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:13:15,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:13:15,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:13:15,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:13:15,987 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:13:15,988 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:13:15,988 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:13:15,989 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:13:15,990 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:13:15,990 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:13:15,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:13:15,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:13:15,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:13:15,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:13:15,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:13:15,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:13:15,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:13:16,001 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:13:16,001 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:13:16,018 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:13:16,018 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:13:16,018 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:13:16,019 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:13:16,019 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:13:16,020 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:13:16,020 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:13:16,020 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:13:16,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:13:16,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:13:16,021 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:13:16,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:13:16,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:13:16,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:13:16,021 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:13:16,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:13:16,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:13:16,022 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:13:16,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:13:16,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:13:16,023 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:13:16,024 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:13:16,024 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:13:16,068 INFO ]: Repository-Root is: /tmp [2018-06-25 09:13:16,081 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:13:16,085 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:13:16,087 INFO ]: Initializing SmtParser... [2018-06-25 09:13:16,087 INFO ]: SmtParser initialized [2018-06-25 09:13:16,088 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 [2018-06-25 09:13:16,089 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:13:16,190 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 unknown [2018-06-25 09:13:16,496 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/018b-horn.smt2 [2018-06-25 09:13:16,500 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:13:16,508 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:13:16,509 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:13:16,509 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:13:16,509 INFO ]: ChcToBoogie initialized [2018-06-25 09:13:16,512 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:13:16" (1/1) ... [2018-06-25 09:13:16,584 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16 Unit [2018-06-25 09:13:16,584 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:13:16,585 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:13:16,585 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:13:16,585 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:13:16,610 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16" (1/1) ... [2018-06-25 09:13:16,610 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16" (1/1) ... [2018-06-25 09:13:16,618 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16" (1/1) ... [2018-06-25 09:13:16,618 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16" (1/1) ... [2018-06-25 09:13:16,634 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16" (1/1) ... [2018-06-25 09:13:16,636 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16" (1/1) ... [2018-06-25 09:13:16,644 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16" (1/1) ... [2018-06-25 09:13:16,646 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:13:16,647 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:13:16,647 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:13:16,647 INFO ]: RCFGBuilder initialized [2018-06-25 09:13:16,648 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:13:16,681 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:13:16,681 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:13:16,681 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:13:16,681 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:13:16,681 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:13:16,681 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:13:17,200 INFO ]: Using library mode [2018-06-25 09:13:17,200 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:13:17 BoogieIcfgContainer [2018-06-25 09:13:17,200 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:13:17,201 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:13:17,201 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:13:17,206 INFO ]: TraceAbstraction initialized [2018-06-25 09:13:17,206 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:13:16" (1/3) ... [2018-06-25 09:13:17,207 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbe3196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:13:17, skipping insertion in model container [2018-06-25 09:13:17,207 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:13:16" (2/3) ... [2018-06-25 09:13:17,207 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbe3196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:13:17, skipping insertion in model container [2018-06-25 09:13:17,207 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:13:17" (3/3) ... [2018-06-25 09:13:17,209 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:13:17,218 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:13:17,225 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:13:17,270 INFO ]: Using default assertion order modulation [2018-06-25 09:13:17,270 INFO ]: Interprodecural is true [2018-06-25 09:13:17,270 INFO ]: Hoare is false [2018-06-25 09:13:17,270 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:13:17,270 INFO ]: Backedges is TWOTRACK [2018-06-25 09:13:17,270 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:13:17,270 INFO ]: Difference is false [2018-06-25 09:13:17,270 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:13:17,270 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:13:17,283 INFO ]: Start isEmpty. Operand 13 states. [2018-06-25 09:13:17,293 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:13:17,293 INFO ]: Found error trace [2018-06-25 09:13:17,294 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:17,294 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:17,302 INFO ]: Analyzing trace with hash 2110367642, now seen corresponding path program 1 times [2018-06-25 09:13:17,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:17,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:17,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:17,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:17,340 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:17,385 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:17,456 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:17,457 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:17,458 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:17,459 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:17,473 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:17,473 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:17,477 INFO ]: Start difference. First operand 13 states. Second operand 3 states. [2018-06-25 09:13:17,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:17,558 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-25 09:13:17,558 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:17,559 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:13:17,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:17,569 INFO ]: With dead ends: 10 [2018-06-25 09:13:17,569 INFO ]: Without dead ends: 10 [2018-06-25 09:13:17,571 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:17,588 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:13:17,603 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:13:17,604 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:13:17,605 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-25 09:13:17,606 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 7 [2018-06-25 09:13:17,606 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:17,606 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-25 09:13:17,606 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:17,606 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-25 09:13:17,606 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:13:17,606 INFO ]: Found error trace [2018-06-25 09:13:17,607 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:17,607 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:17,607 INFO ]: Analyzing trace with hash 2121062611, now seen corresponding path program 1 times [2018-06-25 09:13:17,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:17,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:17,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:17,609 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:17,609 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:17,625 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:17,687 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:17,687 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:17,687 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:17,688 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:17,689 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:17,689 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:17,689 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-25 09:13:17,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:17,701 INFO ]: Finished difference Result 11 states and 21 transitions. [2018-06-25 09:13:17,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:17,701 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:13:17,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:17,701 INFO ]: With dead ends: 11 [2018-06-25 09:13:17,701 INFO ]: Without dead ends: 11 [2018-06-25 09:13:17,702 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:17,702 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:13:17,703 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:13:17,704 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:13:17,704 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2018-06-25 09:13:17,704 INFO ]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 7 [2018-06-25 09:13:17,704 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:17,704 INFO ]: Abstraction has 11 states and 21 transitions. [2018-06-25 09:13:17,704 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:17,704 INFO ]: Start isEmpty. Operand 11 states and 21 transitions. [2018-06-25 09:13:17,705 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:17,705 INFO ]: Found error trace [2018-06-25 09:13:17,705 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:17,705 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:17,705 INFO ]: Analyzing trace with hash 1001856987, now seen corresponding path program 1 times [2018-06-25 09:13:17,705 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:17,705 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:17,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:17,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:17,706 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:17,726 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:17,837 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:17,837 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:13:17,837 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:13:17,854 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:17,901 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:17,911 INFO ]: Computing forward predicates... [2018-06-25 09:13:18,311 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:18,348 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:13:18,348 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 09:13:18,349 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:13:18,349 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:13:18,349 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:13:18,349 INFO ]: Start difference. First operand 11 states and 21 transitions. Second operand 6 states. [2018-06-25 09:13:18,650 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:18,650 INFO ]: Finished difference Result 14 states and 28 transitions. [2018-06-25 09:13:18,651 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:13:18,651 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 09:13:18,651 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:18,652 INFO ]: With dead ends: 14 [2018-06-25 09:13:18,652 INFO ]: Without dead ends: 14 [2018-06-25 09:13:18,652 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:13:18,653 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:13:18,654 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:13:18,654 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:13:18,655 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-06-25 09:13:18,655 INFO ]: Start accepts. Automaton has 14 states and 28 transitions. Word has length 8 [2018-06-25 09:13:18,655 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:18,655 INFO ]: Abstraction has 14 states and 28 transitions. [2018-06-25 09:13:18,655 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:13:18,655 INFO ]: Start isEmpty. Operand 14 states and 28 transitions. [2018-06-25 09:13:18,657 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:18,657 INFO ]: Found error trace [2018-06-25 09:13:18,657 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:18,657 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:18,657 INFO ]: Analyzing trace with hash 1003704029, now seen corresponding path program 1 times [2018-06-25 09:13:18,657 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:18,657 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:18,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:18,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:18,692 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:18,754 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:18,755 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:13:18,755 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) [2018-06-25 09:13:18,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:13:18,822 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:18,824 INFO ]: Computing forward predicates... [2018-06-25 09:13:18,905 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:18,939 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:13:18,939 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:13:18,939 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:13:18,939 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:13:18,939 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:13:18,939 INFO ]: Start difference. First operand 14 states and 28 transitions. Second operand 5 states. [2018-06-25 09:13:19,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:19,052 INFO ]: Finished difference Result 20 states and 40 transitions. [2018-06-25 09:13:19,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:13:19,052 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:13:19,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:19,054 INFO ]: With dead ends: 20 [2018-06-25 09:13:19,054 INFO ]: Without dead ends: 20 [2018-06-25 09:13:19,055 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:13:19,055 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:13:19,057 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-25 09:13:19,057 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:13:19,058 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2018-06-25 09:13:19,058 INFO ]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 8 [2018-06-25 09:13:19,058 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:19,058 INFO ]: Abstraction has 18 states and 38 transitions. [2018-06-25 09:13:19,058 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:13:19,058 INFO ]: Start isEmpty. Operand 18 states and 38 transitions. [2018-06-25 09:13:19,058 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:19,058 INFO ]: Found error trace [2018-06-25 09:13:19,058 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:19,058 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:19,059 INFO ]: Analyzing trace with hash 1319160928, now seen corresponding path program 1 times [2018-06-25 09:13:19,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:19,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:19,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:19,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,074 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:19,221 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:19,221 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:13:19,221 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-25 09:13:19,228 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:19,254 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:19,256 INFO ]: Computing forward predicates... [2018-06-25 09:13:19,283 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:19,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:13:19,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-25 09:13:19,304 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:13:19,304 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:13:19,304 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:13:19,304 INFO ]: Start difference. First operand 18 states and 38 transitions. Second operand 6 states. [2018-06-25 09:13:19,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:19,494 INFO ]: Finished difference Result 24 states and 53 transitions. [2018-06-25 09:13:19,495 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:13:19,495 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-25 09:13:19,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:19,495 INFO ]: With dead ends: 24 [2018-06-25 09:13:19,495 INFO ]: Without dead ends: 24 [2018-06-25 09:13:19,496 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:13:19,496 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-25 09:13:19,499 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-06-25 09:13:19,499 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:13:19,499 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 48 transitions. [2018-06-25 09:13:19,499 INFO ]: Start accepts. Automaton has 21 states and 48 transitions. Word has length 8 [2018-06-25 09:13:19,500 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:19,500 INFO ]: Abstraction has 21 states and 48 transitions. [2018-06-25 09:13:19,500 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:13:19,500 INFO ]: Start isEmpty. Operand 21 states and 48 transitions. [2018-06-25 09:13:19,500 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:13:19,500 INFO ]: Found error trace [2018-06-25 09:13:19,500 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:19,500 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:19,500 INFO ]: Analyzing trace with hash 1322855012, now seen corresponding path program 1 times [2018-06-25 09:13:19,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:19,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:19,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:19,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,523 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:19,552 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:19,552 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:19,552 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:19,552 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:19,552 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:19,552 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:19,552 INFO ]: Start difference. First operand 21 states and 48 transitions. Second operand 3 states. [2018-06-25 09:13:19,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:19,619 INFO ]: Finished difference Result 24 states and 51 transitions. [2018-06-25 09:13:19,620 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:19,620 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:13:19,620 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:19,621 INFO ]: With dead ends: 24 [2018-06-25 09:13:19,621 INFO ]: Without dead ends: 19 [2018-06-25 09:13:19,621 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:19,621 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:13:19,623 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:13:19,623 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:13:19,623 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-06-25 09:13:19,623 INFO ]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 8 [2018-06-25 09:13:19,624 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:19,624 INFO ]: Abstraction has 19 states and 35 transitions. [2018-06-25 09:13:19,624 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:19,624 INFO ]: Start isEmpty. Operand 19 states and 35 transitions. [2018-06-25 09:13:19,624 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:13:19,624 INFO ]: Found error trace [2018-06-25 09:13:19,624 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:19,624 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:19,624 INFO ]: Analyzing trace with hash 1056870394, now seen corresponding path program 2 times [2018-06-25 09:13:19,624 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:19,624 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:19,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:13:19,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,650 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:19,899 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:19,899 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:19,899 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:13:19,900 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:13:19,900 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:13:19,900 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:13:19,900 INFO ]: Start difference. First operand 19 states and 35 transitions. Second operand 4 states. [2018-06-25 09:13:19,953 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:19,953 INFO ]: Finished difference Result 28 states and 55 transitions. [2018-06-25 09:13:19,954 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:13:19,954 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:13:19,954 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:19,954 INFO ]: With dead ends: 28 [2018-06-25 09:13:19,954 INFO ]: Without dead ends: 19 [2018-06-25 09:13:19,955 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:13:19,955 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:13:19,956 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-25 09:13:19,956 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:13:19,957 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-25 09:13:19,957 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-25 09:13:19,957 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:19,957 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-25 09:13:19,957 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:13:19,957 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-25 09:13:19,957 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:13:19,957 INFO ]: Found error trace [2018-06-25 09:13:19,958 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:19,958 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:19,958 INFO ]: Analyzing trace with hash -2064954765, now seen corresponding path program 2 times [2018-06-25 09:13:19,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:19,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:19,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,959 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:13:19,959 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:19,971 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:20,134 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:13:20,135 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:20,135 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:13:20,135 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:13:20,135 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:13:20,135 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:13:20,135 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2018-06-25 09:13:20,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:20,181 INFO ]: Finished difference Result 15 states and 21 transitions. [2018-06-25 09:13:20,182 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:13:20,182 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:13:20,183 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:20,183 INFO ]: With dead ends: 15 [2018-06-25 09:13:20,183 INFO ]: Without dead ends: 12 [2018-06-25 09:13:20,183 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:13:20,183 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:13:20,184 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:13:20,184 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:13:20,185 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-25 09:13:20,185 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 9 [2018-06-25 09:13:20,185 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:20,185 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-25 09:13:20,185 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:13:20,185 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-25 09:13:20,185 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:13:20,185 INFO ]: Found error trace [2018-06-25 09:13:20,185 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:13:20,185 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:13:20,185 INFO ]: Analyzing trace with hash -1440896160, now seen corresponding path program 1 times [2018-06-25 09:13:20,185 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:13:20,185 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:13:20,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:20,186 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:13:20,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:13:20,222 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:13:20,303 INFO ]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:13:20,303 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:13:20,303 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:13:20,303 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:13:20,303 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:13:20,303 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:20,304 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 3 states. [2018-06-25 09:13:20,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:13:20,308 INFO ]: Finished difference Result 8 states and 13 transitions. [2018-06-25 09:13:20,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:13:20,309 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 09:13:20,309 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:13:20,309 INFO ]: With dead ends: 8 [2018-06-25 09:13:20,309 INFO ]: Without dead ends: 0 [2018-06-25 09:13:20,309 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:13:20,309 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:13:20,309 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:13:20,309 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:13:20,309 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:13:20,309 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2018-06-25 09:13:20,309 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:13:20,309 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:13:20,309 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:13:20,309 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:13:20,309 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:13:20,313 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:13:20 BoogieIcfgContainer [2018-06-25 09:13:20,313 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:13:20,314 INFO ]: Toolchain (without parser) took 3813.32 ms. Allocated memory was 303.0 MB in the beginning and 324.5 MB in the end (delta: 21.5 MB). Free memory was 254.4 MB in the beginning and 235.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 40.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,316 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:13:20,316 INFO ]: ChcToBoogie took 75.52 ms. Allocated memory is still 303.0 MB. Free memory was 254.4 MB in the beginning and 251.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,316 INFO ]: Boogie Preprocessor took 61.93 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 250.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,317 INFO ]: RCFGBuilder took 553.24 ms. Allocated memory is still 303.0 MB. Free memory was 250.4 MB in the beginning and 232.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,317 INFO ]: TraceAbstraction took 3112.33 ms. Allocated memory was 303.0 MB in the beginning and 324.5 MB in the end (delta: 21.5 MB). Free memory was 232.4 MB in the beginning and 235.4 MB in the end (delta: -3.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 3.6 GB. [2018-06-25 09:13:20,321 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 75.52 ms. Allocated memory is still 303.0 MB. Free memory was 254.4 MB in the beginning and 251.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 61.93 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 250.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 553.24 ms. Allocated memory is still 303.0 MB. Free memory was 250.4 MB in the beginning and 232.4 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 3112.33 ms. Allocated memory was 303.0 MB in the beginning and 324.5 MB in the end (delta: 21.5 MB). Free memory was 232.4 MB in the beginning and 235.4 MB in the end (delta: -3.0 MB). Peak memory consumption was 18.5 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 2 procedures, 13 locations, 1 error locations. SAFE Result, 3.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 107 SDtfs, 5 SDslu, 157 SDs, 0 SdLazy, 112 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 1656 SizeOfPredicates, 10 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 17/23 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_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-13-20-337.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/018b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-13-20-337.csv Received shutdown request...