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/015-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:17:20,188 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:17:20,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:17:20,202 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:17:20,202 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:17:20,203 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:17:20,204 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:17:20,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:17:20,208 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:17:20,209 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:17:20,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:17:20,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:17:20,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:17:20,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:17:20,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:17:20,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:17:20,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:17:20,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:17:20,219 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:17:20,220 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:17:20,222 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:17:20,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:17:20,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:17:20,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:17:20,226 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:17:20,227 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:17:20,227 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:17:20,228 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:17:20,229 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:17:20,230 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:17:20,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:17:20,231 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:17:20,231 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:17:20,232 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:17:20,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:17:20,233 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:17:20,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:17:20,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:17:20,248 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:17:20,248 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:17:20,249 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:17:20,249 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:17:20,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:17:20,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:17:20,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:17:20,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:17:20,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:17:20,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:17:20,251 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:17:20,252 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:17:20,252 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:17:20,252 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:17:20,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:17:20,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:17:20,253 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:17:20,254 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:17:20,254 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:17:20,299 INFO ]: Repository-Root is: /tmp [2018-06-22 11:17:20,318 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:17:20,323 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:17:20,324 INFO ]: Initializing SmtParser... [2018-06-22 11:17:20,325 INFO ]: SmtParser initialized [2018-06-22 11:17:20,325 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/015-horn.smt2 [2018-06-22 11:17:20,327 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:17:20,417 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/015-horn.smt2 unknown [2018-06-22 11:17:20,648 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/015-horn.smt2 [2018-06-22 11:17:20,652 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:17:20,657 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:17:20,658 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:17:20,658 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:17:20,658 INFO ]: ChcToBoogie initialized [2018-06-22 11:17:20,661 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:20" (1/1) ... [2018-06-22 11:17:20,713 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20 Unit [2018-06-22 11:17:20,714 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:17:20,714 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:17:20,714 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:17:20,714 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:17:20,738 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20" (1/1) ... [2018-06-22 11:17:20,738 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20" (1/1) ... [2018-06-22 11:17:20,746 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20" (1/1) ... [2018-06-22 11:17:20,746 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20" (1/1) ... [2018-06-22 11:17:20,750 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20" (1/1) ... [2018-06-22 11:17:20,754 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20" (1/1) ... [2018-06-22 11:17:20,755 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20" (1/1) ... [2018-06-22 11:17:20,757 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:17:20,758 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:17:20,758 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:17:20,758 INFO ]: RCFGBuilder initialized [2018-06-22 11:17:20,759 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:17:20,775 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:17:20,775 INFO ]: Found specification of procedure False [2018-06-22 11:17:20,775 INFO ]: Found implementation of procedure False [2018-06-22 11:17:20,775 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:17:20,775 INFO ]: Found specification of procedure REC__f [2018-06-22 11:17:20,775 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:17:20,775 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:17:20,775 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:17:20,775 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:17:20,775 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:17:20,775 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:17:20,775 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:17:20,775 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:17:20,775 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:17:20,775 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:17:21,187 INFO ]: Using library mode [2018-06-22 11:17:21,187 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:21 BoogieIcfgContainer [2018-06-22 11:17:21,187 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:17:21,189 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:17:21,189 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:17:21,196 INFO ]: TraceAbstraction initialized [2018-06-22 11:17:21,197 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:17:20" (1/3) ... [2018-06-22 11:17:21,198 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127dbeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:17:21, skipping insertion in model container [2018-06-22 11:17:21,198 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:17:20" (2/3) ... [2018-06-22 11:17:21,198 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127dbeb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:17:21, skipping insertion in model container [2018-06-22 11:17:21,199 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:17:21" (3/3) ... [2018-06-22 11:17:21,201 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:17:21,211 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:17:21,219 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:17:21,260 INFO ]: Using default assertion order modulation [2018-06-22 11:17:21,261 INFO ]: Interprodecural is true [2018-06-22 11:17:21,261 INFO ]: Hoare is false [2018-06-22 11:17:21,261 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:17:21,261 INFO ]: Backedges is TWOTRACK [2018-06-22 11:17:21,261 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:17:21,261 INFO ]: Difference is false [2018-06-22 11:17:21,261 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:17:21,261 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:17:21,274 INFO ]: Start isEmpty. Operand 30 states. [2018-06-22 11:17:21,286 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:17:21,287 INFO ]: Found error trace [2018-06-22 11:17:21,287 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:17:21,287 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:21,291 INFO ]: Analyzing trace with hash 116430984, now seen corresponding path program 1 times [2018-06-22 11:17:21,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:21,293 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:21,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:21,326 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:21,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:21,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:21,357 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:21,358 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:21,359 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:17:21,360 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:17:21,371 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:17:21,372 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:21,374 INFO ]: Start difference. First operand 30 states. Second operand 2 states. [2018-06-22 11:17:21,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:21,400 INFO ]: Finished difference Result 25 states and 40 transitions. [2018-06-22 11:17:21,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:17:21,401 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:17:21,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:21,411 INFO ]: With dead ends: 25 [2018-06-22 11:17:21,412 INFO ]: Without dead ends: 25 [2018-06-22 11:17:21,413 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:17:21,426 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:17:21,449 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 11:17:21,451 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:17:21,453 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2018-06-22 11:17:21,454 INFO ]: Start accepts. Automaton has 25 states and 40 transitions. Word has length 5 [2018-06-22 11:17:21,454 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:21,454 INFO ]: Abstraction has 25 states and 40 transitions. [2018-06-22 11:17:21,454 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:17:21,454 INFO ]: Start isEmpty. Operand 25 states and 40 transitions. [2018-06-22 11:17:21,456 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:21,456 INFO ]: Found error trace [2018-06-22 11:17:21,457 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:21,458 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:21,458 INFO ]: Analyzing trace with hash 1054441263, now seen corresponding path program 1 times [2018-06-22 11:17:21,458 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:21,458 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:21,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:21,459 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:21,459 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:21,493 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:21,575 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:21,575 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:21,575 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:21,577 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:21,577 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:21,577 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:21,578 INFO ]: Start difference. First operand 25 states and 40 transitions. Second operand 4 states. [2018-06-22 11:17:21,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:21,641 INFO ]: Finished difference Result 29 states and 46 transitions. [2018-06-22 11:17:21,642 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:21,642 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:21,642 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:21,643 INFO ]: With dead ends: 29 [2018-06-22 11:17:21,643 INFO ]: Without dead ends: 29 [2018-06-22 11:17:21,644 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:21,644 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:17:21,653 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-06-22 11:17:21,653 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:17:21,654 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 44 transitions. [2018-06-22 11:17:21,655 INFO ]: Start accepts. Automaton has 27 states and 44 transitions. Word has length 9 [2018-06-22 11:17:21,655 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:21,655 INFO ]: Abstraction has 27 states and 44 transitions. [2018-06-22 11:17:21,655 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:21,655 INFO ]: Start isEmpty. Operand 27 states and 44 transitions. [2018-06-22 11:17:21,657 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:17:21,657 INFO ]: Found error trace [2018-06-22 11:17:21,657 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:21,657 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:21,657 INFO ]: Analyzing trace with hash -1437980923, now seen corresponding path program 1 times [2018-06-22 11:17:21,657 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:21,657 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:21,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:21,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:21,658 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:21,668 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:21,743 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:21,743 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:21,743 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:21,743 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:21,743 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:21,743 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:21,744 INFO ]: Start difference. First operand 27 states and 44 transitions. Second operand 4 states. [2018-06-22 11:17:21,854 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:21,854 INFO ]: Finished difference Result 31 states and 49 transitions. [2018-06-22 11:17:21,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:21,855 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:17:21,855 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:21,856 INFO ]: With dead ends: 31 [2018-06-22 11:17:21,856 INFO ]: Without dead ends: 31 [2018-06-22 11:17:21,856 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:21,856 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:17:21,862 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:17:21,862 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:17:21,864 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2018-06-22 11:17:21,864 INFO ]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 9 [2018-06-22 11:17:21,864 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:21,864 INFO ]: Abstraction has 29 states and 47 transitions. [2018-06-22 11:17:21,864 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:21,864 INFO ]: Start isEmpty. Operand 29 states and 47 transitions. [2018-06-22 11:17:21,865 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:21,865 INFO ]: Found error trace [2018-06-22 11:17:21,865 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:21,865 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:21,866 INFO ]: Analyzing trace with hash -1728521167, now seen corresponding path program 1 times [2018-06-22 11:17:21,866 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:21,866 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:21,866 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:21,866 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:21,867 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:21,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:21,984 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:21,984 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:21,984 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:21,985 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:21,985 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:21,987 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:21,987 INFO ]: Start difference. First operand 29 states and 47 transitions. Second operand 4 states. [2018-06-22 11:17:22,188 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:22,188 INFO ]: Finished difference Result 29 states and 45 transitions. [2018-06-22 11:17:22,189 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:22,189 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:22,189 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:22,190 INFO ]: With dead ends: 29 [2018-06-22 11:17:22,190 INFO ]: Without dead ends: 29 [2018-06-22 11:17:22,190 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:22,190 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:17:22,195 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 11:17:22,195 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:17:22,196 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2018-06-22 11:17:22,196 INFO ]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 13 [2018-06-22 11:17:22,196 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:22,196 INFO ]: Abstraction has 29 states and 45 transitions. [2018-06-22 11:17:22,196 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:22,197 INFO ]: Start isEmpty. Operand 29 states and 45 transitions. [2018-06-22 11:17:22,198 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:22,198 INFO ]: Found error trace [2018-06-22 11:17:22,198 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:22,198 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:22,198 INFO ]: Analyzing trace with hash 329789198, now seen corresponding path program 1 times [2018-06-22 11:17:22,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:22,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:22,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:22,199 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:22,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:22,207 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:22,350 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:22,350 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:22,350 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:22,350 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:22,350 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:22,350 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:22,351 INFO ]: Start difference. First operand 29 states and 45 transitions. Second operand 4 states. [2018-06-22 11:17:22,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:22,597 INFO ]: Finished difference Result 35 states and 53 transitions. [2018-06-22 11:17:22,597 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:22,597 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:22,597 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:22,598 INFO ]: With dead ends: 35 [2018-06-22 11:17:22,598 INFO ]: Without dead ends: 35 [2018-06-22 11:17:22,599 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:22,599 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:17:22,606 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-06-22 11:17:22,606 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:17:22,607 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2018-06-22 11:17:22,607 INFO ]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 13 [2018-06-22 11:17:22,607 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:22,607 INFO ]: Abstraction has 31 states and 49 transitions. [2018-06-22 11:17:22,607 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:22,607 INFO ]: Start isEmpty. Operand 31 states and 49 transitions. [2018-06-22 11:17:22,609 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:22,609 INFO ]: Found error trace [2018-06-22 11:17:22,609 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:22,609 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:22,609 INFO ]: Analyzing trace with hash -2125327230, now seen corresponding path program 1 times [2018-06-22 11:17:22,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:22,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:22,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:22,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:22,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:22,623 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:22,677 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:22,677 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:22,677 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:22,677 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:22,677 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:22,677 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:22,677 INFO ]: Start difference. First operand 31 states and 49 transitions. Second operand 4 states. [2018-06-22 11:17:22,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:22,819 INFO ]: Finished difference Result 33 states and 53 transitions. [2018-06-22 11:17:22,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:22,819 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:22,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:22,820 INFO ]: With dead ends: 33 [2018-06-22 11:17:22,820 INFO ]: Without dead ends: 33 [2018-06-22 11:17:22,821 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:22,821 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:17:22,826 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 11:17:22,826 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:17:22,827 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2018-06-22 11:17:22,827 INFO ]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 13 [2018-06-22 11:17:22,827 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:22,828 INFO ]: Abstraction has 33 states and 53 transitions. [2018-06-22 11:17:22,828 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:22,828 INFO ]: Start isEmpty. Operand 33 states and 53 transitions. [2018-06-22 11:17:22,829 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:22,829 INFO ]: Found error trace [2018-06-22 11:17:22,829 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:22,829 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:22,829 INFO ]: Analyzing trace with hash 559089477, now seen corresponding path program 1 times [2018-06-22 11:17:22,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:22,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:22,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:22,830 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:22,830 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:22,841 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:22,875 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:17:22,875 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:22,875 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:22,875 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:22,875 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:22,875 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:22,875 INFO ]: Start difference. First operand 33 states and 53 transitions. Second operand 4 states. [2018-06-22 11:17:23,001 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:23,001 INFO ]: Finished difference Result 37 states and 57 transitions. [2018-06-22 11:17:23,002 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:23,002 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:17:23,002 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:23,002 INFO ]: With dead ends: 37 [2018-06-22 11:17:23,002 INFO ]: Without dead ends: 37 [2018-06-22 11:17:23,003 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:23,003 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:17:23,007 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-06-22 11:17:23,007 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:17:23,008 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 53 transitions. [2018-06-22 11:17:23,008 INFO ]: Start accepts. Automaton has 33 states and 53 transitions. Word has length 13 [2018-06-22 11:17:23,008 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:23,008 INFO ]: Abstraction has 33 states and 53 transitions. [2018-06-22 11:17:23,009 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:23,009 INFO ]: Start isEmpty. Operand 33 states and 53 transitions. [2018-06-22 11:17:23,010 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:17:23,010 INFO ]: Found error trace [2018-06-22 11:17:23,010 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:23,010 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:23,010 INFO ]: Analyzing trace with hash -1949090760, now seen corresponding path program 1 times [2018-06-22 11:17:23,010 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:23,010 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:23,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:23,011 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:23,011 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:23,032 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:23,140 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:23,140 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:23,140 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:23,154 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:23,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:23,207 INFO ]: Computing forward predicates... [2018-06-22 11:17:23,596 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 11:17:23,717 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:23,741 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:23,742 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:17:23,742 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:17:23,742 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:17:23,742 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:17:23,742 INFO ]: Start difference. First operand 33 states and 53 transitions. Second operand 10 states. [2018-06-22 11:17:24,253 WARN ]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-22 11:17:24,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:24,467 INFO ]: Finished difference Result 39 states and 59 transitions. [2018-06-22 11:17:24,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:17:24,470 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:17:24,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:24,471 INFO ]: With dead ends: 39 [2018-06-22 11:17:24,471 INFO ]: Without dead ends: 39 [2018-06-22 11:17:24,472 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:17:24,472 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:17:24,476 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-06-22 11:17:24,477 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:17:24,477 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. [2018-06-22 11:17:24,477 INFO ]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 13 [2018-06-22 11:17:24,478 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:24,478 INFO ]: Abstraction has 35 states and 55 transitions. [2018-06-22 11:17:24,478 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:17:24,478 INFO ]: Start isEmpty. Operand 35 states and 55 transitions. [2018-06-22 11:17:24,479 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:24,479 INFO ]: Found error trace [2018-06-22 11:17:24,479 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:24,479 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:24,479 INFO ]: Analyzing trace with hash 2053047041, now seen corresponding path program 1 times [2018-06-22 11:17:24,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:24,479 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:24,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:24,480 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:24,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:24,495 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:24,580 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:24,580 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:24,580 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:17:24,580 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:17:24,580 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:17:24,580 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:17:24,580 INFO ]: Start difference. First operand 35 states and 55 transitions. Second operand 5 states. [2018-06-22 11:17:24,713 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:24,713 INFO ]: Finished difference Result 43 states and 63 transitions. [2018-06-22 11:17:24,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:24,714 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:17:24,714 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:24,715 INFO ]: With dead ends: 43 [2018-06-22 11:17:24,715 INFO ]: Without dead ends: 38 [2018-06-22 11:17:24,715 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:17:24,715 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:17:24,724 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-06-22 11:17:24,724 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:17:24,725 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2018-06-22 11:17:24,725 INFO ]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 17 [2018-06-22 11:17:24,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:24,725 INFO ]: Abstraction has 34 states and 50 transitions. [2018-06-22 11:17:24,725 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:17:24,725 INFO ]: Start isEmpty. Operand 34 states and 50 transitions. [2018-06-22 11:17:24,726 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:24,726 INFO ]: Found error trace [2018-06-22 11:17:24,726 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:24,726 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:24,726 INFO ]: Analyzing trace with hash -927684232, now seen corresponding path program 1 times [2018-06-22 11:17:24,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:24,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:24,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:24,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:24,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:24,735 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:24,787 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:24,787 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:24,787 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:17:24,787 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:17:24,787 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:17:24,787 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:17:24,787 INFO ]: Start difference. First operand 34 states and 50 transitions. Second operand 5 states. [2018-06-22 11:17:24,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:24,832 INFO ]: Finished difference Result 40 states and 56 transitions. [2018-06-22 11:17:24,832 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:17:24,832 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:17:24,832 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:24,833 INFO ]: With dead ends: 40 [2018-06-22 11:17:24,833 INFO ]: Without dead ends: 31 [2018-06-22 11:17:24,833 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:17:24,833 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:17:24,837 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-06-22 11:17:24,837 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:17:24,837 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2018-06-22 11:17:24,838 INFO ]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 17 [2018-06-22 11:17:24,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:24,838 INFO ]: Abstraction has 29 states and 42 transitions. [2018-06-22 11:17:24,838 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:17:24,838 INFO ]: Start isEmpty. Operand 29 states and 42 transitions. [2018-06-22 11:17:24,839 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:24,839 INFO ]: Found error trace [2018-06-22 11:17:24,839 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:24,839 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:24,839 INFO ]: Analyzing trace with hash -1812238933, now seen corresponding path program 2 times [2018-06-22 11:17:24,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:24,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:24,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:24,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:17:24,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:24,849 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:25,006 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:25,006 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:17:25,006 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-22 11:17:25,025 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:17:25,052 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:17:25,052 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:25,055 INFO ]: Computing forward predicates... [2018-06-22 11:17:25,497 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:17:25,526 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:17:25,526 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:17:25,527 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:17:25,527 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:17:25,527 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:17:25,527 INFO ]: Start difference. First operand 29 states and 42 transitions. Second operand 14 states. [2018-06-22 11:17:25,887 WARN ]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2018-06-22 11:17:26,115 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-06-22 11:17:26,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:26,183 INFO ]: Finished difference Result 35 states and 48 transitions. [2018-06-22 11:17:26,183 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:17:26,183 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:17:26,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:26,184 INFO ]: With dead ends: 35 [2018-06-22 11:17:26,184 INFO ]: Without dead ends: 27 [2018-06-22 11:17:26,184 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:17:26,184 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:17:26,187 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:17:26,187 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:17:26,188 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-06-22 11:17:26,188 INFO ]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 17 [2018-06-22 11:17:26,188 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:26,188 INFO ]: Abstraction has 25 states and 37 transitions. [2018-06-22 11:17:26,188 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:17:26,188 INFO ]: Start isEmpty. Operand 25 states and 37 transitions. [2018-06-22 11:17:26,189 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:17:26,189 INFO ]: Found error trace [2018-06-22 11:17:26,189 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:17:26,189 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:17:26,189 INFO ]: Analyzing trace with hash 612241380, now seen corresponding path program 1 times [2018-06-22 11:17:26,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:17:26,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:17:26,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:26,190 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:17:26,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:17:26,195 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:17:26,288 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:17:26,288 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:17:26,288 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:17:26,288 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:17:26,289 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:17:26,289 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:26,289 INFO ]: Start difference. First operand 25 states and 37 transitions. Second operand 4 states. [2018-06-22 11:17:26,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:17:26,300 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-22 11:17:26,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:17:26,300 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:17:26,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:17:26,300 INFO ]: With dead ends: 13 [2018-06-22 11:17:26,300 INFO ]: Without dead ends: 0 [2018-06-22 11:17:26,301 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:17:26,301 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:17:26,301 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:17:26,301 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:17:26,301 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:17:26,301 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 11:17:26,302 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:17:26,302 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:17:26,302 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:17:26,302 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:17:26,302 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:17:26,307 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:17:26 BoogieIcfgContainer [2018-06-22 11:17:26,307 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:17:26,308 INFO ]: Toolchain (without parser) took 5655.31 ms. Allocated memory was 302.5 MB in the beginning and 339.7 MB in the end (delta: 37.2 MB). Free memory was 257.9 MB in the beginning and 268.7 MB in the end (delta: -10.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:26,308 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:17:26,309 INFO ]: ChcToBoogie took 56.23 ms. Allocated memory is still 302.5 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:26,309 INFO ]: Boogie Preprocessor took 42.75 ms. Allocated memory is still 302.5 MB. Free memory was 254.9 MB in the beginning and 253.9 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-22 11:17:26,310 INFO ]: RCFGBuilder took 429.94 ms. Allocated memory is still 302.5 MB. Free memory was 253.9 MB in the beginning and 242.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:26,310 INFO ]: TraceAbstraction took 5117.86 ms. Allocated memory was 302.5 MB in the beginning and 339.7 MB in the end (delta: 37.2 MB). Free memory was 242.9 MB in the beginning and 268.7 MB in the end (delta: -25.8 MB). Peak memory consumption was 11.4 MB. Max. memory is 3.6 GB. [2018-06-22 11:17:26,313 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.5 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.23 ms. Allocated memory is still 302.5 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.75 ms. Allocated memory is still 302.5 MB. Free memory was 254.9 MB in the beginning and 253.9 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 429.94 ms. Allocated memory is still 302.5 MB. Free memory was 253.9 MB in the beginning and 242.9 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 5117.86 ms. Allocated memory was 302.5 MB in the beginning and 339.7 MB in the end (delta: 37.2 MB). Free memory was 242.9 MB in the beginning and 268.7 MB in the end (delta: -25.8 MB). Peak memory consumption was 11.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 5 procedures, 30 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 439 SDtfs, 34 SDslu, 985 SDs, 0 SdLazy, 374 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=8, 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, 12 MinimizatonAttempts, 24 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 172 ConstructedInterpolants, 4 QuantifiedInterpolants, 13212 SizeOfPredicates, 24 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 20/38 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/015-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-17-26-324.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/015-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-17-26-324.csv Received shutdown request...