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/HOLA/21.c.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 00:59:45,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 00:59:45,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 00:59:45,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 00:59:45,511 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 00:59:45,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 00:59:45,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 00:59:45,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 00:59:45,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 00:59:45,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 00:59:45,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 00:59:45,520 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 00:59:45,521 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 00:59:45,521 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 00:59:45,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 00:59:45,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 00:59:45,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 00:59:45,536 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 00:59:45,537 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 00:59:45,538 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 00:59:45,541 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 00:59:45,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 00:59:45,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 00:59:45,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 00:59:45,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 00:59:45,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 00:59:45,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 00:59:45,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 00:59:45,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 00:59:45,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 00:59:45,554 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 00:59:45,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 00:59:45,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 00:59:45,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 00:59:45,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 00:59:45,556 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 00:59:45,574 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 00:59:45,576 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 00:59:45,577 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 00:59:45,577 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 00:59:45,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 00:59:45,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 00:59:45,578 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 00:59:45,578 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 00:59:45,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:59:45,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 00:59:45,579 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 00:59:45,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 00:59:45,579 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 00:59:45,580 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 00:59:45,580 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 00:59:45,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 00:59:45,580 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 00:59:45,582 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 00:59:45,582 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 00:59:45,633 INFO ]: Repository-Root is: /tmp [2018-06-22 00:59:45,648 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 00:59:45,653 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 00:59:45,654 INFO ]: Initializing SmtParser... [2018-06-22 00:59:45,655 INFO ]: SmtParser initialized [2018-06-22 00:59:45,655 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 [2018-06-22 00:59:45,656 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 00:59:45,745 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 unknown [2018-06-22 00:59:46,296 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/HOLA/21.c.smt2 [2018-06-22 00:59:46,307 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 00:59:46,313 INFO ]: Walking toolchain with 4 elements. [2018-06-22 00:59:46,314 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 00:59:46,314 INFO ]: Initializing ChcToBoogie... [2018-06-22 00:59:46,314 INFO ]: ChcToBoogie initialized [2018-06-22 00:59:46,317 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:59:46" (1/1) ... [2018-06-22 00:59:46,389 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:46 Unit [2018-06-22 00:59:46,389 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 00:59:46,390 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 00:59:46,390 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 00:59:46,390 INFO ]: Boogie Preprocessor initialized [2018-06-22 00:59:46,410 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:46" (1/1) ... [2018-06-22 00:59:46,410 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:46" (1/1) ... [2018-06-22 00:59:46,426 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:46" (1/1) ... [2018-06-22 00:59:46,426 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:46" (1/1) ... [2018-06-22 00:59:46,442 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:46" (1/1) ... [2018-06-22 00:59:46,453 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:46" (1/1) ... [2018-06-22 00:59:46,455 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:46" (1/1) ... [2018-06-22 00:59:46,460 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 00:59:46,470 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 00:59:46,470 INFO ]: Initializing RCFGBuilder... [2018-06-22 00:59:46,470 INFO ]: RCFGBuilder initialized [2018-06-22 00:59:46,471 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59: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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 00:59:46,496 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 00:59:46,496 INFO ]: Found specification of procedure gotoProc [2018-06-22 00:59:46,496 INFO ]: Found implementation of procedure gotoProc [2018-06-22 00:59:46,496 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 00:59:46,496 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 00:59:46,496 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 00:59:47,474 INFO ]: Using library mode [2018-06-22 00:59:47,475 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:59:47 BoogieIcfgContainer [2018-06-22 00:59:47,475 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 00:59:47,476 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 00:59:47,476 INFO ]: Initializing TraceAbstraction... [2018-06-22 00:59:47,482 INFO ]: TraceAbstraction initialized [2018-06-22 00:59:47,482 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:59:46" (1/3) ... [2018-06-22 00:59:47,483 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c96edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:59:47, skipping insertion in model container [2018-06-22 00:59:47,483 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:59:46" (2/3) ... [2018-06-22 00:59:47,483 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c96edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:59:47, skipping insertion in model container [2018-06-22 00:59:47,483 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:59:47" (3/3) ... [2018-06-22 00:59:47,485 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 00:59:47,493 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 00:59:47,503 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 00:59:47,547 INFO ]: Using default assertion order modulation [2018-06-22 00:59:47,548 INFO ]: Interprodecural is true [2018-06-22 00:59:47,548 INFO ]: Hoare is false [2018-06-22 00:59:47,548 INFO ]: Compute interpolants for FPandBP [2018-06-22 00:59:47,548 INFO ]: Backedges is TWOTRACK [2018-06-22 00:59:47,548 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 00:59:47,548 INFO ]: Difference is false [2018-06-22 00:59:47,548 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 00:59:47,548 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 00:59:47,564 INFO ]: Start isEmpty. Operand 41 states. [2018-06-22 00:59:47,575 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 00:59:47,575 INFO ]: Found error trace [2018-06-22 00:59:47,576 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:59:47,576 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:47,581 INFO ]: Analyzing trace with hash 1430044702, now seen corresponding path program 1 times [2018-06-22 00:59:47,583 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:47,583 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:47,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:47,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:47,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:47,778 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:48,246 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 00:59:48,808 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:48,815 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 00:59:48,840 INFO ]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-06-22 00:59:48,842 INFO ]: Interpolant automaton has 10 states [2018-06-22 00:59:48,857 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 00:59:48,858 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 00:59:48,861 INFO ]: Start difference. First operand 41 states. Second operand 10 states. [2018-06-22 00:59:49,509 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 00:59:49,509 INFO ]: Finished difference Result 62 states and 70 transitions. [2018-06-22 00:59:49,510 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 00:59:49,511 INFO ]: Start accepts. Automaton has 10 states. Word has length 24 [2018-06-22 00:59:49,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 00:59:49,522 INFO ]: With dead ends: 62 [2018-06-22 00:59:49,522 INFO ]: Without dead ends: 56 [2018-06-22 00:59:49,524 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-06-22 00:59:49,542 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 00:59:49,561 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 41. [2018-06-22 00:59:49,562 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-22 00:59:49,567 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-06-22 00:59:49,568 INFO ]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 24 [2018-06-22 00:59:49,568 INFO ]: Finished accepts. word is rejected. [2018-06-22 00:59:49,568 INFO ]: Abstraction has 41 states and 46 transitions. [2018-06-22 00:59:49,568 INFO ]: Interpolant automaton has 10 states. [2018-06-22 00:59:49,568 INFO ]: Start isEmpty. Operand 41 states and 46 transitions. [2018-06-22 00:59:49,569 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 00:59:49,569 INFO ]: Found error trace [2018-06-22 00:59:49,569 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 00:59:49,569 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 00:59:49,570 INFO ]: Analyzing trace with hash 111343024, now seen corresponding path program 1 times [2018-06-22 00:59:49,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 00:59:49,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 00:59:49,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:49,571 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:49,571 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 00:59:49,637 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:50,483 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:50,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 00:59:50,483 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 00:59:50,498 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 00:59:50,666 INFO ]: Conjunction of SSA is unsat [2018-06-22 00:59:50,684 INFO ]: Computing forward predicates... [2018-06-22 00:59:53,171 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 00:59:53,196 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 00:59:53,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 50 [2018-06-22 00:59:53,197 INFO ]: Interpolant automaton has 50 states [2018-06-22 00:59:53,197 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 00:59:53,199 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2346, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 00:59:53,199 INFO ]: Start difference. First operand 41 states and 46 transitions. Second operand 50 states. [2018-06-22 00:59:54,882 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-06-22 00:59:55,632 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2018-06-22 00:59:56,459 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-06-22 00:59:57,044 WARN ]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2018-06-22 00:59:57,978 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-06-22 00:59:58,444 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-06-22 00:59:59,299 WARN ]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-06-22 00:59:59,813 WARN ]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-06-22 01:00:00,441 WARN ]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-06-22 01:00:01,479 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-06-22 01:00:02,505 WARN ]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-06-22 01:00:03,401 WARN ]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-06-22 01:00:03,864 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:03,864 INFO ]: Finished difference Result 500 states and 575 transitions. [2018-06-22 01:00:03,865 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-06-22 01:00:03,865 INFO ]: Start accepts. Automaton has 50 states. Word has length 34 [2018-06-22 01:00:03,865 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:03,877 INFO ]: With dead ends: 500 [2018-06-22 01:00:03,877 INFO ]: Without dead ends: 490 [2018-06-22 01:00:03,884 INFO ]: 0 DeclaredPredicates, 155 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5190 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=3771, Invalid=16821, Unknown=0, NotChecked=0, Total=20592 [2018-06-22 01:00:03,885 INFO ]: Start minimizeSevpa. Operand 490 states. [2018-06-22 01:00:03,904 INFO ]: Finished minimizeSevpa. Reduced states from 490 to 51. [2018-06-22 01:00:03,904 INFO ]: Start removeUnreachable. Operand 51 states. [2018-06-22 01:00:03,905 INFO ]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-06-22 01:00:03,905 INFO ]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 34 [2018-06-22 01:00:03,906 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:03,906 INFO ]: Abstraction has 51 states and 60 transitions. [2018-06-22 01:00:03,906 INFO ]: Interpolant automaton has 50 states. [2018-06-22 01:00:03,906 INFO ]: Start isEmpty. Operand 51 states and 60 transitions. [2018-06-22 01:00:03,907 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:00:03,907 INFO ]: Found error trace [2018-06-22 01:00:03,907 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:00:03,907 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:03,907 INFO ]: Analyzing trace with hash 1558418346, now seen corresponding path program 1 times [2018-06-22 01:00:03,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:03,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:03,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:03,908 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:03,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:03,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:04,682 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:04,682 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:00:04,682 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:00:04,696 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:04,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:04,853 INFO ]: Computing forward predicates... [2018-06-22 01:00:05,566 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:05,586 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:00:05,587 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 50 [2018-06-22 01:00:05,587 INFO ]: Interpolant automaton has 50 states [2018-06-22 01:00:05,587 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 01:00:05,588 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2346, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:00:05,588 INFO ]: Start difference. First operand 51 states and 60 transitions. Second operand 50 states. [2018-06-22 01:00:06,819 WARN ]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-06-22 01:00:07,590 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-06-22 01:00:08,939 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-06-22 01:00:09,468 WARN ]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-06-22 01:00:09,870 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2018-06-22 01:00:10,441 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-06-22 01:00:10,625 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-06-22 01:00:11,101 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-06-22 01:00:11,862 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-06-22 01:00:12,768 WARN ]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-06-22 01:00:13,554 WARN ]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-06-22 01:00:14,477 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-06-22 01:00:15,162 WARN ]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-06-22 01:00:15,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:15,597 INFO ]: Finished difference Result 487 states and 561 transitions. [2018-06-22 01:00:15,600 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-06-22 01:00:15,600 INFO ]: Start accepts. Automaton has 50 states. Word has length 34 [2018-06-22 01:00:15,600 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:15,604 INFO ]: With dead ends: 487 [2018-06-22 01:00:15,604 INFO ]: Without dead ends: 477 [2018-06-22 01:00:15,613 INFO ]: 0 DeclaredPredicates, 155 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5228 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=3771, Invalid=16821, Unknown=0, NotChecked=0, Total=20592 [2018-06-22 01:00:15,614 INFO ]: Start minimizeSevpa. Operand 477 states. [2018-06-22 01:00:15,637 INFO ]: Finished minimizeSevpa. Reduced states from 477 to 52. [2018-06-22 01:00:15,637 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:00:15,674 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-06-22 01:00:15,674 INFO ]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 34 [2018-06-22 01:00:15,675 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:15,675 INFO ]: Abstraction has 52 states and 61 transitions. [2018-06-22 01:00:15,675 INFO ]: Interpolant automaton has 50 states. [2018-06-22 01:00:15,675 INFO ]: Start isEmpty. Operand 52 states and 61 transitions. [2018-06-22 01:00:15,675 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:00:15,675 INFO ]: Found error trace [2018-06-22 01:00:15,676 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:00:15,676 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:15,676 INFO ]: Analyzing trace with hash -1616780176, now seen corresponding path program 1 times [2018-06-22 01:00:15,676 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:15,676 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:15,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:15,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:15,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:15,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:15,763 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:15,763 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:15,763 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:00:15,764 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:00:15,764 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:00:15,764 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:00:15,764 INFO ]: Start difference. First operand 52 states and 61 transitions. Second operand 4 states. [2018-06-22 01:00:15,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:15,799 INFO ]: Finished difference Result 80 states and 93 transitions. [2018-06-22 01:00:15,800 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:00:15,800 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-22 01:00:15,800 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:15,800 INFO ]: With dead ends: 80 [2018-06-22 01:00:15,800 INFO ]: Without dead ends: 79 [2018-06-22 01:00:15,800 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:00:15,800 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 01:00:15,804 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 53. [2018-06-22 01:00:15,804 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 01:00:15,804 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-06-22 01:00:15,804 INFO ]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 34 [2018-06-22 01:00:15,805 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:15,805 INFO ]: Abstraction has 53 states and 61 transitions. [2018-06-22 01:00:15,805 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:00:15,805 INFO ]: Start isEmpty. Operand 53 states and 61 transitions. [2018-06-22 01:00:15,805 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:00:15,805 INFO ]: Found error trace [2018-06-22 01:00:15,806 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:00:15,806 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:15,806 INFO ]: Analyzing trace with hash 470996618, now seen corresponding path program 1 times [2018-06-22 01:00:15,806 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:15,806 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:15,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:15,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:15,806 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:15,834 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:15,878 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:15,879 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:15,879 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:00:15,879 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:00:15,879 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:00:15,879 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:00:15,879 INFO ]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2018-06-22 01:00:15,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:15,891 INFO ]: Finished difference Result 78 states and 88 transitions. [2018-06-22 01:00:15,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:00:15,891 INFO ]: Start accepts. Automaton has 4 states. Word has length 34 [2018-06-22 01:00:15,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:15,892 INFO ]: With dead ends: 78 [2018-06-22 01:00:15,892 INFO ]: Without dead ends: 74 [2018-06-22 01:00:15,892 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:00:15,892 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 01:00:15,894 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-06-22 01:00:15,894 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 01:00:15,895 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-06-22 01:00:15,895 INFO ]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 34 [2018-06-22 01:00:15,895 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:15,895 INFO ]: Abstraction has 52 states and 57 transitions. [2018-06-22 01:00:15,895 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:00:15,895 INFO ]: Start isEmpty. Operand 52 states and 57 transitions. [2018-06-22 01:00:15,896 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-22 01:00:15,896 INFO ]: Found error trace [2018-06-22 01:00:15,896 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:00:15,896 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:15,896 INFO ]: Analyzing trace with hash 962469588, now seen corresponding path program 1 times [2018-06-22 01:00:15,896 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:15,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:15,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:15,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:15,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:15,938 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:17,170 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:17,170 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:00:17,170 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:00:17,176 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:17,284 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:17,294 INFO ]: Computing forward predicates... [2018-06-22 01:00:17,995 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:18,015 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:00:18,015 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 50 [2018-06-22 01:00:18,015 INFO ]: Interpolant automaton has 50 states [2018-06-22 01:00:18,016 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 01:00:18,016 INFO ]: CoverageRelationStatistics Valid=104, Invalid=2346, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 01:00:18,016 INFO ]: Start difference. First operand 52 states and 57 transitions. Second operand 50 states. [2018-06-22 01:00:19,679 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-06-22 01:00:20,053 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2018-06-22 01:00:20,314 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-06-22 01:00:20,573 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-06-22 01:00:20,915 WARN ]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-06-22 01:00:21,240 WARN ]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-06-22 01:00:21,544 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-06-22 01:00:21,885 WARN ]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-06-22 01:00:22,161 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-06-22 01:00:22,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:22,364 INFO ]: Finished difference Result 119 states and 129 transitions. [2018-06-22 01:00:22,365 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 01:00:22,365 INFO ]: Start accepts. Automaton has 50 states. Word has length 34 [2018-06-22 01:00:22,365 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:22,365 INFO ]: With dead ends: 119 [2018-06-22 01:00:22,365 INFO ]: Without dead ends: 109 [2018-06-22 01:00:22,368 INFO ]: 0 DeclaredPredicates, 105 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1558, Invalid=7184, Unknown=0, NotChecked=0, Total=8742 [2018-06-22 01:00:22,368 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 01:00:22,370 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 57. [2018-06-22 01:00:22,371 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 01:00:22,371 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-06-22 01:00:22,372 INFO ]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 34 [2018-06-22 01:00:22,372 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:22,372 INFO ]: Abstraction has 57 states and 62 transitions. [2018-06-22 01:00:22,372 INFO ]: Interpolant automaton has 50 states. [2018-06-22 01:00:22,372 INFO ]: Start isEmpty. Operand 57 states and 62 transitions. [2018-06-22 01:00:22,373 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:00:22,373 INFO ]: Found error trace [2018-06-22 01:00:22,373 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:00:22,373 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:22,373 INFO ]: Analyzing trace with hash -201794366, now seen corresponding path program 2 times [2018-06-22 01:00:22,373 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:22,373 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:22,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:22,374 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:22,374 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:22,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:23,272 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:23,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:00:23,272 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:00:23,278 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:00:23,428 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:00:23,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:23,441 INFO ]: Computing forward predicates... [2018-06-22 01:00:25,361 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:25,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:00:25,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 67 [2018-06-22 01:00:25,383 INFO ]: Interpolant automaton has 67 states [2018-06-22 01:00:25,383 INFO ]: Constructing interpolant automaton starting with 67 interpolants. [2018-06-22 01:00:25,384 INFO ]: CoverageRelationStatistics Valid=169, Invalid=4253, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 01:00:25,384 INFO ]: Start difference. First operand 57 states and 62 transitions. Second operand 67 states. [2018-06-22 01:00:28,166 WARN ]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-06-22 01:00:32,876 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-06-22 01:00:33,389 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-06-22 01:00:34,005 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-06-22 01:00:34,457 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 160 [2018-06-22 01:00:34,819 WARN ]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-06-22 01:00:35,416 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-06-22 01:00:35,744 WARN ]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-06-22 01:00:36,196 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-06-22 01:00:37,138 WARN ]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-06-22 01:00:37,715 WARN ]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2018-06-22 01:00:38,265 WARN ]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2018-06-22 01:00:38,793 WARN ]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2018-06-22 01:00:39,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:39,491 INFO ]: Finished difference Result 456 states and 495 transitions. [2018-06-22 01:00:39,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-06-22 01:00:39,491 INFO ]: Start accepts. Automaton has 67 states. Word has length 44 [2018-06-22 01:00:39,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:39,494 INFO ]: With dead ends: 456 [2018-06-22 01:00:39,494 INFO ]: Without dead ends: 436 [2018-06-22 01:00:39,497 INFO ]: 0 DeclaredPredicates, 198 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9308 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=4875, Invalid=28797, Unknown=0, NotChecked=0, Total=33672 [2018-06-22 01:00:39,497 INFO ]: Start minimizeSevpa. Operand 436 states. [2018-06-22 01:00:39,506 INFO ]: Finished minimizeSevpa. Reduced states from 436 to 66. [2018-06-22 01:00:39,506 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 01:00:39,510 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-06-22 01:00:39,510 INFO ]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 44 [2018-06-22 01:00:39,510 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:39,510 INFO ]: Abstraction has 66 states and 73 transitions. [2018-06-22 01:00:39,510 INFO ]: Interpolant automaton has 67 states. [2018-06-22 01:00:39,510 INFO ]: Start isEmpty. Operand 66 states and 73 transitions. [2018-06-22 01:00:39,511 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:00:39,511 INFO ]: Found error trace [2018-06-22 01:00:39,511 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:00:39,511 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:39,511 INFO ]: Analyzing trace with hash 1245280956, now seen corresponding path program 1 times [2018-06-22 01:00:39,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:39,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:39,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:39,512 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:00:39,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:39,545 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:39,924 INFO ]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:39,924 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:39,924 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:00:39,924 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:00:39,924 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:00:39,924 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:00:39,925 INFO ]: Start difference. First operand 66 states and 73 transitions. Second operand 12 states. [2018-06-22 01:00:40,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:40,226 INFO ]: Finished difference Result 164 states and 178 transitions. [2018-06-22 01:00:40,226 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 01:00:40,226 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 01:00:40,226 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:40,227 INFO ]: With dead ends: 164 [2018-06-22 01:00:40,227 INFO ]: Without dead ends: 163 [2018-06-22 01:00:40,227 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2018-06-22 01:00:40,228 INFO ]: Start minimizeSevpa. Operand 163 states. [2018-06-22 01:00:40,232 INFO ]: Finished minimizeSevpa. Reduced states from 163 to 75. [2018-06-22 01:00:40,232 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 01:00:40,233 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-06-22 01:00:40,233 INFO ]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 44 [2018-06-22 01:00:40,233 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:40,233 INFO ]: Abstraction has 75 states and 83 transitions. [2018-06-22 01:00:40,233 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:00:40,233 INFO ]: Start isEmpty. Operand 75 states and 83 transitions. [2018-06-22 01:00:40,234 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:00:40,234 INFO ]: Found error trace [2018-06-22 01:00:40,234 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:00:40,235 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:40,235 INFO ]: Analyzing trace with hash 649332198, now seen corresponding path program 1 times [2018-06-22 01:00:40,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:40,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:40,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:40,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:40,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:40,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:40,433 INFO ]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:40,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:40,433 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:00:40,434 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:00:40,434 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:00:40,434 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:00:40,434 INFO ]: Start difference. First operand 75 states and 83 transitions. Second operand 12 states. [2018-06-22 01:00:40,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:40,598 INFO ]: Finished difference Result 122 states and 133 transitions. [2018-06-22 01:00:40,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:00:40,599 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 01:00:40,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:40,600 INFO ]: With dead ends: 122 [2018-06-22 01:00:40,600 INFO ]: Without dead ends: 102 [2018-06-22 01:00:40,600 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:00:40,600 INFO ]: Start minimizeSevpa. Operand 102 states. [2018-06-22 01:00:40,607 INFO ]: Finished minimizeSevpa. Reduced states from 102 to 75. [2018-06-22 01:00:40,607 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 01:00:40,607 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-06-22 01:00:40,608 INFO ]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 44 [2018-06-22 01:00:40,608 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:40,608 INFO ]: Abstraction has 75 states and 81 transitions. [2018-06-22 01:00:40,608 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:00:40,608 INFO ]: Start isEmpty. Operand 75 states and 81 transitions. [2018-06-22 01:00:40,609 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:00:40,609 INFO ]: Found error trace [2018-06-22 01:00:40,609 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:00:40,609 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:40,609 INFO ]: Analyzing trace with hash 590334524, now seen corresponding path program 2 times [2018-06-22 01:00:40,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:40,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:40,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:40,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:00:40,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:40,631 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:40,754 INFO ]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:40,755 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:00:40,755 INFO ]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-06-22 01:00:40,755 INFO ]: Interpolant automaton has 12 states [2018-06-22 01:00:40,755 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 01:00:40,755 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:00:40,755 INFO ]: Start difference. First operand 75 states and 81 transitions. Second operand 12 states. [2018-06-22 01:00:40,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:00:40,911 INFO ]: Finished difference Result 115 states and 122 transitions. [2018-06-22 01:00:40,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 01:00:40,912 INFO ]: Start accepts. Automaton has 12 states. Word has length 44 [2018-06-22 01:00:40,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:00:40,912 INFO ]: With dead ends: 115 [2018-06-22 01:00:40,912 INFO ]: Without dead ends: 114 [2018-06-22 01:00:40,913 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-06-22 01:00:40,913 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-22 01:00:40,922 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 79. [2018-06-22 01:00:40,922 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 01:00:40,924 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-06-22 01:00:40,924 INFO ]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 44 [2018-06-22 01:00:40,924 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:00:40,924 INFO ]: Abstraction has 79 states and 85 transitions. [2018-06-22 01:00:40,924 INFO ]: Interpolant automaton has 12 states. [2018-06-22 01:00:40,924 INFO ]: Start isEmpty. Operand 79 states and 85 transitions. [2018-06-22 01:00:40,925 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:00:40,925 INFO ]: Found error trace [2018-06-22 01:00:40,925 INFO ]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:00:40,925 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:00:40,925 INFO ]: Analyzing trace with hash 2037409846, now seen corresponding path program 2 times [2018-06-22 01:00:40,925 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:00:40,925 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:00:40,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:40,926 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 01:00:40,926 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:00:40,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:41,793 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:41,793 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:00:41,835 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:00:41,841 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 01:00:42,001 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 01:00:42,001 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:00:42,011 INFO ]: Computing forward predicates... [2018-06-22 01:00:43,590 INFO ]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:00:43,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:00:43,610 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 67 [2018-06-22 01:00:43,610 INFO ]: Interpolant automaton has 67 states [2018-06-22 01:00:43,610 INFO ]: Constructing interpolant automaton starting with 67 interpolants. [2018-06-22 01:00:43,610 INFO ]: CoverageRelationStatistics Valid=169, Invalid=4253, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 01:00:43,610 INFO ]: Start difference. First operand 79 states and 85 transitions. Second operand 67 states. [2018-06-22 01:00:47,957 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-06-22 01:00:48,328 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-06-22 01:00:48,868 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-06-22 01:00:49,094 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 160 Received shutdown request... [2018-06-22 01:00:49,308 WARN ]: Removed 5 from assertion stack [2018-06-22 01:00:49,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-22 01:00:49,309 WARN ]: Verification canceled [2018-06-22 01:00:49,313 WARN ]: Timeout [2018-06-22 01:00:49,313 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:00:49 BoogieIcfgContainer [2018-06-22 01:00:49,313 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:00:49,313 INFO ]: Toolchain (without parser) took 63005.52 ms. Allocated memory was 305.7 MB in the beginning and 833.6 MB in the end (delta: 528.0 MB). Free memory was 227.1 MB in the beginning and 283.5 MB in the end (delta: -56.5 MB). Peak memory consumption was 471.5 MB. Max. memory is 3.6 GB. [2018-06-22 01:00:49,314 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 305.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:00:49,314 INFO ]: ChcToBoogie took 75.84 ms. Allocated memory is still 305.7 MB. Free memory was 227.1 MB in the beginning and 224.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:00:49,314 INFO ]: Boogie Preprocessor took 70.37 ms. Allocated memory is still 305.7 MB. Free memory was 224.1 MB in the beginning and 222.1 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:00:49,315 INFO ]: RCFGBuilder took 1005.26 ms. Allocated memory was 305.7 MB in the beginning and 326.1 MB in the end (delta: 20.4 MB). Free memory was 222.1 MB in the beginning and 272.0 MB in the end (delta: -49.9 MB). Peak memory consumption was 43.2 MB. Max. memory is 3.6 GB. [2018-06-22 01:00:49,315 INFO ]: TraceAbstraction took 61836.46 ms. Allocated memory was 326.1 MB in the beginning and 833.6 MB in the end (delta: 507.5 MB). Free memory was 272.0 MB in the beginning and 283.5 MB in the end (delta: -11.5 MB). Peak memory consumption was 496.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:00:49,317 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.7 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 75.84 ms. Allocated memory is still 305.7 MB. Free memory was 227.1 MB in the beginning and 224.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 70.37 ms. Allocated memory is still 305.7 MB. Free memory was 224.1 MB in the beginning and 222.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1005.26 ms. Allocated memory was 305.7 MB in the beginning and 326.1 MB in the end (delta: 20.4 MB). Free memory was 222.1 MB in the beginning and 272.0 MB in the end (delta: -49.9 MB). Peak memory consumption was 43.2 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61836.46 ms. Allocated memory was 326.1 MB in the beginning and 833.6 MB in the end (delta: 507.5 MB). Free memory was 272.0 MB in the beginning and 283.5 MB in the end (delta: -11.5 MB). Peak memory consumption was 496.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 51 states, 67 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 169. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. TIMEOUT Result, 61.7s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 46.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 681 SDtfs, 8980 SDslu, 23876 SDs, 0 SdLazy, 8335 SolverSat, 1007 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 857 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 759 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23162 ImplicationChecksByTransitivity, 49.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 1499 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 604 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 588 ConstructedInterpolants, 38 QuantifiedInterpolants, 99074 SizeOfPredicates, 365 NumberOfNonLiveVariables, 6210 ConjunctsInSsa, 380 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 40/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/21.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-00-49-326.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/21.c.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-00-49-326.csv Completed graceful shutdown