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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/022-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:32:45,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:32:45,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:32:45,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:32:45,458 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:32:45,460 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:32:45,461 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:32:45,464 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:32:45,465 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:32:45,466 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:32:45,467 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:32:45,467 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:32:45,468 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:32:45,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:32:45,470 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:32:45,471 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:32:45,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:32:45,474 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:32:45,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:32:45,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:32:45,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:32:45,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:32:45,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:32:45,480 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:32:45,481 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:32:45,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:32:45,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:32:45,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:32:45,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:32:45,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:32:45,485 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:32:45,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:32:45,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:32:45,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:32:45,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:32:45,488 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:32:45,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:32:45,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:32:45,501 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:32:45,501 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:32:45,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:32:45,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:32:45,502 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:32:45,502 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:32:45,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:32:45,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:32:45,503 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:32:45,503 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:32:45,506 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:32:45,506 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:32:45,506 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:32:45,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:32:45,507 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:32:45,508 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:32:45,508 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:32:45,553 INFO ]: Repository-Root is: /tmp [2018-06-22 01:32:45,568 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:32:45,571 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:32:45,573 INFO ]: Initializing SmtParser... [2018-06-22 01:32:45,573 INFO ]: SmtParser initialized [2018-06-22 01:32:45,574 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/022-horn.smt2 [2018-06-22 01:32:45,575 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 01:32:45,672 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022-horn.smt2 unknown [2018-06-22 01:32:45,957 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/022-horn.smt2 [2018-06-22 01:32:45,969 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:32:45,976 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:32:45,976 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:32:45,976 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:32:45,976 INFO ]: ChcToBoogie initialized [2018-06-22 01:32:45,986 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:32:45" (1/1) ... [2018-06-22 01:32:46,040 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46 Unit [2018-06-22 01:32:46,040 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:32:46,041 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:32:46,041 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:32:46,041 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:32:46,061 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46" (1/1) ... [2018-06-22 01:32:46,061 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46" (1/1) ... [2018-06-22 01:32:46,069 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46" (1/1) ... [2018-06-22 01:32:46,069 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46" (1/1) ... [2018-06-22 01:32:46,086 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46" (1/1) ... [2018-06-22 01:32:46,089 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46" (1/1) ... [2018-06-22 01:32:46,090 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46" (1/1) ... [2018-06-22 01:32:46,101 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:32:46,102 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:32:46,102 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:32:46,102 INFO ]: RCFGBuilder initialized [2018-06-22 01:32:46,103 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46" (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 01:32:46,115 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:32:46,115 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:32:46,115 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:32:46,115 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:32:46,115 INFO ]: Found specification 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 01:32:46,115 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:32:46,498 INFO ]: Using library mode [2018-06-22 01:32:46,499 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:46 BoogieIcfgContainer [2018-06-22 01:32:46,499 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:32:46,501 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:32:46,501 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:32:46,505 INFO ]: TraceAbstraction initialized [2018-06-22 01:32:46,505 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:32:45" (1/3) ... [2018-06-22 01:32:46,506 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6803ba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:32:46, skipping insertion in model container [2018-06-22 01:32:46,506 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:32:46" (2/3) ... [2018-06-22 01:32:46,506 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6803ba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:32:46, skipping insertion in model container [2018-06-22 01:32:46,506 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:32:46" (3/3) ... [2018-06-22 01:32:46,511 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:32:46,521 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:32:46,532 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:32:46,575 INFO ]: Using default assertion order modulation [2018-06-22 01:32:46,576 INFO ]: Interprodecural is true [2018-06-22 01:32:46,576 INFO ]: Hoare is false [2018-06-22 01:32:46,576 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:32:46,576 INFO ]: Backedges is TWOTRACK [2018-06-22 01:32:46,576 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:32:46,576 INFO ]: Difference is false [2018-06-22 01:32:46,576 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:32:46,576 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:32:46,596 INFO ]: Start isEmpty. Operand 31 states. [2018-06-22 01:32:46,608 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:32:46,608 INFO ]: Found error trace [2018-06-22 01:32:46,608 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:46,609 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:46,612 INFO ]: Analyzing trace with hash 552797744, now seen corresponding path program 1 times [2018-06-22 01:32:46,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:46,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:46,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:46,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:46,645 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:46,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:46,761 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:32:46,763 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:46,763 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:46,764 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:46,775 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:46,776 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:46,778 INFO ]: Start difference. First operand 31 states. Second operand 4 states. [2018-06-22 01:32:47,418 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:47,418 INFO ]: Finished difference Result 48 states and 76 transitions. [2018-06-22 01:32:47,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:47,420 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:32:47,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:47,432 INFO ]: With dead ends: 48 [2018-06-22 01:32:47,432 INFO ]: Without dead ends: 48 [2018-06-22 01:32:47,434 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:47,448 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 01:32:47,483 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 01:32:47,485 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 01:32:47,488 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 76 transitions. [2018-06-22 01:32:47,489 INFO ]: Start accepts. Automaton has 48 states and 76 transitions. Word has length 8 [2018-06-22 01:32:47,490 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:47,490 INFO ]: Abstraction has 48 states and 76 transitions. [2018-06-22 01:32:47,490 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:47,490 INFO ]: Start isEmpty. Operand 48 states and 76 transitions. [2018-06-22 01:32:47,493 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:32:47,493 INFO ]: Found error trace [2018-06-22 01:32:47,493 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:47,493 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:47,493 INFO ]: Analyzing trace with hash 577732811, now seen corresponding path program 1 times [2018-06-22 01:32:47,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:47,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:47,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:47,494 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:47,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:47,499 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:47,526 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:32:47,526 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:47,526 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:47,528 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:47,528 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:47,528 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:47,528 INFO ]: Start difference. First operand 48 states and 76 transitions. Second operand 4 states. [2018-06-22 01:32:47,778 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:47,778 INFO ]: Finished difference Result 67 states and 106 transitions. [2018-06-22 01:32:47,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:47,778 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:32:47,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:47,781 INFO ]: With dead ends: 67 [2018-06-22 01:32:47,781 INFO ]: Without dead ends: 67 [2018-06-22 01:32:47,782 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:47,782 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 01:32:47,792 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-06-22 01:32:47,792 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-22 01:32:47,794 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 106 transitions. [2018-06-22 01:32:47,794 INFO ]: Start accepts. Automaton has 67 states and 106 transitions. Word has length 8 [2018-06-22 01:32:47,794 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:47,794 INFO ]: Abstraction has 67 states and 106 transitions. [2018-06-22 01:32:47,794 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:47,794 INFO ]: Start isEmpty. Operand 67 states and 106 transitions. [2018-06-22 01:32:47,798 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:32:47,798 INFO ]: Found error trace [2018-06-22 01:32:47,798 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:47,798 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:47,798 INFO ]: Analyzing trace with hash 781812801, now seen corresponding path program 1 times [2018-06-22 01:32:47,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:47,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:47,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:47,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:47,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:47,807 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:47,852 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:32:47,853 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:47,853 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:32:47,853 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:32:47,853 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:32:47,853 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:32:47,853 INFO ]: Start difference. First operand 67 states and 106 transitions. Second operand 3 states. [2018-06-22 01:32:47,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:47,881 INFO ]: Finished difference Result 106 states and 172 transitions. [2018-06-22 01:32:47,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:32:47,881 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 01:32:47,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:47,885 INFO ]: With dead ends: 106 [2018-06-22 01:32:47,885 INFO ]: Without dead ends: 106 [2018-06-22 01:32:47,886 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-22 01:32:47,886 INFO ]: Start minimizeSevpa. Operand 106 states. [2018-06-22 01:32:47,900 INFO ]: Finished minimizeSevpa. Reduced states from 106 to 70. [2018-06-22 01:32:47,900 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 01:32:47,902 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 115 transitions. [2018-06-22 01:32:47,902 INFO ]: Start accepts. Automaton has 70 states and 115 transitions. Word has length 9 [2018-06-22 01:32:47,902 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:47,902 INFO ]: Abstraction has 70 states and 115 transitions. [2018-06-22 01:32:47,903 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:32:47,903 INFO ]: Start isEmpty. Operand 70 states and 115 transitions. [2018-06-22 01:32:47,907 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-22 01:32:47,907 INFO ]: Found error trace [2018-06-22 01:32:47,907 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:47,907 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:47,907 INFO ]: Analyzing trace with hash 112410745, now seen corresponding path program 1 times [2018-06-22 01:32:47,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:47,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:47,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:47,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:47,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:47,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:48,348 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:32:48,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:48,348 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 01:32:48,357 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:48,398 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:48,407 INFO ]: Computing forward predicates... [2018-06-22 01:32:48,500 INFO ]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 01:32:48,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:48,522 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-22 01:32:48,522 INFO ]: Interpolant automaton has 7 states [2018-06-22 01:32:48,522 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 01:32:48,522 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:32:48,523 INFO ]: Start difference. First operand 70 states and 115 transitions. Second operand 7 states. [2018-06-22 01:32:50,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:50,023 INFO ]: Finished difference Result 258 states and 546 transitions. [2018-06-22 01:32:50,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 01:32:50,026 INFO ]: Start accepts. Automaton has 7 states. Word has length 18 [2018-06-22 01:32:50,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:50,040 INFO ]: With dead ends: 258 [2018-06-22 01:32:50,040 INFO ]: Without dead ends: 215 [2018-06-22 01:32:50,040 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-22 01:32:50,041 INFO ]: Start minimizeSevpa. Operand 215 states. [2018-06-22 01:32:50,096 INFO ]: Finished minimizeSevpa. Reduced states from 215 to 91. [2018-06-22 01:32:50,096 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-22 01:32:50,101 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 159 transitions. [2018-06-22 01:32:50,101 INFO ]: Start accepts. Automaton has 91 states and 159 transitions. Word has length 18 [2018-06-22 01:32:50,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:50,101 INFO ]: Abstraction has 91 states and 159 transitions. [2018-06-22 01:32:50,101 INFO ]: Interpolant automaton has 7 states. [2018-06-22 01:32:50,101 INFO ]: Start isEmpty. Operand 91 states and 159 transitions. [2018-06-22 01:32:50,108 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:32:50,108 INFO ]: Found error trace [2018-06-22 01:32:50,108 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:50,108 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:50,108 INFO ]: Analyzing trace with hash -131808519, now seen corresponding path program 1 times [2018-06-22 01:32:50,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:50,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:50,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:50,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:50,109 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:50,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:50,181 INFO ]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:32:50,182 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:50,182 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:32:50,182 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:32:50,182 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:32:50,182 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:50,182 INFO ]: Start difference. First operand 91 states and 159 transitions. Second operand 5 states. [2018-06-22 01:32:50,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:50,668 INFO ]: Finished difference Result 177 states and 401 transitions. [2018-06-22 01:32:50,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 01:32:50,669 INFO ]: Start accepts. Automaton has 5 states. Word has length 19 [2018-06-22 01:32:50,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:50,674 INFO ]: With dead ends: 177 [2018-06-22 01:32:50,674 INFO ]: Without dead ends: 170 [2018-06-22 01:32:50,675 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:32:50,675 INFO ]: Start minimizeSevpa. Operand 170 states. [2018-06-22 01:32:50,722 INFO ]: Finished minimizeSevpa. Reduced states from 170 to 140. [2018-06-22 01:32:50,722 INFO ]: Start removeUnreachable. Operand 140 states. [2018-06-22 01:32:50,729 INFO ]: Finished removeUnreachable. Reduced from 140 states to 140 states and 294 transitions. [2018-06-22 01:32:50,730 INFO ]: Start accepts. Automaton has 140 states and 294 transitions. Word has length 19 [2018-06-22 01:32:50,730 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:50,730 INFO ]: Abstraction has 140 states and 294 transitions. [2018-06-22 01:32:50,730 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:32:50,730 INFO ]: Start isEmpty. Operand 140 states and 294 transitions. [2018-06-22 01:32:50,736 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-22 01:32:50,736 INFO ]: Found error trace [2018-06-22 01:32:50,736 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:50,736 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:50,737 INFO ]: Analyzing trace with hash 1796125321, now seen corresponding path program 1 times [2018-06-22 01:32:50,737 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:50,737 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:50,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:50,737 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:50,737 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:50,769 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:50,829 INFO ]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:32:50,829 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:50,829 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:32:50,830 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:32:50,830 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:32:50,830 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:50,830 INFO ]: Start difference. First operand 140 states and 294 transitions. Second operand 5 states. [2018-06-22 01:32:51,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:51,120 INFO ]: Finished difference Result 240 states and 600 transitions. [2018-06-22 01:32:51,121 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 01:32:51,121 INFO ]: Start accepts. Automaton has 5 states. Word has length 19 [2018-06-22 01:32:51,121 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:51,127 INFO ]: With dead ends: 240 [2018-06-22 01:32:51,127 INFO ]: Without dead ends: 240 [2018-06-22 01:32:51,127 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:32:51,128 INFO ]: Start minimizeSevpa. Operand 240 states. [2018-06-22 01:32:51,155 INFO ]: Finished minimizeSevpa. Reduced states from 240 to 185. [2018-06-22 01:32:51,155 INFO ]: Start removeUnreachable. Operand 185 states. [2018-06-22 01:32:51,160 INFO ]: Finished removeUnreachable. Reduced from 185 states to 185 states and 456 transitions. [2018-06-22 01:32:51,160 INFO ]: Start accepts. Automaton has 185 states and 456 transitions. Word has length 19 [2018-06-22 01:32:51,160 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:51,160 INFO ]: Abstraction has 185 states and 456 transitions. [2018-06-22 01:32:51,160 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:32:51,160 INFO ]: Start isEmpty. Operand 185 states and 456 transitions. [2018-06-22 01:32:51,168 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:32:51,168 INFO ]: Found error trace [2018-06-22 01:32:51,168 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:51,168 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:51,168 INFO ]: Analyzing trace with hash 1435926218, now seen corresponding path program 1 times [2018-06-22 01:32:51,168 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:51,168 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:51,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:51,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:51,169 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:51,186 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:51,261 INFO ]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 01:32:51,261 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:51,261 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:51,261 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:51,261 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:51,262 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:51,262 INFO ]: Start difference. First operand 185 states and 456 transitions. Second operand 4 states. [2018-06-22 01:32:51,296 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:51,296 INFO ]: Finished difference Result 190 states and 470 transitions. [2018-06-22 01:32:51,297 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:51,297 INFO ]: Start accepts. Automaton has 4 states. Word has length 27 [2018-06-22 01:32:51,297 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:51,302 INFO ]: With dead ends: 190 [2018-06-22 01:32:51,302 INFO ]: Without dead ends: 190 [2018-06-22 01:32:51,302 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:51,303 INFO ]: Start minimizeSevpa. Operand 190 states. [2018-06-22 01:32:51,330 INFO ]: Finished minimizeSevpa. Reduced states from 190 to 186. [2018-06-22 01:32:51,330 INFO ]: Start removeUnreachable. Operand 186 states. [2018-06-22 01:32:51,335 INFO ]: Finished removeUnreachable. Reduced from 186 states to 186 states and 458 transitions. [2018-06-22 01:32:51,335 INFO ]: Start accepts. Automaton has 186 states and 458 transitions. Word has length 27 [2018-06-22 01:32:51,335 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:51,335 INFO ]: Abstraction has 186 states and 458 transitions. [2018-06-22 01:32:51,335 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:51,335 INFO ]: Start isEmpty. Operand 186 states and 458 transitions. [2018-06-22 01:32:51,343 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:32:51,343 INFO ]: Found error trace [2018-06-22 01:32:51,343 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:51,343 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:51,343 INFO ]: Analyzing trace with hash 69266758, now seen corresponding path program 1 times [2018-06-22 01:32:51,343 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:51,343 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:51,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:51,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:51,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:51,363 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:51,412 INFO ]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 01:32:51,412 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:51,412 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:51,412 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:51,413 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:51,413 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:51,413 INFO ]: Start difference. First operand 186 states and 458 transitions. Second operand 4 states. [2018-06-22 01:32:51,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:51,477 INFO ]: Finished difference Result 191 states and 472 transitions. [2018-06-22 01:32:51,480 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:51,480 INFO ]: Start accepts. Automaton has 4 states. Word has length 27 [2018-06-22 01:32:51,480 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:51,485 INFO ]: With dead ends: 191 [2018-06-22 01:32:51,485 INFO ]: Without dead ends: 191 [2018-06-22 01:32:51,485 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:51,485 INFO ]: Start minimizeSevpa. Operand 191 states. [2018-06-22 01:32:51,506 INFO ]: Finished minimizeSevpa. Reduced states from 191 to 187. [2018-06-22 01:32:51,506 INFO ]: Start removeUnreachable. Operand 187 states. [2018-06-22 01:32:51,524 INFO ]: Finished removeUnreachable. Reduced from 187 states to 187 states and 460 transitions. [2018-06-22 01:32:51,524 INFO ]: Start accepts. Automaton has 187 states and 460 transitions. Word has length 27 [2018-06-22 01:32:51,524 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:51,524 INFO ]: Abstraction has 187 states and 460 transitions. [2018-06-22 01:32:51,524 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:51,524 INFO ]: Start isEmpty. Operand 187 states and 460 transitions. [2018-06-22 01:32:51,531 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-22 01:32:51,531 INFO ]: Found error trace [2018-06-22 01:32:51,531 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:51,531 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:51,532 INFO ]: Analyzing trace with hash 894790098, now seen corresponding path program 1 times [2018-06-22 01:32:51,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:51,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:51,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:51,532 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:51,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:51,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:51,597 INFO ]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 01:32:51,597 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:51,597 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:32:51,597 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:32:51,597 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:32:51,597 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:32:51,597 INFO ]: Start difference. First operand 187 states and 460 transitions. Second operand 4 states. [2018-06-22 01:32:51,714 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:51,714 INFO ]: Finished difference Result 191 states and 470 transitions. [2018-06-22 01:32:51,714 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:32:51,714 INFO ]: Start accepts. Automaton has 4 states. Word has length 27 [2018-06-22 01:32:51,714 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:51,717 INFO ]: With dead ends: 191 [2018-06-22 01:32:51,717 INFO ]: Without dead ends: 178 [2018-06-22 01:32:51,718 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:51,718 INFO ]: Start minimizeSevpa. Operand 178 states. [2018-06-22 01:32:51,732 INFO ]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-06-22 01:32:51,732 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-22 01:32:51,737 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 431 transitions. [2018-06-22 01:32:51,737 INFO ]: Start accepts. Automaton has 178 states and 431 transitions. Word has length 27 [2018-06-22 01:32:51,737 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:51,737 INFO ]: Abstraction has 178 states and 431 transitions. [2018-06-22 01:32:51,737 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:32:51,737 INFO ]: Start isEmpty. Operand 178 states and 431 transitions. [2018-06-22 01:32:51,745 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:32:51,745 INFO ]: Found error trace [2018-06-22 01:32:51,745 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:51,745 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:51,745 INFO ]: Analyzing trace with hash -1054549351, now seen corresponding path program 1 times [2018-06-22 01:32:51,745 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:51,745 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:51,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:51,746 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:51,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:51,774 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:51,956 INFO ]: Checked inductivity of 23 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 01:32:51,956 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:51,956 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:32:51,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:52,007 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:52,011 INFO ]: Computing forward predicates... [2018-06-22 01:32:52,198 INFO ]: Checked inductivity of 23 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 01:32:52,218 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:52,218 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 01:32:52,219 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:32:52,219 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:32:52,219 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:32:52,219 INFO ]: Start difference. First operand 178 states and 431 transitions. Second operand 12 states. [2018-06-22 01:32:55,285 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:55,285 INFO ]: Finished difference Result 505 states and 2614 transitions. [2018-06-22 01:32:55,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 01:32:55,289 INFO ]: Start accepts. Automaton has 12 states. Word has length 28 [2018-06-22 01:32:55,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:55,315 INFO ]: With dead ends: 505 [2018-06-22 01:32:55,315 INFO ]: Without dead ends: 505 [2018-06-22 01:32:55,315 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=805, Unknown=0, NotChecked=0, Total=992 [2018-06-22 01:32:55,316 INFO ]: Start minimizeSevpa. Operand 505 states. [2018-06-22 01:32:55,422 INFO ]: Finished minimizeSevpa. Reduced states from 505 to 178. [2018-06-22 01:32:55,422 INFO ]: Start removeUnreachable. Operand 178 states. [2018-06-22 01:32:55,425 INFO ]: Finished removeUnreachable. Reduced from 178 states to 178 states and 431 transitions. [2018-06-22 01:32:55,425 INFO ]: Start accepts. Automaton has 178 states and 431 transitions. Word has length 28 [2018-06-22 01:32:55,425 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:55,425 INFO ]: Abstraction has 178 states and 431 transitions. [2018-06-22 01:32:55,425 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:32:55,425 INFO ]: Start isEmpty. Operand 178 states and 431 transitions. [2018-06-22 01:32:55,430 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-22 01:32:55,430 INFO ]: Found error trace [2018-06-22 01:32:55,430 INFO ]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:55,430 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:55,431 INFO ]: Analyzing trace with hash -1486899467, now seen corresponding path program 1 times [2018-06-22 01:32:55,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:55,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:55,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:55,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:55,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:55,454 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:55,574 INFO ]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 01:32:55,574 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:32:55,575 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:32:55,575 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:32:55,575 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:32:55,575 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:32:55,575 INFO ]: Start difference. First operand 178 states and 431 transitions. Second operand 5 states. [2018-06-22 01:32:55,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:55,763 INFO ]: Finished difference Result 495 states and 1838 transitions. [2018-06-22 01:32:55,767 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 01:32:55,767 INFO ]: Start accepts. Automaton has 5 states. Word has length 28 [2018-06-22 01:32:55,767 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:55,797 INFO ]: With dead ends: 495 [2018-06-22 01:32:55,797 INFO ]: Without dead ends: 495 [2018-06-22 01:32:55,798 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:32:55,798 INFO ]: Start minimizeSevpa. Operand 495 states. [2018-06-22 01:32:55,874 INFO ]: Finished minimizeSevpa. Reduced states from 495 to 188. [2018-06-22 01:32:55,875 INFO ]: Start removeUnreachable. Operand 188 states. [2018-06-22 01:32:55,878 INFO ]: Finished removeUnreachable. Reduced from 188 states to 188 states and 461 transitions. [2018-06-22 01:32:55,878 INFO ]: Start accepts. Automaton has 188 states and 461 transitions. Word has length 28 [2018-06-22 01:32:55,878 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:55,878 INFO ]: Abstraction has 188 states and 461 transitions. [2018-06-22 01:32:55,878 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:32:55,878 INFO ]: Start isEmpty. Operand 188 states and 461 transitions. [2018-06-22 01:32:55,885 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 01:32:55,886 INFO ]: Found error trace [2018-06-22 01:32:55,886 INFO ]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:32:55,886 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:32:55,886 INFO ]: Analyzing trace with hash 677959749, now seen corresponding path program 2 times [2018-06-22 01:32:55,886 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:32:55,886 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:32:55,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:55,887 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:32:55,887 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:32:55,907 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:55,990 INFO ]: Checked inductivity of 49 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 01:32:55,990 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:32:55,990 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:32:55,996 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:32:56,059 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:32:56,059 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:32:56,063 INFO ]: Computing forward predicates... [2018-06-22 01:32:56,219 INFO ]: Checked inductivity of 49 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 01:32:56,239 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:32:56,239 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2018-06-22 01:32:56,240 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:32:56,240 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:32:56,240 INFO ]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:32:56,240 INFO ]: Start difference. First operand 188 states and 461 transitions. Second operand 12 states. [2018-06-22 01:32:56,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:32:56,884 INFO ]: Finished difference Result 100 states and 190 transitions. [2018-06-22 01:32:56,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:32:56,884 INFO ]: Start accepts. Automaton has 12 states. Word has length 37 [2018-06-22 01:32:56,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:32:56,884 INFO ]: With dead ends: 100 [2018-06-22 01:32:56,884 INFO ]: Without dead ends: 0 [2018-06-22 01:32:56,884 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-06-22 01:32:56,884 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:32:56,885 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:32:56,885 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:32:56,885 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:32:56,885 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-06-22 01:32:56,885 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:32:56,885 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:32:56,885 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:32:56,885 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:32:56,885 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:32:56,890 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:32:56 BoogieIcfgContainer [2018-06-22 01:32:56,890 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:32:56,891 INFO ]: Toolchain (without parser) took 10920.99 ms. Allocated memory was 305.1 MB in the beginning and 424.1 MB in the end (delta: 119.0 MB). Free memory was 257.7 MB in the beginning and 249.9 MB in the end (delta: 7.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:56,893 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:32:56,893 INFO ]: ChcToBoogie took 64.47 ms. Allocated memory is still 305.1 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:56,894 INFO ]: Boogie Preprocessor took 60.18 ms. Allocated memory is still 305.1 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:56,894 INFO ]: RCFGBuilder took 396.83 ms. Allocated memory is still 305.1 MB. Free memory was 252.7 MB in the beginning and 234.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:56,895 INFO ]: TraceAbstraction took 10389.64 ms. Allocated memory was 305.1 MB in the beginning and 424.1 MB in the end (delta: 119.0 MB). Free memory was 234.7 MB in the beginning and 249.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 103.8 MB. Max. memory is 3.6 GB. [2018-06-22 01:32:56,898 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 305.1 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 64.47 ms. Allocated memory is still 305.1 MB. Free memory was 256.7 MB in the beginning and 254.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 60.18 ms. Allocated memory is still 305.1 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 396.83 ms. Allocated memory is still 305.1 MB. Free memory was 252.7 MB in the beginning and 234.7 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 10389.64 ms. Allocated memory was 305.1 MB in the beginning and 424.1 MB in the end (delta: 119.0 MB). Free memory was 234.7 MB in the beginning and 249.9 MB in the end (delta: -15.2 MB). Peak memory consumption was 103.8 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, 31 locations, 1 error locations. SAFE Result, 10.3s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 7.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 701 SDtfs, 658 SDslu, 1189 SDs, 0 SdLazy, 3313 SolverSat, 700 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=11, 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.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 887 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 24468 SizeOfPredicates, 36 NumberOfNonLiveVariables, 664 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 230/257 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/022-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-32-56-908.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/022-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-32-56-908.csv Received shutdown request...