java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/001b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:06:37,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:06:37,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:06:37,335 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:06:37,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:06:37,337 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:06:37,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:06:37,341 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:06:37,343 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:06:37,345 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:06:37,346 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:06:37,346 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:06:37,347 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:06:37,350 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:06:37,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:06:37,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:06:37,361 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:06:37,362 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:06:37,364 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:06:37,365 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:06:37,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:06:37,371 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:06:37,371 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:06:37,371 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:06:37,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:06:37,375 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:06:37,376 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:06:37,376 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:06:37,380 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:06:37,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:06:37,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:06:37,381 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:06:37,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:06:37,388 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:06:37,389 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:06:37,389 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:06:37,413 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:06:37,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:06:37,414 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:06:37,414 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:06:37,416 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:06:37,416 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:06:37,417 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:06:37,417 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:06:37,417 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:06:37,417 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:06:37,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:06:37,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:06:37,418 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:06:37,418 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:06:37,418 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:06:37,418 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:06:37,418 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:06:37,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:06:37,420 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:06:37,421 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:06:37,421 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:06:37,470 INFO ]: Repository-Root is: /tmp [2018-06-22 11:06:37,487 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:06:37,492 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:06:37,494 INFO ]: Initializing SmtParser... [2018-06-22 11:06:37,494 INFO ]: SmtParser initialized [2018-06-22 11:06:37,495 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/001b-horn.smt2 [2018-06-22 11:06:37,497 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:06:37,591 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/001b-horn.smt2 unknown [2018-06-22 11:06:37,966 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/001b-horn.smt2 [2018-06-22 11:06:37,975 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:06:37,982 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:06:37,983 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:06:37,983 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:06:37,983 INFO ]: ChcToBoogie initialized [2018-06-22 11:06:37,989 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:06:37" (1/1) ... [2018-06-22 11:06:38,056 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38 Unit [2018-06-22 11:06:38,056 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:06:38,056 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:06:38,056 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:06:38,056 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:06:38,076 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38" (1/1) ... [2018-06-22 11:06:38,077 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38" (1/1) ... [2018-06-22 11:06:38,096 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38" (1/1) ... [2018-06-22 11:06:38,097 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38" (1/1) ... [2018-06-22 11:06:38,118 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38" (1/1) ... [2018-06-22 11:06:38,122 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38" (1/1) ... [2018-06-22 11:06:38,124 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38" (1/1) ... [2018-06-22 11:06:38,127 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:06:38,128 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:06:38,128 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:06:38,128 INFO ]: RCFGBuilder initialized [2018-06-22 11:06:38,128 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:06:38,145 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:06:38,145 INFO ]: Found specification of procedure False [2018-06-22 11:06:38,145 INFO ]: Found implementation of procedure False [2018-06-22 11:06:38,145 INFO ]: Specification and implementation of procedure REC_f_ given in one single declaration [2018-06-22 11:06:38,145 INFO ]: Found specification of procedure REC_f_ [2018-06-22 11:06:38,145 INFO ]: Found implementation of procedure REC_f_ [2018-06-22 11:06:38,145 INFO ]: Specification and implementation of procedure REC__f given in one single declaration [2018-06-22 11:06:38,145 INFO ]: Found specification of procedure REC__f [2018-06-22 11:06:38,145 INFO ]: Found implementation of procedure REC__f [2018-06-22 11:06:38,145 INFO ]: Specification and implementation of procedure REC_f_f given in one single declaration [2018-06-22 11:06:38,145 INFO ]: Found specification of procedure REC_f_f [2018-06-22 11:06:38,145 INFO ]: Found implementation of procedure REC_f_f [2018-06-22 11:06:38,145 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:06:38,145 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:06:38,145 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:06:39,116 INFO ]: Using library mode [2018-06-22 11:06:39,117 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:39 BoogieIcfgContainer [2018-06-22 11:06:39,117 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:06:39,121 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:06:39,121 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:06:39,127 INFO ]: TraceAbstraction initialized [2018-06-22 11:06:39,127 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:06:37" (1/3) ... [2018-06-22 11:06:39,128 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f9d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:06:39, skipping insertion in model container [2018-06-22 11:06:39,128 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:06:38" (2/3) ... [2018-06-22 11:06:39,128 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7f9d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:06:39, skipping insertion in model container [2018-06-22 11:06:39,128 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:06:39" (3/3) ... [2018-06-22 11:06:39,130 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:06:39,142 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:06:39,153 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:06:39,196 INFO ]: Using default assertion order modulation [2018-06-22 11:06:39,197 INFO ]: Interprodecural is true [2018-06-22 11:06:39,197 INFO ]: Hoare is false [2018-06-22 11:06:39,197 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:06:39,197 INFO ]: Backedges is TWOTRACK [2018-06-22 11:06:39,197 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:06:39,197 INFO ]: Difference is false [2018-06-22 11:06:39,197 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:06:39,197 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:06:39,214 INFO ]: Start isEmpty. Operand 91 states. [2018-06-22 11:06:39,239 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:06:39,239 INFO ]: Found error trace [2018-06-22 11:06:39,240 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:06:39,241 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:39,246 INFO ]: Analyzing trace with hash 350648014, now seen corresponding path program 1 times [2018-06-22 11:06:39,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:39,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:39,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:39,313 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:39,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:39,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:39,359 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:06:39,362 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:06:39,362 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:06:39,364 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:06:39,380 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:06:39,381 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:06:39,384 INFO ]: Start difference. First operand 91 states. Second operand 2 states. [2018-06-22 11:06:39,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:39,491 INFO ]: Finished difference Result 66 states and 143 transitions. [2018-06-22 11:06:39,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:06:39,493 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:06:39,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:39,511 INFO ]: With dead ends: 66 [2018-06-22 11:06:39,511 INFO ]: Without dead ends: 66 [2018-06-22 11:06:39,513 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:06:39,534 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:06:39,593 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 11:06:39,594 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:06:39,598 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 143 transitions. [2018-06-22 11:06:39,600 INFO ]: Start accepts. Automaton has 66 states and 143 transitions. Word has length 5 [2018-06-22 11:06:39,601 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:39,601 INFO ]: Abstraction has 66 states and 143 transitions. [2018-06-22 11:06:39,601 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:06:39,601 INFO ]: Start isEmpty. Operand 66 states and 143 transitions. [2018-06-22 11:06:39,614 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:06:39,614 INFO ]: Found error trace [2018-06-22 11:06:39,614 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:39,614 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:39,614 INFO ]: Analyzing trace with hash -2143612445, now seen corresponding path program 1 times [2018-06-22 11:06:39,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:39,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:39,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:39,615 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:39,615 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:39,656 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:39,754 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:06:39,754 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:06:39,754 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:06:39,756 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:06:39,757 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:06:39,757 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:39,757 INFO ]: Start difference. First operand 66 states and 143 transitions. Second operand 4 states. [2018-06-22 11:06:40,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:40,951 INFO ]: Finished difference Result 70 states and 167 transitions. [2018-06-22 11:06:40,951 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:06:40,951 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:06:40,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:40,956 INFO ]: With dead ends: 70 [2018-06-22 11:06:40,956 INFO ]: Without dead ends: 70 [2018-06-22 11:06:40,957 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:40,957 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:06:40,977 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-06-22 11:06:40,977 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:06:40,980 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 165 transitions. [2018-06-22 11:06:40,980 INFO ]: Start accepts. Automaton has 68 states and 165 transitions. Word has length 9 [2018-06-22 11:06:40,980 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:40,980 INFO ]: Abstraction has 68 states and 165 transitions. [2018-06-22 11:06:40,980 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:06:40,980 INFO ]: Start isEmpty. Operand 68 states and 165 transitions. [2018-06-22 11:06:40,985 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:06:40,985 INFO ]: Found error trace [2018-06-22 11:06:40,985 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:40,986 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:40,986 INFO ]: Analyzing trace with hash -215706114, now seen corresponding path program 1 times [2018-06-22 11:06:40,986 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:40,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:40,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:40,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:40,987 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:40,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:41,033 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:06:41,033 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:06:41,033 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:06:41,034 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:06:41,034 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:06:41,034 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:41,034 INFO ]: Start difference. First operand 68 states and 165 transitions. Second operand 4 states. [2018-06-22 11:06:41,679 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:41,679 INFO ]: Finished difference Result 74 states and 211 transitions. [2018-06-22 11:06:41,679 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:06:41,680 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:06:41,680 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:41,684 INFO ]: With dead ends: 74 [2018-06-22 11:06:41,684 INFO ]: Without dead ends: 74 [2018-06-22 11:06:41,684 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:41,684 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:06:41,704 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 68. [2018-06-22 11:06:41,704 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:06:41,707 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 165 transitions. [2018-06-22 11:06:41,707 INFO ]: Start accepts. Automaton has 68 states and 165 transitions. Word has length 13 [2018-06-22 11:06:41,707 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:41,707 INFO ]: Abstraction has 68 states and 165 transitions. [2018-06-22 11:06:41,707 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:06:41,707 INFO ]: Start isEmpty. Operand 68 states and 165 transitions. [2018-06-22 11:06:41,712 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:06:41,712 INFO ]: Found error trace [2018-06-22 11:06:41,712 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:41,712 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:41,713 INFO ]: Analyzing trace with hash -139839477, now seen corresponding path program 1 times [2018-06-22 11:06:41,713 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:41,713 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:41,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:41,714 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:41,714 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:41,723 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:41,763 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:06:41,763 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:06:41,763 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:06:41,763 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:06:41,763 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:06:41,763 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:41,764 INFO ]: Start difference. First operand 68 states and 165 transitions. Second operand 4 states. [2018-06-22 11:06:42,304 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:42,304 INFO ]: Finished difference Result 74 states and 211 transitions. [2018-06-22 11:06:42,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:06:42,305 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:06:42,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:42,308 INFO ]: With dead ends: 74 [2018-06-22 11:06:42,308 INFO ]: Without dead ends: 74 [2018-06-22 11:06:42,309 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:42,309 INFO ]: Start minimizeSevpa. Operand 74 states. [2018-06-22 11:06:42,329 INFO ]: Finished minimizeSevpa. Reduced states from 74 to 68. [2018-06-22 11:06:42,329 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:06:42,332 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 165 transitions. [2018-06-22 11:06:42,332 INFO ]: Start accepts. Automaton has 68 states and 165 transitions. Word has length 13 [2018-06-22 11:06:42,332 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:42,332 INFO ]: Abstraction has 68 states and 165 transitions. [2018-06-22 11:06:42,332 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:06:42,332 INFO ]: Start isEmpty. Operand 68 states and 165 transitions. [2018-06-22 11:06:42,339 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:06:42,340 INFO ]: Found error trace [2018-06-22 11:06:42,340 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:42,340 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:42,340 INFO ]: Analyzing trace with hash -1971246613, now seen corresponding path program 1 times [2018-06-22 11:06:42,340 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:42,340 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:42,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:42,341 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:42,341 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:42,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:42,495 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:06:42,495 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:06:42,495 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:06:42,513 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:42,557 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:42,565 INFO ]: Computing forward predicates... [2018-06-22 11:06:42,894 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:06:42,930 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:06:42,930 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:06:42,930 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:06:42,930 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:06:42,930 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:06:42,931 INFO ]: Start difference. First operand 68 states and 165 transitions. Second operand 10 states. [2018-06-22 11:06:43,346 WARN ]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:06:46,659 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:46,659 INFO ]: Finished difference Result 168 states and 1066 transitions. [2018-06-22 11:06:46,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:06:46,660 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:06:46,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:46,673 INFO ]: With dead ends: 168 [2018-06-22 11:06:46,673 INFO ]: Without dead ends: 168 [2018-06-22 11:06:46,674 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:06:46,674 INFO ]: Start minimizeSevpa. Operand 168 states. [2018-06-22 11:06:46,837 INFO ]: Finished minimizeSevpa. Reduced states from 168 to 164. [2018-06-22 11:06:46,839 INFO ]: Start removeUnreachable. Operand 164 states. [2018-06-22 11:06:46,846 INFO ]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1020 transitions. [2018-06-22 11:06:46,846 INFO ]: Start accepts. Automaton has 164 states and 1020 transitions. Word has length 13 [2018-06-22 11:06:46,847 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:46,847 INFO ]: Abstraction has 164 states and 1020 transitions. [2018-06-22 11:06:46,847 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:06:46,847 INFO ]: Start isEmpty. Operand 164 states and 1020 transitions. [2018-06-22 11:06:46,857 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:06:46,857 INFO ]: Found error trace [2018-06-22 11:06:46,857 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:46,858 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:46,858 INFO ]: Analyzing trace with hash 92920990, now seen corresponding path program 1 times [2018-06-22 11:06:46,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:46,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:46,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:46,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:46,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:46,879 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:47,014 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:06:47,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:06:47,014 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:06:47,024 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:47,053 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:47,055 INFO ]: Computing forward predicates... [2018-06-22 11:06:47,145 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:06:47,166 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:06:47,166 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-06-22 11:06:47,167 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:06:47,167 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:06:47,167 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:06:47,167 INFO ]: Start difference. First operand 164 states and 1020 transitions. Second operand 10 states. [2018-06-22 11:06:48,073 WARN ]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:06:50,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:50,160 INFO ]: Finished difference Result 271 states and 2746 transitions. [2018-06-22 11:06:50,163 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:06:50,163 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:06:50,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:50,192 INFO ]: With dead ends: 271 [2018-06-22 11:06:50,193 INFO ]: Without dead ends: 271 [2018-06-22 11:06:50,193 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:06:50,193 INFO ]: Start minimizeSevpa. Operand 271 states. [2018-06-22 11:06:50,403 INFO ]: Finished minimizeSevpa. Reduced states from 271 to 225. [2018-06-22 11:06:50,403 INFO ]: Start removeUnreachable. Operand 225 states. [2018-06-22 11:06:50,414 INFO ]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1949 transitions. [2018-06-22 11:06:50,414 INFO ]: Start accepts. Automaton has 225 states and 1949 transitions. Word has length 17 [2018-06-22 11:06:50,414 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:50,414 INFO ]: Abstraction has 225 states and 1949 transitions. [2018-06-22 11:06:50,414 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:06:50,414 INFO ]: Start isEmpty. Operand 225 states and 1949 transitions. [2018-06-22 11:06:50,429 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:06:50,429 INFO ]: Found error trace [2018-06-22 11:06:50,429 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:50,429 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:50,429 INFO ]: Analyzing trace with hash 1144298631, now seen corresponding path program 1 times [2018-06-22 11:06:50,429 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:50,429 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:50,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:50,431 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:50,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:50,440 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:50,507 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:06:50,507 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:06:50,508 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:06:50,508 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:06:50,508 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:06:50,508 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:50,508 INFO ]: Start difference. First operand 225 states and 1949 transitions. Second operand 4 states. [2018-06-22 11:06:50,710 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:50,711 INFO ]: Finished difference Result 237 states and 1920 transitions. [2018-06-22 11:06:50,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:06:50,717 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:06:50,717 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:50,729 INFO ]: With dead ends: 237 [2018-06-22 11:06:50,729 INFO ]: Without dead ends: 237 [2018-06-22 11:06:50,730 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:50,730 INFO ]: Start minimizeSevpa. Operand 237 states. [2018-06-22 11:06:50,823 INFO ]: Finished minimizeSevpa. Reduced states from 237 to 233. [2018-06-22 11:06:50,823 INFO ]: Start removeUnreachable. Operand 233 states. [2018-06-22 11:06:50,831 INFO ]: Finished removeUnreachable. Reduced from 233 states to 233 states and 1898 transitions. [2018-06-22 11:06:50,831 INFO ]: Start accepts. Automaton has 233 states and 1898 transitions. Word has length 17 [2018-06-22 11:06:50,831 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:50,831 INFO ]: Abstraction has 233 states and 1898 transitions. [2018-06-22 11:06:50,831 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:06:50,831 INFO ]: Start isEmpty. Operand 233 states and 1898 transitions. [2018-06-22 11:06:50,845 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:06:50,845 INFO ]: Found error trace [2018-06-22 11:06:50,845 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:50,845 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:50,845 INFO ]: Analyzing trace with hash 1570341113, now seen corresponding path program 1 times [2018-06-22 11:06:50,845 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:50,845 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:50,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:50,846 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:50,846 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:50,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:50,992 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:06:50,992 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:06:50,992 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:06:50,992 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:06:50,992 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:06:50,992 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:50,993 INFO ]: Start difference. First operand 233 states and 1898 transitions. Second operand 4 states. [2018-06-22 11:06:52,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:52,436 INFO ]: Finished difference Result 241 states and 2030 transitions. [2018-06-22 11:06:52,437 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:06:52,437 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:06:52,437 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:52,450 INFO ]: With dead ends: 241 [2018-06-22 11:06:52,450 INFO ]: Without dead ends: 241 [2018-06-22 11:06:52,450 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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-22 11:06:52,450 INFO ]: Start minimizeSevpa. Operand 241 states. [2018-06-22 11:06:52,553 INFO ]: Finished minimizeSevpa. Reduced states from 241 to 235. [2018-06-22 11:06:52,553 INFO ]: Start removeUnreachable. Operand 235 states. [2018-06-22 11:06:52,561 INFO ]: Finished removeUnreachable. Reduced from 235 states to 235 states and 1930 transitions. [2018-06-22 11:06:52,561 INFO ]: Start accepts. Automaton has 235 states and 1930 transitions. Word has length 21 [2018-06-22 11:06:52,561 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:52,561 INFO ]: Abstraction has 235 states and 1930 transitions. [2018-06-22 11:06:52,561 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:06:52,561 INFO ]: Start isEmpty. Operand 235 states and 1930 transitions. [2018-06-22 11:06:52,575 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:06:52,575 INFO ]: Found error trace [2018-06-22 11:06:52,575 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:52,575 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:52,576 INFO ]: Analyzing trace with hash 1463735238, now seen corresponding path program 1 times [2018-06-22 11:06:52,576 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:52,576 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:52,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:52,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:52,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:52,600 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:52,742 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:06:52,742 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:06:52,742 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:06:52,742 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:06:52,742 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:06:52,742 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:52,742 INFO ]: Start difference. First operand 235 states and 1930 transitions. Second operand 4 states. [2018-06-22 11:06:53,342 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:53,342 INFO ]: Finished difference Result 241 states and 2024 transitions. [2018-06-22 11:06:53,342 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:06:53,342 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:06:53,342 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:53,354 INFO ]: With dead ends: 241 [2018-06-22 11:06:53,354 INFO ]: Without dead ends: 241 [2018-06-22 11:06:53,354 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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-22 11:06:53,355 INFO ]: Start minimizeSevpa. Operand 241 states. [2018-06-22 11:06:53,511 INFO ]: Finished minimizeSevpa. Reduced states from 241 to 233. [2018-06-22 11:06:53,511 INFO ]: Start removeUnreachable. Operand 233 states. [2018-06-22 11:06:53,518 INFO ]: Finished removeUnreachable. Reduced from 233 states to 233 states and 1885 transitions. [2018-06-22 11:06:53,518 INFO ]: Start accepts. Automaton has 233 states and 1885 transitions. Word has length 21 [2018-06-22 11:06:53,519 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:53,519 INFO ]: Abstraction has 233 states and 1885 transitions. [2018-06-22 11:06:53,519 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:06:53,519 INFO ]: Start isEmpty. Operand 233 states and 1885 transitions. [2018-06-22 11:06:53,533 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:06:53,533 INFO ]: Found error trace [2018-06-22 11:06:53,533 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:53,533 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:53,534 INFO ]: Analyzing trace with hash 1771405003, now seen corresponding path program 1 times [2018-06-22 11:06:53,534 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:53,534 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:53,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:53,535 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:53,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:53,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:53,692 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:06:53,692 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:06:53,693 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:06:53,693 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:06:53,693 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:06:53,693 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:53,693 INFO ]: Start difference. First operand 233 states and 1885 transitions. Second operand 4 states. [2018-06-22 11:06:54,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:54,082 INFO ]: Finished difference Result 221 states and 1477 transitions. [2018-06-22 11:06:54,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:06:54,082 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:06:54,082 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:54,089 INFO ]: With dead ends: 221 [2018-06-22 11:06:54,089 INFO ]: Without dead ends: 182 [2018-06-22 11:06:54,089 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:54,089 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 11:06:54,142 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-06-22 11:06:54,142 INFO ]: Start removeUnreachable. Operand 182 states. [2018-06-22 11:06:54,147 INFO ]: Finished removeUnreachable. Reduced from 182 states to 182 states and 1140 transitions. [2018-06-22 11:06:54,147 INFO ]: Start accepts. Automaton has 182 states and 1140 transitions. Word has length 17 [2018-06-22 11:06:54,147 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:54,147 INFO ]: Abstraction has 182 states and 1140 transitions. [2018-06-22 11:06:54,147 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:06:54,147 INFO ]: Start isEmpty. Operand 182 states and 1140 transitions. [2018-06-22 11:06:54,159 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:06:54,159 INFO ]: Found error trace [2018-06-22 11:06:54,159 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:54,159 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:54,159 INFO ]: Analyzing trace with hash 1609850213, now seen corresponding path program 1 times [2018-06-22 11:06:54,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:54,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:54,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:54,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:54,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:54,173 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:54,261 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:06:54,261 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:06:54,261 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:06:54,280 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:54,302 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:54,304 INFO ]: Computing forward predicates... [2018-06-22 11:06:54,344 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:06:54,364 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:06:54,364 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:06:54,364 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:06:54,365 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:06:54,365 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:06:54,365 INFO ]: Start difference. First operand 182 states and 1140 transitions. Second operand 9 states. [2018-06-22 11:06:54,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:54,692 INFO ]: Finished difference Result 208 states and 1397 transitions. [2018-06-22 11:06:54,693 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:06:54,693 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:06:54,694 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:54,700 INFO ]: With dead ends: 208 [2018-06-22 11:06:54,700 INFO ]: Without dead ends: 208 [2018-06-22 11:06:54,701 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:06:54,701 INFO ]: Start minimizeSevpa. Operand 208 states. [2018-06-22 11:06:54,761 INFO ]: Finished minimizeSevpa. Reduced states from 208 to 202. [2018-06-22 11:06:54,784 INFO ]: Start removeUnreachable. Operand 202 states. [2018-06-22 11:06:54,790 INFO ]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1355 transitions. [2018-06-22 11:06:54,790 INFO ]: Start accepts. Automaton has 202 states and 1355 transitions. Word has length 17 [2018-06-22 11:06:54,790 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:54,790 INFO ]: Abstraction has 202 states and 1355 transitions. [2018-06-22 11:06:54,790 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:06:54,790 INFO ]: Start isEmpty. Operand 202 states and 1355 transitions. [2018-06-22 11:06:54,799 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:06:54,799 INFO ]: Found error trace [2018-06-22 11:06:54,799 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:54,799 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:54,799 INFO ]: Analyzing trace with hash 38268729, now seen corresponding path program 1 times [2018-06-22 11:06:54,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:54,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:54,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:54,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:54,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:54,805 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:54,982 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:06:54,982 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:06:54,982 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:06:54,989 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:54,999 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:55,001 INFO ]: Computing forward predicates... [2018-06-22 11:06:55,161 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:06:55,182 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:06:55,183 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:06:55,183 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:06:55,183 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:06:55,183 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:06:55,183 INFO ]: Start difference. First operand 202 states and 1355 transitions. Second operand 9 states. [2018-06-22 11:06:55,942 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:55,942 INFO ]: Finished difference Result 275 states and 2214 transitions. [2018-06-22 11:06:55,947 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:06:55,947 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:06:55,947 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:55,958 INFO ]: With dead ends: 275 [2018-06-22 11:06:55,958 INFO ]: Without dead ends: 275 [2018-06-22 11:06:55,959 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:06:55,959 INFO ]: Start minimizeSevpa. Operand 275 states. [2018-06-22 11:06:56,044 INFO ]: Finished minimizeSevpa. Reduced states from 275 to 239. [2018-06-22 11:06:56,044 INFO ]: Start removeUnreachable. Operand 239 states. [2018-06-22 11:06:56,054 INFO ]: Finished removeUnreachable. Reduced from 239 states to 239 states and 1773 transitions. [2018-06-22 11:06:56,054 INFO ]: Start accepts. Automaton has 239 states and 1773 transitions. Word has length 17 [2018-06-22 11:06:56,054 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:56,054 INFO ]: Abstraction has 239 states and 1773 transitions. [2018-06-22 11:06:56,054 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:06:56,054 INFO ]: Start isEmpty. Operand 239 states and 1773 transitions. [2018-06-22 11:06:56,063 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:06:56,064 INFO ]: Found error trace [2018-06-22 11:06:56,064 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:56,064 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:56,064 INFO ]: Analyzing trace with hash 586822389, now seen corresponding path program 1 times [2018-06-22 11:06:56,064 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:56,064 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:56,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:56,065 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:56,065 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:56,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:56,238 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:06:56,238 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:06:56,238 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:06:56,238 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:06:56,238 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:06:56,238 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:56,238 INFO ]: Start difference. First operand 239 states and 1773 transitions. Second operand 4 states. [2018-06-22 11:06:56,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:56,586 INFO ]: Finished difference Result 235 states and 1537 transitions. [2018-06-22 11:06:56,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:06:56,587 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:06:56,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:56,594 INFO ]: With dead ends: 235 [2018-06-22 11:06:56,594 INFO ]: Without dead ends: 235 [2018-06-22 11:06:56,594 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:06:56,594 INFO ]: Start minimizeSevpa. Operand 235 states. [2018-06-22 11:06:56,656 INFO ]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-06-22 11:06:56,656 INFO ]: Start removeUnreachable. Operand 231 states. [2018-06-22 11:06:56,661 INFO ]: Finished removeUnreachable. Reduced from 231 states to 231 states and 1512 transitions. [2018-06-22 11:06:56,662 INFO ]: Start accepts. Automaton has 231 states and 1512 transitions. Word has length 17 [2018-06-22 11:06:56,662 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:56,662 INFO ]: Abstraction has 231 states and 1512 transitions. [2018-06-22 11:06:56,662 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:06:56,662 INFO ]: Start isEmpty. Operand 231 states and 1512 transitions. [2018-06-22 11:06:56,670 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:06:56,670 INFO ]: Found error trace [2018-06-22 11:06:56,670 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:56,670 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:56,670 INFO ]: Analyzing trace with hash -1245349456, now seen corresponding path program 1 times [2018-06-22 11:06:56,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:56,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:56,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:56,671 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:56,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:56,676 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:57,013 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:06:57,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:06:57,014 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) [2018-06-22 11:06:57,027 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:06:57,054 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:57,056 INFO ]: Computing forward predicates... [2018-06-22 11:06:57,341 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:06:57,362 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:06:57,362 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:06:57,362 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:06:57,362 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:06:57,362 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:06:57,362 INFO ]: Start difference. First operand 231 states and 1512 transitions. Second operand 10 states. [2018-06-22 11:06:59,199 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:06:59,199 INFO ]: Finished difference Result 363 states and 3042 transitions. [2018-06-22 11:06:59,200 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:06:59,200 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:06:59,200 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:06:59,211 INFO ]: With dead ends: 363 [2018-06-22 11:06:59,211 INFO ]: Without dead ends: 363 [2018-06-22 11:06:59,212 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:06:59,212 INFO ]: Start minimizeSevpa. Operand 363 states. [2018-06-22 11:06:59,341 INFO ]: Finished minimizeSevpa. Reduced states from 363 to 296. [2018-06-22 11:06:59,341 INFO ]: Start removeUnreachable. Operand 296 states. [2018-06-22 11:06:59,348 INFO ]: Finished removeUnreachable. Reduced from 296 states to 296 states and 1964 transitions. [2018-06-22 11:06:59,348 INFO ]: Start accepts. Automaton has 296 states and 1964 transitions. Word has length 17 [2018-06-22 11:06:59,348 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:06:59,348 INFO ]: Abstraction has 296 states and 1964 transitions. [2018-06-22 11:06:59,348 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:06:59,348 INFO ]: Start isEmpty. Operand 296 states and 1964 transitions. [2018-06-22 11:06:59,355 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:06:59,355 INFO ]: Found error trace [2018-06-22 11:06:59,355 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:06:59,355 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:06:59,355 INFO ]: Analyzing trace with hash 852352057, now seen corresponding path program 2 times [2018-06-22 11:06:59,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:06:59,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:06:59,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:59,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:06:59,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:06:59,364 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:59,571 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:06:59,571 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:06:59,571 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-22 11:06:59,576 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:06:59,599 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:06:59,599 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:06:59,601 INFO ]: Computing forward predicates... [2018-06-22 11:06:59,631 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:06:59,650 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:06:59,650 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-06-22 11:06:59,651 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:06:59,651 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:06:59,651 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:06:59,651 INFO ]: Start difference. First operand 296 states and 1964 transitions. Second operand 9 states. [2018-06-22 11:07:00,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:00,500 INFO ]: Finished difference Result 372 states and 2942 transitions. [2018-06-22 11:07:00,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:07:00,500 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:07:00,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:00,514 INFO ]: With dead ends: 372 [2018-06-22 11:07:00,514 INFO ]: Without dead ends: 372 [2018-06-22 11:07:00,514 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:07:00,514 INFO ]: Start minimizeSevpa. Operand 372 states. [2018-06-22 11:07:00,631 INFO ]: Finished minimizeSevpa. Reduced states from 372 to 340. [2018-06-22 11:07:00,631 INFO ]: Start removeUnreachable. Operand 340 states. [2018-06-22 11:07:00,639 INFO ]: Finished removeUnreachable. Reduced from 340 states to 340 states and 2587 transitions. [2018-06-22 11:07:00,640 INFO ]: Start accepts. Automaton has 340 states and 2587 transitions. Word has length 21 [2018-06-22 11:07:00,640 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:00,640 INFO ]: Abstraction has 340 states and 2587 transitions. [2018-06-22 11:07:00,640 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:07:00,640 INFO ]: Start isEmpty. Operand 340 states and 2587 transitions. [2018-06-22 11:07:00,648 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:07:00,648 INFO ]: Found error trace [2018-06-22 11:07:00,648 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:00,648 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:00,648 INFO ]: Analyzing trace with hash -1207230138, now seen corresponding path program 2 times [2018-06-22 11:07:00,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:00,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:00,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:00,651 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:07:00,651 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:00,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:00,826 INFO ]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:00,826 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:00,826 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) [2018-06-22 11:07:00,845 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:07:00,864 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:07:00,864 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:00,866 INFO ]: Computing forward predicates... [2018-06-22 11:07:00,933 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:07:00,955 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:07:00,955 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-06-22 11:07:00,955 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:07:00,955 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:07:00,955 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:07:00,955 INFO ]: Start difference. First operand 340 states and 2587 transitions. Second operand 9 states. [2018-06-22 11:07:01,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:01,630 INFO ]: Finished difference Result 425 states and 3865 transitions. [2018-06-22 11:07:01,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:07:01,630 INFO ]: Start accepts. Automaton has 9 states. Word has length 21 [2018-06-22 11:07:01,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:01,649 INFO ]: With dead ends: 425 [2018-06-22 11:07:01,649 INFO ]: Without dead ends: 425 [2018-06-22 11:07:01,649 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:07:01,649 INFO ]: Start minimizeSevpa. Operand 425 states. [2018-06-22 11:07:01,823 INFO ]: Finished minimizeSevpa. Reduced states from 425 to 388. [2018-06-22 11:07:01,823 INFO ]: Start removeUnreachable. Operand 388 states. [2018-06-22 11:07:01,836 INFO ]: Finished removeUnreachable. Reduced from 388 states to 388 states and 3557 transitions. [2018-06-22 11:07:01,836 INFO ]: Start accepts. Automaton has 388 states and 3557 transitions. Word has length 21 [2018-06-22 11:07:01,836 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:01,836 INFO ]: Abstraction has 388 states and 3557 transitions. [2018-06-22 11:07:01,836 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:07:01,836 INFO ]: Start isEmpty. Operand 388 states and 3557 transitions. [2018-06-22 11:07:01,847 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:07:01,847 INFO ]: Found error trace [2018-06-22 11:07:01,847 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:01,847 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:01,848 INFO ]: Analyzing trace with hash -881300573, now seen corresponding path program 1 times [2018-06-22 11:07:01,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:01,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:01,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:01,848 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:07:01,848 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:01,860 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:02,290 INFO ]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:07:02,290 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:02,290 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-22 11:07:02,296 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:02,326 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:02,329 INFO ]: Computing forward predicates... [2018-06-22 11:07:02,517 INFO ]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:07:02,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:02,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-22 11:07:02,537 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:07:02,537 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:07:02,537 INFO ]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:07:02,537 INFO ]: Start difference. First operand 388 states and 3557 transitions. Second operand 12 states. [2018-06-22 11:07:03,468 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:07:04,665 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:07:06,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:06,255 INFO ]: Finished difference Result 716 states and 12618 transitions. [2018-06-22 11:07:06,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:07:06,255 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:07:06,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:06,337 INFO ]: With dead ends: 716 [2018-06-22 11:07:06,337 INFO ]: Without dead ends: 716 [2018-06-22 11:07:06,338 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:07:06,338 INFO ]: Start minimizeSevpa. Operand 716 states. [2018-06-22 11:07:06,829 INFO ]: Finished minimizeSevpa. Reduced states from 716 to 508. [2018-06-22 11:07:06,829 INFO ]: Start removeUnreachable. Operand 508 states. [2018-06-22 11:07:06,858 INFO ]: Finished removeUnreachable. Reduced from 508 states to 508 states and 6621 transitions. [2018-06-22 11:07:06,858 INFO ]: Start accepts. Automaton has 508 states and 6621 transitions. Word has length 21 [2018-06-22 11:07:06,858 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:06,858 INFO ]: Abstraction has 508 states and 6621 transitions. [2018-06-22 11:07:06,858 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:07:06,858 INFO ]: Start isEmpty. Operand 508 states and 6621 transitions. [2018-06-22 11:07:06,872 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:07:06,872 INFO ]: Found error trace [2018-06-22 11:07:06,872 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:06,872 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:06,873 INFO ]: Analyzing trace with hash -1241485186, now seen corresponding path program 1 times [2018-06-22 11:07:06,873 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:06,873 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:06,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:06,874 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:06,874 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:06,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:07,136 INFO ]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:07:07,137 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:07,137 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-22 11:07:07,145 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:07,163 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:07,164 INFO ]: Computing forward predicates... [2018-06-22 11:07:07,240 INFO ]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:07:07,260 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:07,260 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-22 11:07:07,261 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:07:07,261 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:07:07,261 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:07:07,261 INFO ]: Start difference. First operand 508 states and 6621 transitions. Second operand 11 states. [2018-06-22 11:07:10,287 WARN ]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:07:10,870 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:10,870 INFO ]: Finished difference Result 1115 states and 26161 transitions. [2018-06-22 11:07:10,870 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-22 11:07:10,870 INFO ]: Start accepts. Automaton has 11 states. Word has length 25 [2018-06-22 11:07:10,870 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:11,051 INFO ]: With dead ends: 1115 [2018-06-22 11:07:11,051 INFO ]: Without dead ends: 1115 [2018-06-22 11:07:11,052 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-06-22 11:07:11,052 INFO ]: Start minimizeSevpa. Operand 1115 states. [2018-06-22 11:07:11,991 INFO ]: Finished minimizeSevpa. Reduced states from 1115 to 863. [2018-06-22 11:07:11,991 INFO ]: Start removeUnreachable. Operand 863 states. [2018-06-22 11:07:12,046 INFO ]: Finished removeUnreachable. Reduced from 863 states to 863 states and 15087 transitions. [2018-06-22 11:07:12,047 INFO ]: Start accepts. Automaton has 863 states and 15087 transitions. Word has length 25 [2018-06-22 11:07:12,047 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:12,047 INFO ]: Abstraction has 863 states and 15087 transitions. [2018-06-22 11:07:12,047 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:07:12,047 INFO ]: Start isEmpty. Operand 863 states and 15087 transitions. [2018-06-22 11:07:12,058 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:07:12,058 INFO ]: Found error trace [2018-06-22 11:07:12,058 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:12,058 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:12,059 INFO ]: Analyzing trace with hash 416106950, now seen corresponding path program 1 times [2018-06-22 11:07:12,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:12,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:12,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:12,060 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:12,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:12,066 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:12,146 INFO ]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:07:12,146 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:12,146 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-22 11:07:12,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:12,171 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:12,173 INFO ]: Computing forward predicates... [2018-06-22 11:07:12,245 INFO ]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:07:12,264 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:12,264 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-06-22 11:07:12,264 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:07:12,265 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:07:12,265 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:07:12,265 INFO ]: Start difference. First operand 863 states and 15087 transitions. Second operand 13 states. [2018-06-22 11:07:14,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:14,627 INFO ]: Finished difference Result 2063 states and 64334 transitions. [2018-06-22 11:07:14,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-22 11:07:14,627 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-22 11:07:14,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:15,565 INFO ]: With dead ends: 2063 [2018-06-22 11:07:15,565 INFO ]: Without dead ends: 2063 [2018-06-22 11:07:15,565 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:07:15,567 INFO ]: Start minimizeSevpa. Operand 2063 states. [2018-06-22 11:07:17,799 INFO ]: Finished minimizeSevpa. Reduced states from 2063 to 1799. [2018-06-22 11:07:17,799 INFO ]: Start removeUnreachable. Operand 1799 states. [2018-06-22 11:07:18,114 INFO ]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 56399 transitions. [2018-06-22 11:07:18,114 INFO ]: Start accepts. Automaton has 1799 states and 56399 transitions. Word has length 29 [2018-06-22 11:07:18,114 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:18,114 INFO ]: Abstraction has 1799 states and 56399 transitions. [2018-06-22 11:07:18,114 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:07:18,114 INFO ]: Start isEmpty. Operand 1799 states and 56399 transitions. [2018-06-22 11:07:18,142 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:07:18,142 INFO ]: Found error trace [2018-06-22 11:07:18,142 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:18,142 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:18,142 INFO ]: Analyzing trace with hash 838823582, now seen corresponding path program 1 times [2018-06-22 11:07:18,142 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:18,142 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:18,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:18,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:18,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:18,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:18,269 INFO ]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:07:18,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:18,269 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-22 11:07:18,275 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:18,290 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:18,291 INFO ]: Computing forward predicates... [2018-06-22 11:07:18,314 INFO ]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:07:18,334 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:18,334 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-06-22 11:07:18,334 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:07:18,334 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:07:18,334 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:07:18,334 INFO ]: Start difference. First operand 1799 states and 56399 transitions. Second operand 11 states. [2018-06-22 11:07:20,372 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:20,372 INFO ]: Finished difference Result 1532 states and 43421 transitions. [2018-06-22 11:07:20,372 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:07:20,373 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-22 11:07:20,373 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:20,762 INFO ]: With dead ends: 1532 [2018-06-22 11:07:20,762 INFO ]: Without dead ends: 1471 [2018-06-22 11:07:20,762 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:07:20,763 INFO ]: Start minimizeSevpa. Operand 1471 states. [2018-06-22 11:07:21,972 INFO ]: Finished minimizeSevpa. Reduced states from 1471 to 1376. [2018-06-22 11:07:21,973 INFO ]: Start removeUnreachable. Operand 1376 states. [2018-06-22 11:07:22,132 INFO ]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 39449 transitions. [2018-06-22 11:07:22,133 INFO ]: Start accepts. Automaton has 1376 states and 39449 transitions. Word has length 29 [2018-06-22 11:07:22,133 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:22,133 INFO ]: Abstraction has 1376 states and 39449 transitions. [2018-06-22 11:07:22,133 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:07:22,133 INFO ]: Start isEmpty. Operand 1376 states and 39449 transitions. [2018-06-22 11:07:22,157 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:07:22,157 INFO ]: Found error trace [2018-06-22 11:07:22,157 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:22,157 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:22,159 INFO ]: Analyzing trace with hash -2029274097, now seen corresponding path program 1 times [2018-06-22 11:07:22,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:22,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:22,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:22,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:22,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:22,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:22,208 INFO ]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:07:22,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:22,208 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-22 11:07:22,214 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:22,233 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:22,235 INFO ]: Computing forward predicates... [2018-06-22 11:07:22,319 INFO ]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:07:22,340 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:07:22,340 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-06-22 11:07:22,340 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:07:22,340 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:07:22,340 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:07:22,340 INFO ]: Start difference. First operand 1376 states and 39449 transitions. Second operand 8 states. [2018-06-22 11:07:22,752 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:22,752 INFO ]: Finished difference Result 1438 states and 42119 transitions. [2018-06-22 11:07:22,753 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:07:22,753 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:07:22,753 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:23,355 INFO ]: With dead ends: 1438 [2018-06-22 11:07:23,355 INFO ]: Without dead ends: 1438 [2018-06-22 11:07:23,356 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:07:23,356 INFO ]: Start minimizeSevpa. Operand 1438 states. [2018-06-22 11:07:24,789 INFO ]: Finished minimizeSevpa. Reduced states from 1438 to 1396. [2018-06-22 11:07:24,789 INFO ]: Start removeUnreachable. Operand 1396 states. [2018-06-22 11:07:24,920 INFO ]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 40838 transitions. [2018-06-22 11:07:24,920 INFO ]: Start accepts. Automaton has 1396 states and 40838 transitions. Word has length 25 [2018-06-22 11:07:24,920 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:24,920 INFO ]: Abstraction has 1396 states and 40838 transitions. [2018-06-22 11:07:24,920 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:07:24,920 INFO ]: Start isEmpty. Operand 1396 states and 40838 transitions. [2018-06-22 11:07:24,953 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:07:24,953 INFO ]: Found error trace [2018-06-22 11:07:24,953 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:24,954 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:24,954 INFO ]: Analyzing trace with hash -429734469, now seen corresponding path program 1 times [2018-06-22 11:07:24,954 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:24,954 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:24,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:24,954 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:24,954 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:24,959 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:25,313 INFO ]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:07:25,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:25,313 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) [2018-06-22 11:07:25,323 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:07:25,351 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:25,353 INFO ]: Computing forward predicates... [2018-06-22 11:07:25,505 INFO ]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:07:25,525 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:07:25,525 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-06-22 11:07:25,525 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:07:25,525 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:07:25,525 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:07:25,525 INFO ]: Start difference. First operand 1396 states and 40838 transitions. Second operand 8 states. [2018-06-22 11:07:25,957 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:25,958 INFO ]: Finished difference Result 1456 states and 42763 transitions. [2018-06-22 11:07:25,959 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:07:25,959 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:07:25,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:26,433 INFO ]: With dead ends: 1456 [2018-06-22 11:07:26,433 INFO ]: Without dead ends: 1456 [2018-06-22 11:07:26,434 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:07:26,434 INFO ]: Start minimizeSevpa. Operand 1456 states. [2018-06-22 11:07:27,866 INFO ]: Finished minimizeSevpa. Reduced states from 1456 to 1402. [2018-06-22 11:07:27,866 INFO ]: Start removeUnreachable. Operand 1402 states. [2018-06-22 11:07:28,053 INFO ]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 41371 transitions. [2018-06-22 11:07:28,053 INFO ]: Start accepts. Automaton has 1402 states and 41371 transitions. Word has length 25 [2018-06-22 11:07:28,053 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:28,053 INFO ]: Abstraction has 1402 states and 41371 transitions. [2018-06-22 11:07:28,053 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:07:28,053 INFO ]: Start isEmpty. Operand 1402 states and 41371 transitions. [2018-06-22 11:07:28,079 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:07:28,079 INFO ]: Found error trace [2018-06-22 11:07:28,079 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:28,079 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:28,079 INFO ]: Analyzing trace with hash 448412587, now seen corresponding path program 1 times [2018-06-22 11:07:28,079 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:28,079 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:28,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:28,080 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:28,080 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:28,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:28,269 INFO ]: Checked inductivity of 30 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 11:07:28,269 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:07:28,269 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) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:07:28,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:28,295 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:07:28,298 INFO ]: Computing forward predicates... [2018-06-22 11:07:28,494 INFO ]: Checked inductivity of 30 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:07:28,513 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:07:28,513 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-22 11:07:28,513 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:07:28,513 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:07:28,513 INFO ]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:07:28,513 INFO ]: Start difference. First operand 1402 states and 41371 transitions. Second operand 13 states. [2018-06-22 11:07:29,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:07:29,758 INFO ]: Finished difference Result 2012 states and 89260 transitions. [2018-06-22 11:07:29,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:07:29,758 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:07:29,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:07:30,890 INFO ]: With dead ends: 2012 [2018-06-22 11:07:30,890 INFO ]: Without dead ends: 2012 [2018-06-22 11:07:30,890 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:07:30,891 INFO ]: Start minimizeSevpa. Operand 2012 states. [2018-06-22 11:07:33,443 INFO ]: Finished minimizeSevpa. Reduced states from 2012 to 1554. [2018-06-22 11:07:33,443 INFO ]: Start removeUnreachable. Operand 1554 states. [2018-06-22 11:07:33,644 INFO ]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 55082 transitions. [2018-06-22 11:07:33,644 INFO ]: Start accepts. Automaton has 1554 states and 55082 transitions. Word has length 25 [2018-06-22 11:07:33,644 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:07:33,644 INFO ]: Abstraction has 1554 states and 55082 transitions. [2018-06-22 11:07:33,644 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:07:33,644 INFO ]: Start isEmpty. Operand 1554 states and 55082 transitions. [2018-06-22 11:07:33,673 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:07:33,673 INFO ]: Found error trace [2018-06-22 11:07:33,673 INFO ]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:07:33,673 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:07:33,674 INFO ]: Analyzing trace with hash -1218633150, now seen corresponding path program 1 times [2018-06-22 11:07:33,674 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:07:33,674 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:07:33,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:33,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:07:33,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:07:33,681 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 11:07:33,786 WARN ]: Verification canceled [2018-06-22 11:07:33,789 WARN ]: Timeout [2018-06-22 11:07:33,789 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:07:33 BoogieIcfgContainer [2018-06-22 11:07:33,789 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:07:33,789 INFO ]: Toolchain (without parser) took 55814.40 ms. Allocated memory was 306.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 252.6 MB in the beginning and 431.3 MB in the end (delta: -178.7 MB). Peak memory consumption was 1.0 GB. Max. memory is 3.6 GB. [2018-06-22 11:07:33,790 INFO ]: SmtParser took 0.65 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:07:33,790 INFO ]: ChcToBoogie took 73.25 ms. Allocated memory is still 306.2 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:07:33,791 INFO ]: Boogie Preprocessor took 70.74 ms. Allocated memory is still 306.2 MB. Free memory was 250.6 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:07:33,791 INFO ]: RCFGBuilder took 989.66 ms. Allocated memory is still 306.2 MB. Free memory was 248.6 MB in the beginning and 218.6 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:07:33,792 INFO ]: TraceAbstraction took 54668.41 ms. Allocated memory was 306.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 218.6 MB in the beginning and 431.3 MB in the end (delta: -212.8 MB). Peak memory consumption was 987.3 MB. Max. memory is 3.6 GB. [2018-06-22 11:07:33,794 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.65 ms. Allocated memory is still 306.2 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 73.25 ms. Allocated memory is still 306.2 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 70.74 ms. Allocated memory is still 306.2 MB. Free memory was 250.6 MB in the beginning and 248.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 989.66 ms. Allocated memory is still 306.2 MB. Free memory was 248.6 MB in the beginning and 218.6 MB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 54668.41 ms. Allocated memory was 306.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 218.6 MB in the beginning and 431.3 MB in the end (delta: -212.8 MB). Peak memory consumption was 987.3 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 42 with TraceHistMax 4, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 7 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 91 locations, 1 error locations. TIMEOUT Result, 54.5s OverallTime, 24 OverallIterations, 5 TraceHistogramMax, 34.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3011 SDtfs, 217 SDslu, 9752 SDs, 0 SdLazy, 14570 SolverSat, 3384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 321 SyntacticMatches, 13 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1799occurred in iteration=19, 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: 13.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 1637 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 700 ConstructedInterpolants, 0 QuantifiedInterpolants, 39388 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1733 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 37 InterpolantComputations, 13 PerfectInterpolantSequences, 277/381 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/001b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-07-33-804.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/001b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-07-33-804.csv Completed graceful shutdown