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/022b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:20:52,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:20:52,097 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:20:52,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:20:52,117 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:20:52,120 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:20:52,122 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:20:52,127 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:20:52,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:20:52,129 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:20:52,130 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:20:52,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:20:52,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:20:52,134 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:20:52,134 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:20:52,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:20:52,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:20:52,141 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:20:52,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:20:52,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:20:52,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:20:52,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:20:52,159 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:20:52,159 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:20:52,160 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:20:52,161 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:20:52,161 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:20:52,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:20:52,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:20:52,168 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:20:52,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:20:52,170 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:20:52,170 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:20:52,170 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:20:52,172 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:20:52,172 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:20:52,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:20:52,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:20:52,192 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:20:52,192 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:20:52,193 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:20:52,193 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:20:52,193 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:20:52,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:20:52,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:20:52,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:20:52,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:20:52,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:20:52,194 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:20:52,195 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:20:52,195 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:20:52,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:20:52,196 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:20:52,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:20:52,196 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:20:52,199 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:20:52,199 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:20:52,254 INFO ]: Repository-Root is: /tmp [2018-06-22 11:20:52,269 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:20:52,272 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:20:52,273 INFO ]: Initializing SmtParser... [2018-06-22 11:20:52,273 INFO ]: SmtParser initialized [2018-06-22 11:20:52,274 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 [2018-06-22 11:20:52,275 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:20:52,347 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 unknown [2018-06-22 11:20:52,579 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022b-horn.smt2 [2018-06-22 11:20:52,584 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:20:52,590 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:20:52,590 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:20:52,590 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:20:52,590 INFO ]: ChcToBoogie initialized [2018-06-22 11:20:52,595 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:20:52" (1/1) ... [2018-06-22 11:20:52,648 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52 Unit [2018-06-22 11:20:52,648 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:20:52,653 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:20:52,653 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:20:52,653 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:20:52,674 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52" (1/1) ... [2018-06-22 11:20:52,674 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52" (1/1) ... [2018-06-22 11:20:52,684 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52" (1/1) ... [2018-06-22 11:20:52,684 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52" (1/1) ... [2018-06-22 11:20:52,700 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52" (1/1) ... [2018-06-22 11:20:52,702 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52" (1/1) ... [2018-06-22 11:20:52,703 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52" (1/1) ... [2018-06-22 11:20:52,714 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:20:52,715 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:20:52,715 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:20:52,715 INFO ]: RCFGBuilder initialized [2018-06-22 11:20:52,716 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52" (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:20:52,739 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:20:52,739 INFO ]: Found specification of procedure False [2018-06-22 11:20:52,739 INFO ]: Found implementation of procedure False [2018-06-22 11:20:52,739 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:20:52,739 INFO ]: Found specification of procedure INV1 [2018-06-22 11:20:52,739 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:20:52,739 INFO ]: Specification and implementation of procedure INV3 given in one single declaration [2018-06-22 11:20:52,739 INFO ]: Found specification of procedure INV3 [2018-06-22 11:20:52,739 INFO ]: Found implementation of procedure INV3 [2018-06-22 11:20:52,739 INFO ]: Specification and implementation of procedure INV2 given in one single declaration [2018-06-22 11:20:52,739 INFO ]: Found specification of procedure INV2 [2018-06-22 11:20:52,739 INFO ]: Found implementation of procedure INV2 [2018-06-22 11:20:52,739 INFO ]: Specification and implementation of procedure INV4 given in one single declaration [2018-06-22 11:20:52,739 INFO ]: Found specification of procedure INV4 [2018-06-22 11:20:52,739 INFO ]: Found implementation of procedure INV4 [2018-06-22 11:20:52,739 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:20:52,739 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:20:52,740 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:20:53,363 INFO ]: Using library mode [2018-06-22 11:20:53,364 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:20:53 BoogieIcfgContainer [2018-06-22 11:20:53,364 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:20:53,365 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:20:53,365 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:20:53,371 INFO ]: TraceAbstraction initialized [2018-06-22 11:20:53,371 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:20:52" (1/3) ... [2018-06-22 11:20:53,372 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e539d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:20:53, skipping insertion in model container [2018-06-22 11:20:53,372 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:20:52" (2/3) ... [2018-06-22 11:20:53,372 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e539d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:20:53, skipping insertion in model container [2018-06-22 11:20:53,372 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:20:53" (3/3) ... [2018-06-22 11:20:53,374 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:20:53,381 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:20:53,388 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:20:53,420 INFO ]: Using default assertion order modulation [2018-06-22 11:20:53,421 INFO ]: Interprodecural is true [2018-06-22 11:20:53,421 INFO ]: Hoare is false [2018-06-22 11:20:53,421 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:20:53,421 INFO ]: Backedges is TWOTRACK [2018-06-22 11:20:53,421 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:20:53,421 INFO ]: Difference is false [2018-06-22 11:20:53,421 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:20:53,422 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:20:53,435 INFO ]: Start isEmpty. Operand 40 states. [2018-06-22 11:20:53,450 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:20:53,451 INFO ]: Found error trace [2018-06-22 11:20:53,451 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:53,452 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:53,455 INFO ]: Analyzing trace with hash -1354509503, now seen corresponding path program 1 times [2018-06-22 11:20:53,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:53,457 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:53,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:53,488 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:53,488 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:53,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:53,615 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:20:53,617 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:20:53,617 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:20:53,618 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:20:53,628 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:20:53,629 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:20:53,631 INFO ]: Start difference. First operand 40 states. Second operand 4 states. [2018-06-22 11:20:54,004 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:54,004 INFO ]: Finished difference Result 40 states and 73 transitions. [2018-06-22 11:20:54,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:20:54,006 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:20:54,007 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:54,018 INFO ]: With dead ends: 40 [2018-06-22 11:20:54,018 INFO ]: Without dead ends: 40 [2018-06-22 11:20:54,019 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:20:54,032 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:20:54,075 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 11:20:54,076 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:20:54,078 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 73 transitions. [2018-06-22 11:20:54,079 INFO ]: Start accepts. Automaton has 40 states and 73 transitions. Word has length 9 [2018-06-22 11:20:54,080 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:54,080 INFO ]: Abstraction has 40 states and 73 transitions. [2018-06-22 11:20:54,080 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:20:54,080 INFO ]: Start isEmpty. Operand 40 states and 73 transitions. [2018-06-22 11:20:54,084 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:20:54,084 INFO ]: Found error trace [2018-06-22 11:20:54,084 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:54,084 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:54,085 INFO ]: Analyzing trace with hash -1639004819, now seen corresponding path program 1 times [2018-06-22 11:20:54,085 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:54,085 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:54,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:54,086 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:54,086 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:54,112 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:54,169 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:20:54,169 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:54,169 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:54,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:54,226 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:54,236 INFO ]: Computing forward predicates... [2018-06-22 11:20:54,811 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:20:54,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:54,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-06-22 11:20:54,833 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:20:54,833 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:20:54,833 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:20:54,834 INFO ]: Start difference. First operand 40 states and 73 transitions. Second operand 8 states. [2018-06-22 11:20:56,016 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:56,016 INFO ]: Finished difference Result 44 states and 97 transitions. [2018-06-22 11:20:56,017 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:20:56,017 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:20:56,017 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:56,020 INFO ]: With dead ends: 44 [2018-06-22 11:20:56,020 INFO ]: Without dead ends: 44 [2018-06-22 11:20:56,020 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:20:56,021 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:20:56,034 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-06-22 11:20:56,034 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:20:56,037 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 84 transitions. [2018-06-22 11:20:56,037 INFO ]: Start accepts. Automaton has 42 states and 84 transitions. Word has length 21 [2018-06-22 11:20:56,037 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:56,037 INFO ]: Abstraction has 42 states and 84 transitions. [2018-06-22 11:20:56,037 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:20:56,037 INFO ]: Start isEmpty. Operand 42 states and 84 transitions. [2018-06-22 11:20:56,040 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:20:56,040 INFO ]: Found error trace [2018-06-22 11:20:56,040 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:56,040 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:56,040 INFO ]: Analyzing trace with hash 415761909, now seen corresponding path program 1 times [2018-06-22 11:20:56,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:56,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:56,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:56,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:56,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:56,058 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:56,118 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:20:56,118 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:56,118 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:56,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:56,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:56,154 INFO ]: Computing forward predicates... [2018-06-22 11:20:56,243 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:20:56,264 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:56,264 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-06-22 11:20:56,264 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:20:56,264 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:20:56,265 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:20:56,265 INFO ]: Start difference. First operand 42 states and 84 transitions. Second operand 8 states. [2018-06-22 11:20:56,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:56,702 INFO ]: Finished difference Result 44 states and 95 transitions. [2018-06-22 11:20:56,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:20:56,704 INFO ]: Start accepts. Automaton has 8 states. Word has length 21 [2018-06-22 11:20:56,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:56,706 INFO ]: With dead ends: 44 [2018-06-22 11:20:56,706 INFO ]: Without dead ends: 44 [2018-06-22 11:20:56,706 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:20:56,706 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:20:56,720 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 11:20:56,721 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:20:56,723 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 95 transitions. [2018-06-22 11:20:56,723 INFO ]: Start accepts. Automaton has 44 states and 95 transitions. Word has length 21 [2018-06-22 11:20:56,723 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:56,723 INFO ]: Abstraction has 44 states and 95 transitions. [2018-06-22 11:20:56,723 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:20:56,723 INFO ]: Start isEmpty. Operand 44 states and 95 transitions. [2018-06-22 11:20:56,725 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:20:56,725 INFO ]: Found error trace [2018-06-22 11:20:56,725 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:56,725 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:56,725 INFO ]: Analyzing trace with hash 1367396051, now seen corresponding path program 1 times [2018-06-22 11:20:56,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:56,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:56,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:56,726 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:56,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:56,749 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:56,818 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:20:56,818 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:20:56,819 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:20:56,819 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:20:56,819 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:20:56,819 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:20:56,819 INFO ]: Start difference. First operand 44 states and 95 transitions. Second operand 6 states. [2018-06-22 11:20:57,034 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:57,034 INFO ]: Finished difference Result 50 states and 117 transitions. [2018-06-22 11:20:57,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:20:57,035 INFO ]: Start accepts. Automaton has 6 states. Word has length 21 [2018-06-22 11:20:57,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:57,037 INFO ]: With dead ends: 50 [2018-06-22 11:20:57,037 INFO ]: Without dead ends: 50 [2018-06-22 11:20:57,037 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:20:57,037 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:20:57,048 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-22 11:20:57,048 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:20:57,050 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 112 transitions. [2018-06-22 11:20:57,050 INFO ]: Start accepts. Automaton has 48 states and 112 transitions. Word has length 21 [2018-06-22 11:20:57,050 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:57,050 INFO ]: Abstraction has 48 states and 112 transitions. [2018-06-22 11:20:57,050 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:20:57,050 INFO ]: Start isEmpty. Operand 48 states and 112 transitions. [2018-06-22 11:20:57,052 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:20:57,052 INFO ]: Found error trace [2018-06-22 11:20:57,052 INFO ]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:57,053 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:57,053 INFO ]: Analyzing trace with hash 2070182656, now seen corresponding path program 1 times [2018-06-22 11:20:57,053 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:57,053 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:57,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:57,053 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:57,053 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:57,076 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:57,159 INFO ]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:20:57,160 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:20:57,160 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:20:57,160 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:20:57,160 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:20:57,160 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:20:57,160 INFO ]: Start difference. First operand 48 states and 112 transitions. Second operand 4 states. [2018-06-22 11:20:57,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:57,345 INFO ]: Finished difference Result 59 states and 147 transitions. [2018-06-22 11:20:57,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:20:57,349 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-22 11:20:57,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:57,351 INFO ]: With dead ends: 59 [2018-06-22 11:20:57,351 INFO ]: Without dead ends: 59 [2018-06-22 11:20:57,352 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:20:57,352 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 11:20:57,377 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-06-22 11:20:57,377 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 11:20:57,380 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 136 transitions. [2018-06-22 11:20:57,380 INFO ]: Start accepts. Automaton has 55 states and 136 transitions. Word has length 29 [2018-06-22 11:20:57,380 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:57,380 INFO ]: Abstraction has 55 states and 136 transitions. [2018-06-22 11:20:57,380 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:20:57,381 INFO ]: Start isEmpty. Operand 55 states and 136 transitions. [2018-06-22 11:20:57,383 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:20:57,383 INFO ]: Found error trace [2018-06-22 11:20:57,383 INFO ]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:57,383 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:57,383 INFO ]: Analyzing trace with hash 1611219799, now seen corresponding path program 1 times [2018-06-22 11:20:57,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:57,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:57,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:57,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:57,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:57,424 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:57,584 INFO ]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:20:57,584 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:20:57,584 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:20:57,585 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:20:57,585 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:20:57,585 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:20:57,585 INFO ]: Start difference. First operand 55 states and 136 transitions. Second operand 4 states. [2018-06-22 11:20:57,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:57,703 INFO ]: Finished difference Result 53 states and 112 transitions. [2018-06-22 11:20:57,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:20:57,704 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-22 11:20:57,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:57,705 INFO ]: With dead ends: 53 [2018-06-22 11:20:57,705 INFO ]: Without dead ends: 42 [2018-06-22 11:20:57,706 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:20:57,706 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:20:57,714 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:20:57,714 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:20:57,715 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 82 transitions. [2018-06-22 11:20:57,715 INFO ]: Start accepts. Automaton has 42 states and 82 transitions. Word has length 29 [2018-06-22 11:20:57,715 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:57,715 INFO ]: Abstraction has 42 states and 82 transitions. [2018-06-22 11:20:57,715 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:20:57,715 INFO ]: Start isEmpty. Operand 42 states and 82 transitions. [2018-06-22 11:20:57,717 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:20:57,717 INFO ]: Found error trace [2018-06-22 11:20:57,717 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:57,717 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:57,717 INFO ]: Analyzing trace with hash 1931532551, now seen corresponding path program 1 times [2018-06-22 11:20:57,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:57,717 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:57,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:57,718 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:57,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:57,734 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:57,799 INFO ]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:20:57,799 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:20:57,799 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:20:57,799 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:20:57,800 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:20:57,800 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:20:57,800 INFO ]: Start difference. First operand 42 states and 82 transitions. Second operand 4 states. [2018-06-22 11:20:57,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:57,909 INFO ]: Finished difference Result 44 states and 83 transitions. [2018-06-22 11:20:57,913 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:20:57,913 INFO ]: Start accepts. Automaton has 4 states. Word has length 33 [2018-06-22 11:20:57,913 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:57,914 INFO ]: With dead ends: 44 [2018-06-22 11:20:57,914 INFO ]: Without dead ends: 44 [2018-06-22 11:20:57,914 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:20:57,914 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:20:57,922 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-06-22 11:20:57,922 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:20:57,927 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 80 transitions. [2018-06-22 11:20:57,927 INFO ]: Start accepts. Automaton has 42 states and 80 transitions. Word has length 33 [2018-06-22 11:20:57,927 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:57,927 INFO ]: Abstraction has 42 states and 80 transitions. [2018-06-22 11:20:57,927 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:20:57,927 INFO ]: Start isEmpty. Operand 42 states and 80 transitions. [2018-06-22 11:20:57,928 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:20:57,928 INFO ]: Found error trace [2018-06-22 11:20:57,928 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:57,928 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:57,929 INFO ]: Analyzing trace with hash -1894171009, now seen corresponding path program 1 times [2018-06-22 11:20:57,929 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:57,929 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:57,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:57,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:57,929 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:57,945 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:58,004 INFO ]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:20:58,004 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:20:58,004 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:20:58,005 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:20:58,005 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:20:58,005 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:20:58,005 INFO ]: Start difference. First operand 42 states and 80 transitions. Second operand 4 states. [2018-06-22 11:20:58,111 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:58,111 INFO ]: Finished difference Result 44 states and 81 transitions. [2018-06-22 11:20:58,111 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:20:58,111 INFO ]: Start accepts. Automaton has 4 states. Word has length 33 [2018-06-22 11:20:58,112 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:58,112 INFO ]: With dead ends: 44 [2018-06-22 11:20:58,112 INFO ]: Without dead ends: 44 [2018-06-22 11:20:58,113 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:20:58,113 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:20:58,118 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-06-22 11:20:58,119 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:20:58,119 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 78 transitions. [2018-06-22 11:20:58,119 INFO ]: Start accepts. Automaton has 42 states and 78 transitions. Word has length 33 [2018-06-22 11:20:58,120 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:58,120 INFO ]: Abstraction has 42 states and 78 transitions. [2018-06-22 11:20:58,120 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:20:58,120 INFO ]: Start isEmpty. Operand 42 states and 78 transitions. [2018-06-22 11:20:58,121 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:20:58,121 INFO ]: Found error trace [2018-06-22 11:20:58,121 INFO ]: trace histogram [7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:58,121 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:58,121 INFO ]: Analyzing trace with hash -857402343, now seen corresponding path program 2 times [2018-06-22 11:20:58,121 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:58,121 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:58,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:58,122 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:20:58,122 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:58,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:58,336 INFO ]: Checked inductivity of 69 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:20:58,336 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:58,336 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:58,344 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:20:58,424 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:20:58,424 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:58,431 INFO ]: Computing forward predicates... [2018-06-22 11:20:58,642 INFO ]: Checked inductivity of 69 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:20:58,662 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:58,662 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-06-22 11:20:58,662 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:20:58,662 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:20:58,662 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:20:58,663 INFO ]: Start difference. First operand 42 states and 78 transitions. Second operand 13 states. [2018-06-22 11:20:58,904 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:58,904 INFO ]: Finished difference Result 37 states and 61 transitions. [2018-06-22 11:20:58,904 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:20:58,904 INFO ]: Start accepts. Automaton has 13 states. Word has length 45 [2018-06-22 11:20:58,905 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:58,905 INFO ]: With dead ends: 37 [2018-06-22 11:20:58,905 INFO ]: Without dead ends: 36 [2018-06-22 11:20:58,905 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:20:58,905 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:20:58,909 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-06-22 11:20:58,909 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:20:58,910 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2018-06-22 11:20:58,910 INFO ]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 45 [2018-06-22 11:20:58,910 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:58,910 INFO ]: Abstraction has 30 states and 44 transitions. [2018-06-22 11:20:58,910 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:20:58,910 INFO ]: Start isEmpty. Operand 30 states and 44 transitions. [2018-06-22 11:20:58,911 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:20:58,911 INFO ]: Found error trace [2018-06-22 11:20:58,911 INFO ]: trace histogram [7, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:58,911 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:58,911 INFO ]: Analyzing trace with hash 633726353, now seen corresponding path program 2 times [2018-06-22 11:20:58,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:58,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:58,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:58,912 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:58,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:58,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:59,033 INFO ]: Checked inductivity of 69 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:20:59,033 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:59,033 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:59,039 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:20:59,080 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:20:59,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:59,086 INFO ]: Computing forward predicates... [2018-06-22 11:20:59,204 INFO ]: Checked inductivity of 69 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:20:59,224 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:59,224 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-06-22 11:20:59,225 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:20:59,225 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:20:59,225 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:20:59,225 INFO ]: Start difference. First operand 30 states and 44 transitions. Second operand 14 states. [2018-06-22 11:20:59,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:20:59,567 INFO ]: Finished difference Result 40 states and 68 transitions. [2018-06-22 11:20:59,567 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:20:59,568 INFO ]: Start accepts. Automaton has 14 states. Word has length 45 [2018-06-22 11:20:59,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:20:59,569 INFO ]: With dead ends: 40 [2018-06-22 11:20:59,569 INFO ]: Without dead ends: 40 [2018-06-22 11:20:59,569 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:20:59,569 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:20:59,574 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-06-22 11:20:59,574 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:20:59,575 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 52 transitions. [2018-06-22 11:20:59,575 INFO ]: Start accepts. Automaton has 33 states and 52 transitions. Word has length 45 [2018-06-22 11:20:59,575 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:20:59,575 INFO ]: Abstraction has 33 states and 52 transitions. [2018-06-22 11:20:59,575 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:20:59,575 INFO ]: Start isEmpty. Operand 33 states and 52 transitions. [2018-06-22 11:20:59,577 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:20:59,577 INFO ]: Found error trace [2018-06-22 11:20:59,577 INFO ]: trace histogram [9, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:20:59,577 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:20:59,577 INFO ]: Analyzing trace with hash -2079239389, now seen corresponding path program 3 times [2018-06-22 11:20:59,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:20:59,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:20:59,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:59,578 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:20:59,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:20:59,598 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:59,670 INFO ]: Checked inductivity of 126 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-06-22 11:20:59,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:20:59,671 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:20:59,689 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:20:59,723 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:20:59,723 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:20:59,727 INFO ]: Computing forward predicates... [2018-06-22 11:20:59,805 INFO ]: Checked inductivity of 126 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-06-22 11:20:59,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:20:59,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-06-22 11:20:59,824 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:20:59,824 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:20:59,824 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:20:59,824 INFO ]: Start difference. First operand 33 states and 52 transitions. Second operand 9 states. [2018-06-22 11:21:00,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:21:00,041 INFO ]: Finished difference Result 39 states and 61 transitions. [2018-06-22 11:21:00,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:21:00,041 INFO ]: Start accepts. Automaton has 9 states. Word has length 57 [2018-06-22 11:21:00,042 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:21:00,042 INFO ]: With dead ends: 39 [2018-06-22 11:21:00,042 INFO ]: Without dead ends: 0 [2018-06-22 11:21:00,042 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:21:00,042 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:21:00,042 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:21:00,042 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:21:00,042 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:21:00,042 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-06-22 11:21:00,042 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:21:00,042 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:21:00,042 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:21:00,042 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:21:00,042 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:21:00,047 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:21:00 BoogieIcfgContainer [2018-06-22 11:21:00,047 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:21:00,048 INFO ]: Toolchain (without parser) took 7463.19 ms. Allocated memory was 308.3 MB in the beginning and 382.7 MB in the end (delta: 74.4 MB). Free memory was 259.7 MB in the beginning and 292.7 MB in the end (delta: -33.0 MB). Peak memory consumption was 41.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:21:00,049 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:21:00,050 INFO ]: ChcToBoogie took 58.66 ms. Allocated memory is still 308.3 MB. Free memory was 259.7 MB in the beginning and 257.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:21:00,050 INFO ]: Boogie Preprocessor took 61.73 ms. Allocated memory is still 308.3 MB. Free memory was 257.7 MB in the beginning and 256.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:21:00,051 INFO ]: RCFGBuilder took 649.11 ms. Allocated memory is still 308.3 MB. Free memory was 256.7 MB in the beginning and 239.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:21:00,051 INFO ]: TraceAbstraction took 6681.58 ms. Allocated memory was 308.3 MB in the beginning and 382.7 MB in the end (delta: 74.4 MB). Free memory was 239.6 MB in the beginning and 292.7 MB in the end (delta: -53.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:21:00,054 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 308.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.66 ms. Allocated memory is still 308.3 MB. Free memory was 259.7 MB in the beginning and 257.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 61.73 ms. Allocated memory is still 308.3 MB. Free memory was 257.7 MB in the beginning and 256.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 649.11 ms. Allocated memory is still 308.3 MB. Free memory was 256.7 MB in the beginning and 239.6 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 6681.58 ms. Allocated memory was 308.3 MB in the beginning and 382.7 MB in the end (delta: 74.4 MB). Free memory was 239.6 MB in the beginning and 292.7 MB in the end (delta: -53.0 MB). Peak memory consumption was 21.4 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. SAFE Result, 6.6s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 495 SDtfs, 45 SDslu, 1531 SDs, 0 SdLazy, 1428 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 25 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 532 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 516 ConstructedInterpolants, 0 QuantifiedInterpolants, 45940 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1285 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 583/675 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/022b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-21-00-065.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-21-00-065.csv Received shutdown request...