java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/012-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:11:25,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:11:25,293 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:11:25,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:11:25,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:11:25,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:11:25,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:11:25,311 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:11:25,313 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:11:25,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:11:25,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:11:25,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:11:25,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:11:25,316 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:11:25,317 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:11:25,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:11:25,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:11:25,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:11:25,328 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:11:25,329 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:11:25,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:11:25,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:11:25,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:11:25,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:11:25,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:11:25,334 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:11:25,335 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:11:25,335 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:11:25,336 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:11:25,337 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:11:25,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:11:25,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:11:25,338 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:11:25,339 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:11:25,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:11:25,340 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:11:25,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:11:25,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:11:25,354 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:11:25,355 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:11:25,356 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:11:25,356 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:11:25,356 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:11:25,356 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:11:25,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:11:25,357 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:11:25,357 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:11:25,357 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:11:25,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:11:25,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:11:25,357 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:11:25,358 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:11:25,358 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:11:25,358 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:11:25,358 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:11:25,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:11:25,359 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:11:25,360 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:11:25,360 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:11:25,407 INFO ]: Repository-Root is: /tmp [2018-06-25 09:11:25,425 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:11:25,428 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:11:25,430 INFO ]: Initializing SmtParser... [2018-06-25 09:11:25,430 INFO ]: SmtParser initialized [2018-06-25 09:11:25,431 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/012-horn.smt2 [2018-06-25 09:11:25,432 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-25 09:11:25,528 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/012-horn.smt2 unknown [2018-06-25 09:11:25,726 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/012-horn.smt2 [2018-06-25 09:11:25,731 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:11:25,737 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:11:25,738 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:11:25,738 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:11:25,738 INFO ]: ChcToBoogie initialized [2018-06-25 09:11:25,741 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:11:25" (1/1) ... [2018-06-25 09:11:25,791 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25 Unit [2018-06-25 09:11:25,791 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:11:25,792 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:11:25,792 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:11:25,792 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:11:25,813 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25" (1/1) ... [2018-06-25 09:11:25,813 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25" (1/1) ... [2018-06-25 09:11:25,819 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25" (1/1) ... [2018-06-25 09:11:25,820 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25" (1/1) ... [2018-06-25 09:11:25,822 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25" (1/1) ... [2018-06-25 09:11:25,826 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25" (1/1) ... [2018-06-25 09:11:25,827 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25" (1/1) ... [2018-06-25 09:11:25,830 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:11:25,830 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:11:25,830 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:11:25,830 INFO ]: RCFGBuilder initialized [2018-06-25 09:11:25,831 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-25 09:11:25,850 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:11:25,850 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:11:25,850 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:11:25,850 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:11:25,850 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:11:25,850 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:11:26,120 INFO ]: Using library mode [2018-06-25 09:11:26,121 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:11:26 BoogieIcfgContainer [2018-06-25 09:11:26,121 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:11:26,130 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:11:26,130 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:11:26,139 INFO ]: TraceAbstraction initialized [2018-06-25 09:11:26,139 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:11:25" (1/3) ... [2018-06-25 09:11:26,140 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcd0bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:11:26, skipping insertion in model container [2018-06-25 09:11:26,140 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:11:25" (2/3) ... [2018-06-25 09:11:26,140 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcd0bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:11:26, skipping insertion in model container [2018-06-25 09:11:26,140 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:11:26" (3/3) ... [2018-06-25 09:11:26,141 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:11:26,150 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:11:26,160 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:11:26,215 INFO ]: Using default assertion order modulation [2018-06-25 09:11:26,216 INFO ]: Interprodecural is true [2018-06-25 09:11:26,216 INFO ]: Hoare is false [2018-06-25 09:11:26,216 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:11:26,216 INFO ]: Backedges is TWOTRACK [2018-06-25 09:11:26,216 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:11:26,216 INFO ]: Difference is false [2018-06-25 09:11:26,216 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:11:26,216 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:11:26,235 INFO ]: Start isEmpty. Operand 12 states. [2018-06-25 09:11:26,250 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 09:11:26,250 INFO ]: Found error trace [2018-06-25 09:11:26,251 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 09:11:26,251 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:26,259 INFO ]: Analyzing trace with hash 2118833424, now seen corresponding path program 1 times [2018-06-25 09:11:26,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:26,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:26,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:26,302 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:26,302 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:26,327 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:26,359 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:26,362 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:26,362 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-25 09:11:26,364 INFO ]: Interpolant automaton has 2 states [2018-06-25 09:11:26,379 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-25 09:11:26,379 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:11:26,382 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-25 09:11:26,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:26,400 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-25 09:11:26,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-25 09:11:26,401 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-25 09:11:26,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:26,409 INFO ]: With dead ends: 10 [2018-06-25 09:11:26,409 INFO ]: Without dead ends: 10 [2018-06-25 09:11:26,411 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-25 09:11:26,423 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:26,437 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:26,439 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:26,439 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-25 09:11:26,440 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 6 [2018-06-25 09:11:26,441 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:26,441 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-25 09:11:26,441 INFO ]: Interpolant automaton has 2 states. [2018-06-25 09:11:26,441 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-25 09:11:26,441 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:11:26,441 INFO ]: Found error trace [2018-06-25 09:11:26,441 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:26,441 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:26,441 INFO ]: Analyzing trace with hash 1263908916, now seen corresponding path program 1 times [2018-06-25 09:11:26,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:26,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:26,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:26,442 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:26,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:26,462 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:26,540 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:26,540 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:26,540 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:26,542 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:26,542 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:26,542 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:26,542 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 3 states. [2018-06-25 09:11:26,602 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:26,602 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-25 09:11:26,603 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:26,603 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:11:26,603 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:26,605 INFO ]: With dead ends: 14 [2018-06-25 09:11:26,605 INFO ]: Without dead ends: 14 [2018-06-25 09:11:26,606 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:26,606 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:26,610 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-25 09:11:26,610 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:26,610 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-25 09:11:26,611 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2018-06-25 09:11:26,611 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:26,611 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-25 09:11:26,611 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:26,611 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-25 09:11:26,611 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:26,611 INFO ]: Found error trace [2018-06-25 09:11:26,611 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:26,611 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:26,611 INFO ]: Analyzing trace with hash 524141432, now seen corresponding path program 1 times [2018-06-25 09:11:26,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:26,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:26,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:26,612 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:26,612 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:26,631 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:26,663 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:26,663 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:26,663 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:11:26,663 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:11:26,664 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:11:26,664 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:26,664 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2018-06-25 09:11:26,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:26,702 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-25 09:11:26,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:11:26,703 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:11:26,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:26,703 INFO ]: With dead ends: 10 [2018-06-25 09:11:26,703 INFO ]: Without dead ends: 10 [2018-06-25 09:11:26,704 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:11:26,704 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:26,705 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:26,705 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:26,705 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-25 09:11:26,705 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-25 09:11:26,706 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:26,706 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-25 09:11:26,706 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:11:26,706 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-25 09:11:26,706 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:26,706 INFO ]: Found error trace [2018-06-25 09:11:26,706 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:26,706 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:26,706 INFO ]: Analyzing trace with hash 516604309, now seen corresponding path program 1 times [2018-06-25 09:11:26,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:26,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:26,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:26,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:26,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:26,720 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:26,803 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:26,803 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:26,803 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:11:26,803 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:26,803 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:26,803 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:26,804 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 4 states. [2018-06-25 09:11:26,989 WARN ]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-25 09:11:27,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:27,137 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-25 09:11:27,138 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:11:27,138 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:11:27,139 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:27,139 INFO ]: With dead ends: 14 [2018-06-25 09:11:27,139 INFO ]: Without dead ends: 14 [2018-06-25 09:11:27,139 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:11:27,139 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:27,141 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-25 09:11:27,141 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:27,141 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-06-25 09:11:27,142 INFO ]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2018-06-25 09:11:27,142 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:27,142 INFO ]: Abstraction has 11 states and 14 transitions. [2018-06-25 09:11:27,142 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:27,142 INFO ]: Start isEmpty. Operand 11 states and 14 transitions. [2018-06-25 09:11:27,142 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:11:27,142 INFO ]: Found error trace [2018-06-25 09:11:27,142 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:27,142 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:27,142 INFO ]: Analyzing trace with hash 520894213, now seen corresponding path program 1 times [2018-06-25 09:11:27,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:27,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:27,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:27,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:27,145 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:27,165 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:27,217 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:27,217 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:27,217 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:27,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:27,272 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:27,280 INFO ]: Computing forward predicates... [2018-06-25 09:11:27,310 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:27,343 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:27,343 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 09:11:27,343 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:27,343 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:27,343 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:27,344 INFO ]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2018-06-25 09:11:27,399 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:27,400 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-25 09:11:27,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:11:27,400 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:11:27,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:27,400 INFO ]: With dead ends: 11 [2018-06-25 09:11:27,400 INFO ]: Without dead ends: 11 [2018-06-25 09:11:27,401 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:11:27,401 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:11:27,402 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:11:27,402 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:11:27,403 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-25 09:11:27,403 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-06-25 09:11:27,403 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:27,403 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-25 09:11:27,403 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:27,403 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-25 09:11:27,403 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:11:27,403 INFO ]: Found error trace [2018-06-25 09:11:27,403 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:27,403 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:27,404 INFO ]: Analyzing trace with hash -1164843297, now seen corresponding path program 1 times [2018-06-25 09:11:27,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:27,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:27,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:27,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:27,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:27,415 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:27,484 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:27,484 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:11:27,484 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:11:27,484 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:11:27,484 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:11:27,484 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:11:27,484 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-06-25 09:11:27,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:27,551 INFO ]: Finished difference Result 11 states and 12 transitions. [2018-06-25 09:11:27,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:11:27,552 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 09:11:27,553 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:27,553 INFO ]: With dead ends: 11 [2018-06-25 09:11:27,553 INFO ]: Without dead ends: 10 [2018-06-25 09:11:27,553 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:11:27,553 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:11:27,554 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:11:27,555 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:11:27,555 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-25 09:11:27,555 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2018-06-25 09:11:27,555 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:27,555 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-25 09:11:27,555 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:11:27,555 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-25 09:11:27,555 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:11:27,555 INFO ]: Found error trace [2018-06-25 09:11:27,555 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:27,556 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:27,556 INFO ]: Analyzing trace with hash -1042015004, now seen corresponding path program 1 times [2018-06-25 09:11:27,556 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:27,556 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:27,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:27,557 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:27,557 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:27,586 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:27,792 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:27,792 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:27,792 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:27,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:27,825 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:27,828 INFO ]: Computing forward predicates... [2018-06-25 09:11:28,086 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:28,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:28,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 09:11:28,108 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:11:28,108 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:11:28,109 INFO ]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:11:28,109 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-06-25 09:11:28,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:28,437 INFO ]: Finished difference Result 22 states and 28 transitions. [2018-06-25 09:11:28,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:11:28,437 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-25 09:11:28,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:28,438 INFO ]: With dead ends: 22 [2018-06-25 09:11:28,438 INFO ]: Without dead ends: 22 [2018-06-25 09:11:28,439 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:11:28,439 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 09:11:28,440 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-06-25 09:11:28,440 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:11:28,441 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-25 09:11:28,441 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2018-06-25 09:11:28,441 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:28,441 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-25 09:11:28,441 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:11:28,441 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-25 09:11:28,442 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:11:28,442 INFO ]: Found error trace [2018-06-25 09:11:28,442 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:28,442 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:28,442 INFO ]: Analyzing trace with hash -639685020, now seen corresponding path program 1 times [2018-06-25 09:11:28,442 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:28,442 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:28,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:28,443 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:28,443 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:28,455 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:28,511 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:28,511 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:28,511 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:28,519 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:28,547 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:28,549 INFO ]: Computing forward predicates... [2018-06-25 09:11:28,573 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:28,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:28,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-25 09:11:28,605 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:11:28,605 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:11:28,605 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:11:28,606 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 6 states. [2018-06-25 09:11:28,876 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:28,877 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-25 09:11:28,878 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:11:28,878 INFO ]: Start accepts. Automaton has 6 states. Word has length 11 [2018-06-25 09:11:28,878 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:28,878 INFO ]: With dead ends: 16 [2018-06-25 09:11:28,878 INFO ]: Without dead ends: 14 [2018-06-25 09:11:28,879 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:11:28,879 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:28,880 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:11:28,880 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:11:28,880 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-25 09:11:28,880 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-25 09:11:28,880 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:28,880 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-25 09:11:28,880 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:11:28,880 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-25 09:11:28,881 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:11:28,881 INFO ]: Found error trace [2018-06-25 09:11:28,881 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:28,881 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:28,881 INFO ]: Analyzing trace with hash -1126975233, now seen corresponding path program 2 times [2018-06-25 09:11:28,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:28,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:28,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:28,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:28,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:28,907 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:29,050 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:29,050 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:29,050 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-25 09:11:29,057 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:11:29,099 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:11:29,099 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:29,102 INFO ]: Computing forward predicates... [2018-06-25 09:11:29,603 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:29,635 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:29,635 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-25 09:11:29,635 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:11:29,635 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:11:29,635 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:11:29,635 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 12 states. [2018-06-25 09:11:29,926 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:29,927 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-25 09:11:29,943 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:11:29,943 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-25 09:11:29,943 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:29,943 INFO ]: With dead ends: 16 [2018-06-25 09:11:29,943 INFO ]: Without dead ends: 16 [2018-06-25 09:11:29,944 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:11:29,944 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:11:29,946 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-25 09:11:29,946 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:11:29,946 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-25 09:11:29,946 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-06-25 09:11:29,946 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:29,946 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-25 09:11:29,946 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:11:29,946 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-25 09:11:29,946 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:11:29,947 INFO ]: Found error trace [2018-06-25 09:11:29,947 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:29,947 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:29,947 INFO ]: Analyzing trace with hash -576201547, now seen corresponding path program 3 times [2018-06-25 09:11:29,947 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:29,947 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:29,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:29,948 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:29,948 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:29,958 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:30,130 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:30,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:30,130 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:30,136 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:11:30,172 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-25 09:11:30,172 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:30,175 INFO ]: Computing forward predicates... [2018-06-25 09:11:30,284 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:30,311 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:30,311 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-25 09:11:30,311 INFO ]: Interpolant automaton has 11 states [2018-06-25 09:11:30,311 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 09:11:30,311 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:11:30,311 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 11 states. [2018-06-25 09:11:30,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:30,412 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-25 09:11:30,412 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:11:30,412 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-25 09:11:30,413 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:30,413 INFO ]: With dead ends: 20 [2018-06-25 09:11:30,413 INFO ]: Without dead ends: 20 [2018-06-25 09:11:30,413 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:11:30,413 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:11:30,415 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-25 09:11:30,415 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:11:30,415 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-25 09:11:30,415 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-06-25 09:11:30,415 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:30,415 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-25 09:11:30,415 INFO ]: Interpolant automaton has 11 states. [2018-06-25 09:11:30,416 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-25 09:11:30,416 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:11:30,416 INFO ]: Found error trace [2018-06-25 09:11:30,416 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:30,416 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:30,416 INFO ]: Analyzing trace with hash -682086465, now seen corresponding path program 4 times [2018-06-25 09:11:30,416 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:30,416 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:30,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:30,417 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:30,417 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:30,427 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:30,881 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:30,881 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:30,881 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:30,888 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:11:30,914 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:11:30,914 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:30,916 INFO ]: Computing forward predicates... [2018-06-25 09:11:30,925 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:30,953 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:30,953 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-25 09:11:30,953 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:11:30,953 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:11:30,953 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:11:30,953 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2018-06-25 09:11:31,006 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:31,006 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-25 09:11:31,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:11:31,006 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-25 09:11:31,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:31,006 INFO ]: With dead ends: 17 [2018-06-25 09:11:31,006 INFO ]: Without dead ends: 14 [2018-06-25 09:11:31,007 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-06-25 09:11:31,007 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:11:31,008 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:11:31,008 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:11:31,008 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-25 09:11:31,008 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 13 [2018-06-25 09:11:31,009 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:31,009 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-25 09:11:31,009 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:11:31,009 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-25 09:11:31,009 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:11:31,009 INFO ]: Found error trace [2018-06-25 09:11:31,009 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:31,009 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:31,009 INFO ]: Analyzing trace with hash 1391786116, now seen corresponding path program 5 times [2018-06-25 09:11:31,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:31,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:31,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:31,010 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:31,010 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:31,022 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:31,252 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:31,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:31,252 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:31,265 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:11:31,284 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 09:11:31,284 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:31,287 INFO ]: Computing forward predicates... [2018-06-25 09:11:31,750 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:31,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:31,770 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-25 09:11:31,770 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:11:31,770 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:11:31,770 INFO ]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:11:31,770 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 16 states. [2018-06-25 09:11:32,580 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:32,580 INFO ]: Finished difference Result 37 states and 46 transitions. [2018-06-25 09:11:32,580 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 09:11:32,580 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-25 09:11:32,580 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:32,580 INFO ]: With dead ends: 37 [2018-06-25 09:11:32,580 INFO ]: Without dead ends: 37 [2018-06-25 09:11:32,581 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-25 09:11:32,581 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 09:11:32,583 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-06-25 09:11:32,583 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:11:32,584 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2018-06-25 09:11:32,584 INFO ]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 13 [2018-06-25 09:11:32,584 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:32,584 INFO ]: Abstraction has 20 states and 26 transitions. [2018-06-25 09:11:32,584 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:11:32,584 INFO ]: Start isEmpty. Operand 20 states and 26 transitions. [2018-06-25 09:11:32,585 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:11:32,585 INFO ]: Found error trace [2018-06-25 09:11:32,585 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:32,585 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:32,585 INFO ]: Analyzing trace with hash 195988944, now seen corresponding path program 6 times [2018-06-25 09:11:32,585 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:32,585 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:32,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:32,586 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:32,586 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:32,597 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:32,845 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:32,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:32,845 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:32,852 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:11:32,891 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-25 09:11:32,891 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:32,894 INFO ]: Computing forward predicates... [2018-06-25 09:11:33,006 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:33,027 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:33,027 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-25 09:11:33,027 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:11:33,027 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:11:33,027 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:11:33,028 INFO ]: Start difference. First operand 20 states and 26 transitions. Second operand 14 states. [2018-06-25 09:11:33,234 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:33,234 INFO ]: Finished difference Result 27 states and 34 transitions. [2018-06-25 09:11:33,235 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:11:33,235 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-25 09:11:33,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:33,236 INFO ]: With dead ends: 27 [2018-06-25 09:11:33,236 INFO ]: Without dead ends: 27 [2018-06-25 09:11:33,236 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:11:33,236 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-25 09:11:33,238 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-25 09:11:33,238 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:11:33,239 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-25 09:11:33,239 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2018-06-25 09:11:33,239 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:33,239 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-25 09:11:33,239 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:11:33,239 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-25 09:11:33,239 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:11:33,239 INFO ]: Found error trace [2018-06-25 09:11:33,239 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:33,239 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:33,240 INFO ]: Analyzing trace with hash 1780982276, now seen corresponding path program 7 times [2018-06-25 09:11:33,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:33,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:33,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:33,240 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:33,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:33,258 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:33,333 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:33,333 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:33,333 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:33,339 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:33,354 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:33,356 INFO ]: Computing forward predicates... [2018-06-25 09:11:33,365 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:33,384 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:33,384 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-25 09:11:33,385 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:11:33,385 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:11:33,385 INFO ]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:11:33,385 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 10 states. [2018-06-25 09:11:33,472 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:33,472 INFO ]: Finished difference Result 24 states and 29 transitions. [2018-06-25 09:11:33,473 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:11:33,473 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-25 09:11:33,473 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:33,473 INFO ]: With dead ends: 24 [2018-06-25 09:11:33,473 INFO ]: Without dead ends: 20 [2018-06-25 09:11:33,474 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:11:33,474 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:11:33,475 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:11:33,475 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:11:33,476 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-06-25 09:11:33,476 INFO ]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2018-06-25 09:11:33,476 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:33,476 INFO ]: Abstraction has 20 states and 25 transitions. [2018-06-25 09:11:33,476 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:11:33,476 INFO ]: Start isEmpty. Operand 20 states and 25 transitions. [2018-06-25 09:11:33,476 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:11:33,476 INFO ]: Found error trace [2018-06-25 09:11:33,476 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:33,476 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:33,476 INFO ]: Analyzing trace with hash 1646522847, now seen corresponding path program 8 times [2018-06-25 09:11:33,476 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:33,476 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:33,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:33,477 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:11:33,477 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:33,491 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:33,809 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:33,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:33,809 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:33,815 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:11:33,852 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:11:33,852 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:33,856 INFO ]: Computing forward predicates... [2018-06-25 09:11:36,489 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:36,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:36,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-25 09:11:36,521 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:11:36,521 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:11:36,521 INFO ]: CoverageRelationStatistics Valid=69, Invalid=307, Unknown=4, NotChecked=0, Total=380 [2018-06-25 09:11:36,522 INFO ]: Start difference. First operand 20 states and 25 transitions. Second operand 20 states. [2018-06-25 09:11:40,555 WARN ]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-06-25 09:11:44,181 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:44,181 INFO ]: Finished difference Result 45 states and 55 transitions. [2018-06-25 09:11:44,181 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 09:11:44,181 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-25 09:11:44,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:44,181 INFO ]: With dead ends: 45 [2018-06-25 09:11:44,182 INFO ]: Without dead ends: 45 [2018-06-25 09:11:44,182 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=325, Invalid=997, Unknown=10, NotChecked=0, Total=1332 [2018-06-25 09:11:44,182 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 09:11:44,184 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 23. [2018-06-25 09:11:44,184 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:11:44,185 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2018-06-25 09:11:44,185 INFO ]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2018-06-25 09:11:44,185 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:44,185 INFO ]: Abstraction has 23 states and 30 transitions. [2018-06-25 09:11:44,185 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:11:44,185 INFO ]: Start isEmpty. Operand 23 states and 30 transitions. [2018-06-25 09:11:44,185 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:11:44,185 INFO ]: Found error trace [2018-06-25 09:11:44,185 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:44,185 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:44,186 INFO ]: Analyzing trace with hash -497106987, now seen corresponding path program 9 times [2018-06-25 09:11:44,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:44,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:44,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:44,186 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:44,186 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:44,198 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:44,442 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:44,442 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:44,442 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:44,448 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:11:44,469 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:11:44,469 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:44,472 INFO ]: Computing forward predicates... [2018-06-25 09:11:44,669 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:44,697 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:44,697 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-25 09:11:44,697 INFO ]: Interpolant automaton has 17 states [2018-06-25 09:11:44,697 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-25 09:11:44,697 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:11:44,697 INFO ]: Start difference. First operand 23 states and 30 transitions. Second operand 17 states. [2018-06-25 09:11:45,115 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:45,115 INFO ]: Finished difference Result 31 states and 39 transitions. [2018-06-25 09:11:45,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:11:45,115 INFO ]: Start accepts. Automaton has 17 states. Word has length 16 [2018-06-25 09:11:45,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:45,116 INFO ]: With dead ends: 31 [2018-06-25 09:11:45,116 INFO ]: Without dead ends: 31 [2018-06-25 09:11:45,116 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:11:45,116 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 09:11:45,123 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-06-25 09:11:45,123 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 09:11:45,124 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2018-06-25 09:11:45,124 INFO ]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2018-06-25 09:11:45,124 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:45,124 INFO ]: Abstraction has 24 states and 31 transitions. [2018-06-25 09:11:45,124 INFO ]: Interpolant automaton has 17 states. [2018-06-25 09:11:45,124 INFO ]: Start isEmpty. Operand 24 states and 31 transitions. [2018-06-25 09:11:45,125 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:11:45,125 INFO ]: Found error trace [2018-06-25 09:11:45,125 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:45,125 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:45,125 INFO ]: Analyzing trace with hash 1769844895, now seen corresponding path program 10 times [2018-06-25 09:11:45,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:45,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:45,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:45,125 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:45,125 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:45,134 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:45,260 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:45,260 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:45,260 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:45,267 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:11:45,284 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:11:45,284 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:45,286 INFO ]: Computing forward predicates... [2018-06-25 09:11:45,297 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:45,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:45,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-25 09:11:45,323 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:11:45,323 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:11:45,323 INFO ]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:11:45,323 INFO ]: Start difference. First operand 24 states and 31 transitions. Second operand 12 states. [2018-06-25 09:11:45,375 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:11:45,375 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-25 09:11:45,375 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:11:45,375 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-25 09:11:45,375 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:11:45,376 INFO ]: With dead ends: 28 [2018-06-25 09:11:45,376 INFO ]: Without dead ends: 23 [2018-06-25 09:11:45,376 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-06-25 09:11:45,376 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 09:11:45,377 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-25 09:11:45,378 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 09:11:45,378 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2018-06-25 09:11:45,378 INFO ]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2018-06-25 09:11:45,378 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:11:45,378 INFO ]: Abstraction has 23 states and 29 transitions. [2018-06-25 09:11:45,378 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:11:45,378 INFO ]: Start isEmpty. Operand 23 states and 29 transitions. [2018-06-25 09:11:45,378 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:11:45,378 INFO ]: Found error trace [2018-06-25 09:11:45,378 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:11:45,379 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:11:45,379 INFO ]: Analyzing trace with hash 1896569892, now seen corresponding path program 11 times [2018-06-25 09:11:45,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:11:45,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:11:45,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:45,379 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:11:45,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:11:45,391 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:46,389 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:46,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:11:46,389 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:11:46,395 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:11:46,437 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:11:46,437 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:11:46,442 INFO ]: Computing forward predicates... [2018-06-25 09:11:53,714 INFO ]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:11:53,733 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:11:53,733 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-25 09:11:53,733 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:11:53,734 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:11:53,734 INFO ]: CoverageRelationStatistics Valid=92, Invalid=456, Unknown=4, NotChecked=0, Total=552 [2018-06-25 09:11:53,734 INFO ]: Start difference. First operand 23 states and 29 transitions. Second operand 24 states. [2018-06-25 09:12:00,882 WARN ]: Spent 6.95 s on a formula simplification that was a NOOP. DAG size: 73 [2018-06-25 09:12:08,951 WARN ]: Spent 8.04 s on a formula simplification that was a NOOP. DAG size: 73 [2018-06-25 09:12:17,239 WARN ]: Spent 8.18 s on a formula simplification that was a NOOP. DAG size: 74 [2018-06-25 09:12:25,346 WARN ]: Spent 8.06 s on a formula simplification that was a NOOP. DAG size: 73 [2018-06-25 09:12:27,414 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:27,414 INFO ]: Finished difference Result 28 states and 34 transitions. [2018-06-25 09:12:27,414 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:12:27,414 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-25 09:12:27,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:27,415 INFO ]: With dead ends: 28 [2018-06-25 09:12:27,415 INFO ]: Without dead ends: 28 [2018-06-25 09:12:27,415 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=182, Invalid=626, Unknown=4, NotChecked=0, Total=812 [2018-06-25 09:12:27,415 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 09:12:27,417 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-06-25 09:12:27,417 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:12:27,417 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-25 09:12:27,417 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-25 09:12:27,417 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:27,417 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-25 09:12:27,417 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:12:27,418 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-25 09:12:27,418 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:12:27,418 INFO ]: Found error trace [2018-06-25 09:12:27,418 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:27,418 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:27,418 INFO ]: Analyzing trace with hash -1335583184, now seen corresponding path program 12 times [2018-06-25 09:12:27,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:27,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:27,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:27,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:27,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:27,432 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:27,651 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:27,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:27,651 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:12:27,667 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:27,695 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:12:27,695 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:27,699 INFO ]: Computing forward predicates... [2018-06-25 09:12:27,854 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:27,873 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:27,873 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-25 09:12:27,873 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:12:27,873 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:12:27,873 INFO ]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:12:27,873 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-25 09:12:28,132 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:28,132 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-25 09:12:28,132 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 09:12:28,132 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-25 09:12:28,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:28,132 INFO ]: With dead ends: 29 [2018-06-25 09:12:28,132 INFO ]: Without dead ends: 29 [2018-06-25 09:12:28,133 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-06-25 09:12:28,133 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 09:12:28,137 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-25 09:12:28,137 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 09:12:28,138 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-25 09:12:28,138 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-06-25 09:12:28,138 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:28,138 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-25 09:12:28,138 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:12:28,138 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-25 09:12:28,138 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:12:28,138 INFO ]: Found error trace [2018-06-25 09:12:28,138 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:28,138 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:28,138 INFO ]: Analyzing trace with hash 1546886564, now seen corresponding path program 13 times [2018-06-25 09:12:28,138 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:28,138 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:28,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:28,139 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:28,139 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:28,152 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:28,389 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:28,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:28,389 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:28,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:28,418 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:28,420 INFO ]: Computing forward predicates... [2018-06-25 09:12:28,431 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:28,464 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:28,464 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-25 09:12:28,465 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:12:28,465 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:12:28,465 INFO ]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:12:28,465 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 14 states. [2018-06-25 09:12:28,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:28,606 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-25 09:12:28,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 09:12:28,606 INFO ]: Start accepts. Automaton has 14 states. Word has length 19 [2018-06-25 09:12:28,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:28,606 INFO ]: With dead ends: 26 [2018-06-25 09:12:28,606 INFO ]: Without dead ends: 20 [2018-06-25 09:12:28,606 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:12:28,606 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:12:28,608 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:12:28,608 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:12:28,609 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-25 09:12:28,609 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2018-06-25 09:12:28,609 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:28,609 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-25 09:12:28,609 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:12:28,609 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-25 09:12:28,609 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:12:28,609 INFO ]: Found error trace [2018-06-25 09:12:28,609 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:28,609 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:28,609 INFO ]: Analyzing trace with hash 1180394175, now seen corresponding path program 14 times [2018-06-25 09:12:28,609 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:28,609 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:28,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:28,610 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:12:28,610 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:28,624 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:29,108 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:29,108 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:29,108 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-25 09:12:29,124 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:29,151 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:12:29,151 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:29,156 INFO ]: Computing forward predicates... [2018-06-25 09:12:30,569 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:30,589 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:12:30,589 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-06-25 09:12:30,589 INFO ]: Interpolant automaton has 28 states [2018-06-25 09:12:30,590 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 09:12:30,590 INFO ]: CoverageRelationStatistics Valid=118, Invalid=634, Unknown=4, NotChecked=0, Total=756 [2018-06-25 09:12:30,590 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 28 states. [2018-06-25 09:12:31,031 WARN ]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-06-25 09:12:31,475 WARN ]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-25 09:12:32,252 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 119 [2018-06-25 09:12:32,700 WARN ]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-06-25 09:12:32,889 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 120 [2018-06-25 09:12:33,288 WARN ]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-06-25 09:12:34,225 WARN ]: Spent 122.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 119 [2018-06-25 09:12:34,455 WARN ]: Spent 115.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 119 [2018-06-25 09:12:35,823 WARN ]: Spent 104.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 95 [2018-06-25 09:12:39,667 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-06-25 09:12:40,233 WARN ]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-06-25 09:12:40,345 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:12:40,345 INFO ]: Finished difference Result 64 states and 77 transitions. [2018-06-25 09:12:40,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-25 09:12:40,345 INFO ]: Start accepts. Automaton has 28 states. Word has length 19 [2018-06-25 09:12:40,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:12:40,346 INFO ]: With dead ends: 64 [2018-06-25 09:12:40,346 INFO ]: Without dead ends: 64 [2018-06-25 09:12:40,347 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=811, Invalid=2718, Unknown=11, NotChecked=0, Total=3540 [2018-06-25 09:12:40,347 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-25 09:12:40,349 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 29. [2018-06-25 09:12:40,349 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 09:12:40,350 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-06-25 09:12:40,350 INFO ]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 19 [2018-06-25 09:12:40,350 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:12:40,350 INFO ]: Abstraction has 29 states and 38 transitions. [2018-06-25 09:12:40,350 INFO ]: Interpolant automaton has 28 states. [2018-06-25 09:12:40,350 INFO ]: Start isEmpty. Operand 29 states and 38 transitions. [2018-06-25 09:12:40,350 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:12:40,350 INFO ]: Found error trace [2018-06-25 09:12:40,350 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:12:40,350 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:12:40,351 INFO ]: Analyzing trace with hash -2062193931, now seen corresponding path program 15 times [2018-06-25 09:12:40,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:12:40,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:12:40,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:40,351 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:12:40,351 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:12:40,362 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:40,576 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:12:40,576 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:12:40,576 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:40,584 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:12:40,608 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-25 09:12:40,608 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:12:40,612 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-25 09:12:40,784 INFO ]: Timeout while computing interpolants [2018-06-25 09:12:40,984 WARN ]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:12:40,984 WARN ]: Verification canceled [2018-06-25 09:12:40,987 WARN ]: Timeout [2018-06-25 09:12:40,988 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:12:40 BoogieIcfgContainer [2018-06-25 09:12:40,988 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:12:40,988 INFO ]: Toolchain (without parser) took 75256.76 ms. Allocated memory was 309.9 MB in the beginning and 426.2 MB in the end (delta: 116.4 MB). Free memory was 264.4 MB in the beginning and 308.7 MB in the end (delta: -44.3 MB). Peak memory consumption was 72.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:40,989 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.9 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:12:40,989 INFO ]: ChcToBoogie took 53.73 ms. Allocated memory is still 309.9 MB. Free memory was 264.4 MB in the beginning and 262.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:40,989 INFO ]: Boogie Preprocessor took 37.60 ms. Allocated memory is still 309.9 MB. Free memory is still 262.4 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:12:40,994 INFO ]: RCFGBuilder took 290.77 ms. Allocated memory is still 309.9 MB. Free memory was 262.4 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:40,994 INFO ]: TraceAbstraction took 74857.64 ms. Allocated memory was 309.9 MB in the beginning and 426.2 MB in the end (delta: 116.4 MB). Free memory was 252.4 MB in the beginning and 308.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 60.1 MB. Max. memory is 3.6 GB. [2018-06-25 09:12:40,996 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 309.9 MB. Free memory is still 274.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 53.73 ms. Allocated memory is still 309.9 MB. Free memory was 264.4 MB in the beginning and 262.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.60 ms. Allocated memory is still 309.9 MB. Free memory is still 262.4 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 290.77 ms. Allocated memory is still 309.9 MB. Free memory was 262.4 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 74857.64 ms. Allocated memory was 309.9 MB in the beginning and 426.2 MB in the end (delta: 116.4 MB). Free memory was 252.4 MB in the beginning and 308.7 MB in the end (delta: -56.3 MB). Peak memory consumption was 60.1 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 analyzing trace of length 21 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 12 locations, 1 error locations. TIMEOUT Result, 74.7s OverallTime, 22 OverallIterations, 6 TraceHistogramMax, 54.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 SDtfs, 355 SDslu, 899 SDs, 0 SdLazy, 1243 SolverSat, 506 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 179 SyntacticMatches, 8 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1628 ImplicationChecksByTransitivity, 65.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 125 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 455 ConstructedInterpolants, 22 QuantifiedInterpolants, 55515 SizeOfPredicates, 63 NumberOfNonLiveVariables, 2166 ConjunctsInSsa, 1176 ConjunctsInUnsatCore, 37 InterpolantComputations, 5 PerfectInterpolantSequences, 112/501 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/012-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-12-41-007.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/012-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-12-41-007.csv Completed graceful shutdown