java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/termination/Ackermann05.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:35:21,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:35:21,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:35:21,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:35:21,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:35:21,369 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:35:21,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:35:21,372 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:35:21,373 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:35:21,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:35:21,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:35:21,377 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:35:21,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:35:21,379 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:35:21,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:35:21,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:35:21,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:35:21,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:35:21,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:35:21,395 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:35:21,396 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:35:21,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:35:21,402 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:35:21,402 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:35:21,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:35:21,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:35:21,405 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:35:21,406 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:35:21,407 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:35:21,407 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:35:21,407 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:35:21,408 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:35:21,408 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:35:21,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:35:21,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:35:21,415 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:35:21,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:35:21,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:35:21,429 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:35:21,430 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:35:21,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:35:21,431 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:35:21,431 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:35:21,431 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:35:21,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:35:21,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:35:21,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:35:21,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:35:21,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:35:21,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:35:21,432 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:35:21,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:35:21,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:35:21,433 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:35:21,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:35:21,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:35:21,434 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:35:21,435 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:35:21,435 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:35:21,481 INFO ]: Repository-Root is: /tmp [2018-06-25 09:35:21,496 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:35:21,499 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:35:21,501 INFO ]: Initializing SmtParser... [2018-06-25 09:35:21,501 INFO ]: SmtParser initialized [2018-06-25 09:35:21,501 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/termination/Ackermann05.smt2 [2018-06-25 09:35:21,503 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:35:21,594 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/termination/Ackermann05.smt2 unknown [2018-06-25 09:35:22,240 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/termination/Ackermann05.smt2 [2018-06-25 09:35:22,247 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:35:22,253 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:35:22,254 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:35:22,254 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:35:22,254 INFO ]: ChcToBoogie initialized [2018-06-25 09:35:22,257 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:35:22" (1/1) ... [2018-06-25 09:35:22,329 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22 Unit [2018-06-25 09:35:22,329 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:35:22,330 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:35:22,330 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:35:22,330 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:35:22,350 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22" (1/1) ... [2018-06-25 09:35:22,350 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22" (1/1) ... [2018-06-25 09:35:22,363 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22" (1/1) ... [2018-06-25 09:35:22,363 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22" (1/1) ... [2018-06-25 09:35:22,373 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22" (1/1) ... [2018-06-25 09:35:22,376 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22" (1/1) ... [2018-06-25 09:35:22,380 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22" (1/1) ... [2018-06-25 09:35:22,384 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:35:22,385 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:35:22,385 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:35:22,385 INFO ]: RCFGBuilder initialized [2018-06-25 09:35:22,385 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:35:22,418 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:35:22,418 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:35:22,418 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:35:22,418 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:35:22,418 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:35:22,418 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:35:23,517 INFO ]: Using library mode [2018-06-25 09:35:23,517 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:35:23 BoogieIcfgContainer [2018-06-25 09:35:23,517 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:35:23,519 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:35:23,519 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:35:23,522 INFO ]: TraceAbstraction initialized [2018-06-25 09:35:23,522 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:35:22" (1/3) ... [2018-06-25 09:35:23,523 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa763df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:35:23, skipping insertion in model container [2018-06-25 09:35:23,523 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:35:22" (2/3) ... [2018-06-25 09:35:23,523 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa763df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:35:23, skipping insertion in model container [2018-06-25 09:35:23,523 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:35:23" (3/3) ... [2018-06-25 09:35:23,531 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:35:23,539 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:35:23,546 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:35:23,592 INFO ]: Using default assertion order modulation [2018-06-25 09:35:23,593 INFO ]: Interprodecural is true [2018-06-25 09:35:23,593 INFO ]: Hoare is false [2018-06-25 09:35:23,593 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:35:23,593 INFO ]: Backedges is TWOTRACK [2018-06-25 09:35:23,593 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:35:23,593 INFO ]: Difference is false [2018-06-25 09:35:23,593 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:35:23,593 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:35:23,611 INFO ]: Start isEmpty. Operand 51 states. [2018-06-25 09:35:23,627 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:35:23,628 INFO ]: Found error trace [2018-06-25 09:35:23,628 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:23,628 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:23,634 INFO ]: Analyzing trace with hash 585234423, now seen corresponding path program 1 times [2018-06-25 09:35:23,636 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:23,636 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:23,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:23,678 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:23,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:23,729 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:23,920 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:35:23,922 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:35:23,922 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:35:23,923 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:35:23,933 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:35:23,934 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:35:23,936 INFO ]: Start difference. First operand 51 states. Second operand 4 states. [2018-06-25 09:35:24,682 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:24,682 INFO ]: Finished difference Result 75 states and 120 transitions. [2018-06-25 09:35:24,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:35:24,683 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:35:24,683 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:24,696 INFO ]: With dead ends: 75 [2018-06-25 09:35:24,696 INFO ]: Without dead ends: 61 [2018-06-25 09:35:24,698 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-25 09:35:24,711 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-25 09:35:24,744 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-06-25 09:35:24,745 INFO ]: Start removeUnreachable. Operand 61 states. [2018-06-25 09:35:24,749 INFO ]: Finished removeUnreachable. Reduced from 61 states to 61 states and 96 transitions. [2018-06-25 09:35:24,751 INFO ]: Start accepts. Automaton has 61 states and 96 transitions. Word has length 11 [2018-06-25 09:35:24,752 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:24,752 INFO ]: Abstraction has 61 states and 96 transitions. [2018-06-25 09:35:24,752 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:35:24,752 INFO ]: Start isEmpty. Operand 61 states and 96 transitions. [2018-06-25 09:35:24,755 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:35:24,755 INFO ]: Found error trace [2018-06-25 09:35:24,755 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:24,755 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:24,756 INFO ]: Analyzing trace with hash -1261489994, now seen corresponding path program 1 times [2018-06-25 09:35:24,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:24,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:24,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:24,759 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:24,759 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:24,786 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:24,850 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:35:24,850 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:35:24,850 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:35:24,851 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:35:24,852 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:35:24,852 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:35:24,852 INFO ]: Start difference. First operand 61 states and 96 transitions. Second operand 4 states. [2018-06-25 09:35:25,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:25,258 INFO ]: Finished difference Result 81 states and 127 transitions. [2018-06-25 09:35:25,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:35:25,258 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-25 09:35:25,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:25,262 INFO ]: With dead ends: 81 [2018-06-25 09:35:25,262 INFO ]: Without dead ends: 81 [2018-06-25 09:35:25,263 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-25 09:35:25,263 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-25 09:35:25,275 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-06-25 09:35:25,275 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-25 09:35:25,277 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2018-06-25 09:35:25,277 INFO ]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 13 [2018-06-25 09:35:25,277 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:25,277 INFO ]: Abstraction has 81 states and 127 transitions. [2018-06-25 09:35:25,277 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:35:25,278 INFO ]: Start isEmpty. Operand 81 states and 127 transitions. [2018-06-25 09:35:25,282 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 09:35:25,282 INFO ]: Found error trace [2018-06-25 09:35:25,282 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:25,282 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:25,283 INFO ]: Analyzing trace with hash -33279464, now seen corresponding path program 1 times [2018-06-25 09:35:25,283 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:25,283 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:25,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:25,283 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:25,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:25,295 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:25,387 INFO ]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:35:25,387 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:35:25,387 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:35:25,398 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:25,452 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:25,463 INFO ]: Computing forward predicates... [2018-06-25 09:35:25,491 INFO ]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:35:25,528 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:35:25,528 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:35:25,529 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:35:25,529 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:35:25,529 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:35:25,529 INFO ]: Start difference. First operand 81 states and 127 transitions. Second operand 4 states. [2018-06-25 09:35:25,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:25,986 INFO ]: Finished difference Result 91 states and 142 transitions. [2018-06-25 09:35:25,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:35:25,987 INFO ]: Start accepts. Automaton has 4 states. Word has length 26 [2018-06-25 09:35:25,987 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:25,990 INFO ]: With dead ends: 91 [2018-06-25 09:35:25,990 INFO ]: Without dead ends: 81 [2018-06-25 09:35:25,990 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 28 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-25 09:35:25,990 INFO ]: Start minimizeSevpa. Operand 81 states. [2018-06-25 09:35:26,002 INFO ]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-06-25 09:35:26,003 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-25 09:35:26,004 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2018-06-25 09:35:26,004 INFO ]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 26 [2018-06-25 09:35:26,005 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:26,005 INFO ]: Abstraction has 81 states and 126 transitions. [2018-06-25 09:35:26,005 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:35:26,005 INFO ]: Start isEmpty. Operand 81 states and 126 transitions. [2018-06-25 09:35:26,009 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:35:26,009 INFO ]: Found error trace [2018-06-25 09:35:26,009 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:26,009 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:26,009 INFO ]: Analyzing trace with hash 424902100, now seen corresponding path program 1 times [2018-06-25 09:35:26,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:26,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:26,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:26,010 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:26,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:26,047 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:26,204 INFO ]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-25 09:35:26,204 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:35:26,204 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 09:35:26,204 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:35:26,204 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:35:26,205 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:35:26,205 INFO ]: Start difference. First operand 81 states and 126 transitions. Second operand 7 states. [2018-06-25 09:35:27,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:27,259 INFO ]: Finished difference Result 166 states and 363 transitions. [2018-06-25 09:35:27,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:35:27,259 INFO ]: Start accepts. Automaton has 7 states. Word has length 28 [2018-06-25 09:35:27,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:27,267 INFO ]: With dead ends: 166 [2018-06-25 09:35:27,267 INFO ]: Without dead ends: 109 [2018-06-25 09:35:27,268 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:35:27,268 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-25 09:35:27,291 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 85. [2018-06-25 09:35:27,292 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-25 09:35:27,294 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 137 transitions. [2018-06-25 09:35:27,294 INFO ]: Start accepts. Automaton has 85 states and 137 transitions. Word has length 28 [2018-06-25 09:35:27,294 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:27,294 INFO ]: Abstraction has 85 states and 137 transitions. [2018-06-25 09:35:27,294 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:35:27,294 INFO ]: Start isEmpty. Operand 85 states and 137 transitions. [2018-06-25 09:35:27,296 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:35:27,296 INFO ]: Found error trace [2018-06-25 09:35:27,296 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:27,296 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:27,296 INFO ]: Analyzing trace with hash -348516516, now seen corresponding path program 1 times [2018-06-25 09:35:27,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:27,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:27,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:27,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:27,297 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:27,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:27,403 INFO ]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-25 09:35:27,403 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:35:27,403 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 09:35:27,403 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:35:27,403 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:35:27,403 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:35:27,404 INFO ]: Start difference. First operand 85 states and 137 transitions. Second operand 5 states. [2018-06-25 09:35:27,631 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:27,631 INFO ]: Finished difference Result 118 states and 262 transitions. [2018-06-25 09:35:27,632 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:35:27,632 INFO ]: Start accepts. Automaton has 5 states. Word has length 29 [2018-06-25 09:35:27,632 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:27,638 INFO ]: With dead ends: 118 [2018-06-25 09:35:27,638 INFO ]: Without dead ends: 118 [2018-06-25 09:35:27,638 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:35:27,639 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-25 09:35:27,662 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 93. [2018-06-25 09:35:27,662 INFO ]: Start removeUnreachable. Operand 93 states. [2018-06-25 09:35:27,664 INFO ]: Finished removeUnreachable. Reduced from 93 states to 93 states and 161 transitions. [2018-06-25 09:35:27,664 INFO ]: Start accepts. Automaton has 93 states and 161 transitions. Word has length 29 [2018-06-25 09:35:27,664 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:27,664 INFO ]: Abstraction has 93 states and 161 transitions. [2018-06-25 09:35:27,664 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:35:27,665 INFO ]: Start isEmpty. Operand 93 states and 161 transitions. [2018-06-25 09:35:27,666 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 09:35:27,666 INFO ]: Found error trace [2018-06-25 09:35:27,666 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:27,666 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:27,667 INFO ]: Analyzing trace with hash 2059779701, now seen corresponding path program 1 times [2018-06-25 09:35:27,667 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:27,667 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:27,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:27,667 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:27,667 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:27,690 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:27,788 INFO ]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:35:27,788 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:35:27,788 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:35:27,788 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:35:27,789 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:35:27,789 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:35:27,789 INFO ]: Start difference. First operand 93 states and 161 transitions. Second operand 4 states. [2018-06-25 09:35:28,714 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:28,714 INFO ]: Finished difference Result 153 states and 276 transitions. [2018-06-25 09:35:28,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:35:28,715 INFO ]: Start accepts. Automaton has 4 states. Word has length 30 [2018-06-25 09:35:28,715 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:28,717 INFO ]: With dead ends: 153 [2018-06-25 09:35:28,717 INFO ]: Without dead ends: 114 [2018-06-25 09:35:28,718 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:35:28,718 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-25 09:35:28,742 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-06-25 09:35:28,742 INFO ]: Start removeUnreachable. Operand 114 states. [2018-06-25 09:35:28,744 INFO ]: Finished removeUnreachable. Reduced from 114 states to 114 states and 191 transitions. [2018-06-25 09:35:28,744 INFO ]: Start accepts. Automaton has 114 states and 191 transitions. Word has length 30 [2018-06-25 09:35:28,744 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:28,744 INFO ]: Abstraction has 114 states and 191 transitions. [2018-06-25 09:35:28,744 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:35:28,744 INFO ]: Start isEmpty. Operand 114 states and 191 transitions. [2018-06-25 09:35:28,755 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 09:35:28,755 INFO ]: Found error trace [2018-06-25 09:35:28,755 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:28,755 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:28,755 INFO ]: Analyzing trace with hash -106907881, now seen corresponding path program 1 times [2018-06-25 09:35:28,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:28,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:28,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:28,756 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:28,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:28,785 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:28,945 INFO ]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-25 09:35:28,945 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:35:28,945 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-25 09:35:28,953 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:29,042 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:29,046 INFO ]: Computing forward predicates... [2018-06-25 09:35:29,100 INFO ]: Checked inductivity of 28 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:35:29,129 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:35:29,129 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2018-06-25 09:35:29,130 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:35:29,130 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:35:29,130 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:35:29,131 INFO ]: Start difference. First operand 114 states and 191 transitions. Second operand 10 states. [2018-06-25 09:35:30,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:30,272 INFO ]: Finished difference Result 200 states and 422 transitions. [2018-06-25 09:35:30,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:35:30,272 INFO ]: Start accepts. Automaton has 10 states. Word has length 40 [2018-06-25 09:35:30,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:30,278 INFO ]: With dead ends: 200 [2018-06-25 09:35:30,278 INFO ]: Without dead ends: 200 [2018-06-25 09:35:30,278 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-06-25 09:35:30,279 INFO ]: Start minimizeSevpa. Operand 200 states. [2018-06-25 09:35:30,301 INFO ]: Finished minimizeSevpa. Reduced states from 200 to 150. [2018-06-25 09:35:30,301 INFO ]: Start removeUnreachable. Operand 150 states. [2018-06-25 09:35:30,304 INFO ]: Finished removeUnreachable. Reduced from 150 states to 150 states and 256 transitions. [2018-06-25 09:35:30,304 INFO ]: Start accepts. Automaton has 150 states and 256 transitions. Word has length 40 [2018-06-25 09:35:30,304 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:30,304 INFO ]: Abstraction has 150 states and 256 transitions. [2018-06-25 09:35:30,304 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:35:30,304 INFO ]: Start isEmpty. Operand 150 states and 256 transitions. [2018-06-25 09:35:30,307 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 09:35:30,307 INFO ]: Found error trace [2018-06-25 09:35:30,307 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:30,307 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:30,307 INFO ]: Analyzing trace with hash 738367281, now seen corresponding path program 1 times [2018-06-25 09:35:30,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:30,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:30,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:30,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:30,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:30,332 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:30,389 INFO ]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-25 09:35:30,389 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:35:30,389 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:35:30,389 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:35:30,389 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:35:30,389 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:35:30,389 INFO ]: Start difference. First operand 150 states and 256 transitions. Second operand 3 states. [2018-06-25 09:35:30,428 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:30,428 INFO ]: Finished difference Result 174 states and 310 transitions. [2018-06-25 09:35:30,428 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:35:30,428 INFO ]: Start accepts. Automaton has 3 states. Word has length 41 [2018-06-25 09:35:30,429 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:30,432 INFO ]: With dead ends: 174 [2018-06-25 09:35:30,432 INFO ]: Without dead ends: 174 [2018-06-25 09:35:30,433 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:35:30,433 INFO ]: Start minimizeSevpa. Operand 174 states. [2018-06-25 09:35:30,446 INFO ]: Finished minimizeSevpa. Reduced states from 174 to 156. [2018-06-25 09:35:30,446 INFO ]: Start removeUnreachable. Operand 156 states. [2018-06-25 09:35:30,449 INFO ]: Finished removeUnreachable. Reduced from 156 states to 156 states and 268 transitions. [2018-06-25 09:35:30,449 INFO ]: Start accepts. Automaton has 156 states and 268 transitions. Word has length 41 [2018-06-25 09:35:30,449 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:30,449 INFO ]: Abstraction has 156 states and 268 transitions. [2018-06-25 09:35:30,449 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:35:30,449 INFO ]: Start isEmpty. Operand 156 states and 268 transitions. [2018-06-25 09:35:30,452 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 09:35:30,452 INFO ]: Found error trace [2018-06-25 09:35:30,452 INFO ]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:30,452 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:30,452 INFO ]: Analyzing trace with hash 53822035, now seen corresponding path program 2 times [2018-06-25 09:35:30,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:30,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:30,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:30,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:30,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:30,479 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:30,672 INFO ]: Checked inductivity of 37 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-25 09:35:30,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:35:30,672 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:35:30,679 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:35:30,774 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:35:30,774 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:30,779 INFO ]: Computing forward predicates... [2018-06-25 09:35:30,939 INFO ]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-25 09:35:30,964 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:35:30,965 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 14 [2018-06-25 09:35:30,965 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:35:30,965 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:35:30,965 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:35:30,965 INFO ]: Start difference. First operand 156 states and 268 transitions. Second operand 14 states. [2018-06-25 09:35:33,975 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:33,975 INFO ]: Finished difference Result 557 states and 1991 transitions. [2018-06-25 09:35:33,975 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 09:35:33,975 INFO ]: Start accepts. Automaton has 14 states. Word has length 42 [2018-06-25 09:35:33,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:34,003 INFO ]: With dead ends: 557 [2018-06-25 09:35:34,003 INFO ]: Without dead ends: 556 [2018-06-25 09:35:34,004 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1617, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 09:35:34,005 INFO ]: Start minimizeSevpa. Operand 556 states. [2018-06-25 09:35:34,105 INFO ]: Finished minimizeSevpa. Reduced states from 556 to 390. [2018-06-25 09:35:34,105 INFO ]: Start removeUnreachable. Operand 390 states. [2018-06-25 09:35:34,115 INFO ]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1083 transitions. [2018-06-25 09:35:34,115 INFO ]: Start accepts. Automaton has 390 states and 1083 transitions. Word has length 42 [2018-06-25 09:35:34,116 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:34,116 INFO ]: Abstraction has 390 states and 1083 transitions. [2018-06-25 09:35:34,116 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:35:34,116 INFO ]: Start isEmpty. Operand 390 states and 1083 transitions. [2018-06-25 09:35:34,125 INFO ]: Finished isEmpty. Found accepting run of length 57 [2018-06-25 09:35:34,125 INFO ]: Found error trace [2018-06-25 09:35:34,125 INFO ]: trace histogram [4, 4, 4, 4, 4, 4, 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-25 09:35:34,125 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:34,125 INFO ]: Analyzing trace with hash -1782991009, now seen corresponding path program 1 times [2018-06-25 09:35:34,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:34,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:34,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:34,126 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:35:34,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:34,145 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:34,260 INFO ]: Checked inductivity of 69 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-25 09:35:34,260 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:35:34,260 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) [2018-06-25 09:35:34,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:35:34,345 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:34,349 INFO ]: Computing forward predicates... [2018-06-25 09:35:34,359 INFO ]: Checked inductivity of 69 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-25 09:35:34,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:35:34,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:35:34,378 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:35:34,378 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:35:34,379 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:35:34,379 INFO ]: Start difference. First operand 390 states and 1083 transitions. Second operand 4 states. [2018-06-25 09:35:34,644 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:34,644 INFO ]: Finished difference Result 544 states and 1519 transitions. [2018-06-25 09:35:34,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:35:34,645 INFO ]: Start accepts. Automaton has 4 states. Word has length 56 [2018-06-25 09:35:34,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:34,660 INFO ]: With dead ends: 544 [2018-06-25 09:35:34,660 INFO ]: Without dead ends: 390 [2018-06-25 09:35:34,660 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 58 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-25 09:35:34,661 INFO ]: Start minimizeSevpa. Operand 390 states. [2018-06-25 09:35:34,711 INFO ]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-06-25 09:35:34,711 INFO ]: Start removeUnreachable. Operand 390 states. [2018-06-25 09:35:34,718 INFO ]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1075 transitions. [2018-06-25 09:35:34,719 INFO ]: Start accepts. Automaton has 390 states and 1075 transitions. Word has length 56 [2018-06-25 09:35:34,719 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:34,719 INFO ]: Abstraction has 390 states and 1075 transitions. [2018-06-25 09:35:34,719 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:35:34,719 INFO ]: Start isEmpty. Operand 390 states and 1075 transitions. [2018-06-25 09:35:34,735 INFO ]: Finished isEmpty. Found accepting run of length 79 [2018-06-25 09:35:34,735 INFO ]: Found error trace [2018-06-25 09:35:34,735 INFO ]: trace histogram [6, 6, 6, 6, 6, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:35:34,735 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:35:34,735 INFO ]: Analyzing trace with hash -1820662517, now seen corresponding path program 1 times [2018-06-25 09:35:34,735 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:35:34,735 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:35:34,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:34,736 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:34,736 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:35:34,752 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:34,883 INFO ]: Checked inductivity of 177 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-25 09:35:34,883 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:35:34,883 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-25 09:35:34,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:35:35,015 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:35:35,022 INFO ]: Computing forward predicates... [2018-06-25 09:35:35,041 INFO ]: Checked inductivity of 177 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-06-25 09:35:35,061 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:35:35,062 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:35:35,062 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:35:35,062 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:35:35,062 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:35:35,062 INFO ]: Start difference. First operand 390 states and 1075 transitions. Second operand 4 states. [2018-06-25 09:35:35,370 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:35:35,370 INFO ]: Finished difference Result 430 states and 999 transitions. [2018-06-25 09:35:35,371 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:35:35,371 INFO ]: Start accepts. Automaton has 4 states. Word has length 78 [2018-06-25 09:35:35,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:35:35,371 INFO ]: With dead ends: 430 [2018-06-25 09:35:35,371 INFO ]: Without dead ends: 0 [2018-06-25 09:35:35,372 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 80 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-25 09:35:35,372 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 09:35:35,372 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 09:35:35,372 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 09:35:35,372 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 09:35:35,372 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-06-25 09:35:35,372 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:35:35,372 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 09:35:35,372 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:35:35,372 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 09:35:35,372 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 09:35:35,377 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:35:35 BoogieIcfgContainer [2018-06-25 09:35:35,377 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:35:35,378 INFO ]: Toolchain (without parser) took 13130.36 ms. Allocated memory was 302.0 MB in the beginning and 486.5 MB in the end (delta: 184.5 MB). Free memory was 230.5 MB in the beginning and 322.0 MB in the end (delta: -91.5 MB). Peak memory consumption was 93.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:35,380 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:35:35,380 INFO ]: ChcToBoogie took 75.71 ms. Allocated memory is still 302.0 MB. Free memory was 228.5 MB in the beginning and 226.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:35,380 INFO ]: Boogie Preprocessor took 54.44 ms. Allocated memory is still 302.0 MB. Free memory was 226.5 MB in the beginning and 224.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:35,381 INFO ]: RCFGBuilder took 1133.02 ms. Allocated memory was 302.0 MB in the beginning and 321.4 MB in the end (delta: 19.4 MB). Free memory was 224.5 MB in the beginning and 287.3 MB in the end (delta: -62.8 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:35,381 INFO ]: TraceAbstraction took 11858.57 ms. Allocated memory was 321.4 MB in the beginning and 486.5 MB in the end (delta: 165.2 MB). Free memory was 285.0 MB in the beginning and 322.0 MB in the end (delta: -37.0 MB). Peak memory consumption was 128.2 MB. Max. memory is 3.6 GB. [2018-06-25 09:35:35,383 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.0 MB. Free memory is still 266.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 75.71 ms. Allocated memory is still 302.0 MB. Free memory was 228.5 MB in the beginning and 226.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 54.44 ms. Allocated memory is still 302.0 MB. Free memory was 226.5 MB in the beginning and 224.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1133.02 ms. Allocated memory was 302.0 MB in the beginning and 321.4 MB in the end (delta: 19.4 MB). Free memory was 224.5 MB in the beginning and 287.3 MB in the end (delta: -62.8 MB). Peak memory consumption was 49.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 11858.57 ms. Allocated memory was 321.4 MB in the beginning and 486.5 MB in the end (delta: 165.2 MB). Free memory was 285.0 MB in the beginning and 322.0 MB in the end (delta: -37.0 MB). Peak memory consumption was 128.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. SAFE Result, 11.7s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 933 SDtfs, 1027 SDslu, 1822 SDs, 0 SdLazy, 3915 SolverSat, 1669 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=9, 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.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 283 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 636 NumberOfCodeBlocks, 636 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 44159 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2803 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 647/699 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/Ackermann05.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-35-35-398.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/Ackermann05.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-35-35-398.csv Received shutdown request...