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/llreve-bench/smt2/arrays/libc__strncmp_1.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:45:30,548 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:45:30,551 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:45:30,565 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:45:30,565 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:45:30,566 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:45:30,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:45:30,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:45:30,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:45:30,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:45:30,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:45:30,577 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:45:30,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:45:30,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:45:30,583 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:45:30,584 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:45:30,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:45:30,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:45:30,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:45:30,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:45:30,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:45:30,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:45:30,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:45:30,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:45:30,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:45:30,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:45:30,606 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:45:30,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:45:30,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:45:30,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:45:30,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:45:30,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:45:30,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:45:30,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:45:30,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:45:30,611 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:45:30,630 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:45:30,630 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:45:30,630 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:45:30,631 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:45:30,632 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:45:30,632 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:45:30,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:45:30,632 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:45:30,632 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:45:30,633 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:45:30,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:45:30,633 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:45:30,633 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:45:30,633 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:45:30,634 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:45:30,634 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:45:30,634 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:45:30,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:45:30,634 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:45:30,636 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:45:30,636 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:45:30,686 INFO ]: Repository-Root is: /tmp [2018-06-22 11:45:30,704 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:45:30,709 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:45:30,711 INFO ]: Initializing SmtParser... [2018-06-22 11:45:30,712 INFO ]: SmtParser initialized [2018-06-22 11:45:30,712 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_1.array.smt2 [2018-06-22 11:45:30,714 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:45:30,803 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_1.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@47200563 [2018-06-22 11:45:31,226 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_1.array.smt2 [2018-06-22 11:45:31,231 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:45:31,237 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:45:31,237 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:45:31,237 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:45:31,237 INFO ]: ChcToBoogie initialized [2018-06-22 11:45:31,241 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:45:31" (1/1) ... [2018-06-22 11:45:31,297 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31 Unit [2018-06-22 11:45:31,297 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:45:31,298 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:45:31,298 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:45:31,298 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:45:31,320 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31" (1/1) ... [2018-06-22 11:45:31,320 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31" (1/1) ... [2018-06-22 11:45:31,332 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31" (1/1) ... [2018-06-22 11:45:31,332 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31" (1/1) ... [2018-06-22 11:45:31,351 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31" (1/1) ... [2018-06-22 11:45:31,354 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31" (1/1) ... [2018-06-22 11:45:31,356 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31" (1/1) ... [2018-06-22 11:45:31,360 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:45:31,361 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:45:31,361 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:45:31,361 INFO ]: RCFGBuilder initialized [2018-06-22 11:45:31,361 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31" (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:45:31,381 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:45:31,381 INFO ]: Found specification of procedure False [2018-06-22 11:45:31,381 INFO ]: Found implementation of procedure False [2018-06-22 11:45:31,381 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:45:31,381 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:45:31,381 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:45:31,381 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:45:31,381 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:45:31,381 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:45:31,955 INFO ]: Using library mode [2018-06-22 11:45:31,955 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:45:31 BoogieIcfgContainer [2018-06-22 11:45:31,955 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:45:31,957 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:45:31,957 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:45:31,960 INFO ]: TraceAbstraction initialized [2018-06-22 11:45:31,960 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:45:31" (1/3) ... [2018-06-22 11:45:31,961 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be2796b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:45:31, skipping insertion in model container [2018-06-22 11:45:31,961 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:45:31" (2/3) ... [2018-06-22 11:45:31,961 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be2796b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:45:31, skipping insertion in model container [2018-06-22 11:45:31,961 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:45:31" (3/3) ... [2018-06-22 11:45:31,963 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:45:31,973 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:45:31,979 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:45:32,021 INFO ]: Using default assertion order modulation [2018-06-22 11:45:32,022 INFO ]: Interprodecural is true [2018-06-22 11:45:32,022 INFO ]: Hoare is false [2018-06-22 11:45:32,022 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:45:32,022 INFO ]: Backedges is TWOTRACK [2018-06-22 11:45:32,022 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:45:32,022 INFO ]: Difference is false [2018-06-22 11:45:32,022 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:45:32,022 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:45:32,034 INFO ]: Start isEmpty. Operand 23 states. [2018-06-22 11:45:32,048 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:45:32,049 INFO ]: Found error trace [2018-06-22 11:45:32,050 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:45:32,050 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:32,056 INFO ]: Analyzing trace with hash 146142247, now seen corresponding path program 1 times [2018-06-22 11:45:32,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:32,058 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:32,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:32,093 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:32,093 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:32,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:32,132 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:45:32,135 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:32,135 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:45:32,137 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:45:32,153 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:45:32,154 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:45:32,156 INFO ]: Start difference. First operand 23 states. Second operand 2 states. [2018-06-22 11:45:32,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:32,180 INFO ]: Finished difference Result 21 states and 42 transitions. [2018-06-22 11:45:32,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:45:32,182 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:45:32,182 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:32,192 INFO ]: With dead ends: 21 [2018-06-22 11:45:32,193 INFO ]: Without dead ends: 21 [2018-06-22 11:45:32,195 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:45:32,208 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:45:32,230 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 11:45:32,231 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:45:32,232 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. [2018-06-22 11:45:32,233 INFO ]: Start accepts. Automaton has 21 states and 42 transitions. Word has length 5 [2018-06-22 11:45:32,234 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:32,234 INFO ]: Abstraction has 21 states and 42 transitions. [2018-06-22 11:45:32,234 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:45:32,234 INFO ]: Start isEmpty. Operand 21 states and 42 transitions. [2018-06-22 11:45:32,236 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:32,236 INFO ]: Found error trace [2018-06-22 11:45:32,236 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:32,237 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:32,237 INFO ]: Analyzing trace with hash -2014662725, now seen corresponding path program 1 times [2018-06-22 11:45:32,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:32,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:32,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:32,237 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:32,237 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:32,308 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:32,517 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:45:32,517 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:32,517 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:32,518 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:32,518 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:32,518 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:32,518 INFO ]: Start difference. First operand 21 states and 42 transitions. Second operand 4 states. [2018-06-22 11:45:33,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:33,075 INFO ]: Finished difference Result 25 states and 55 transitions. [2018-06-22 11:45:33,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:33,080 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:33,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:33,082 INFO ]: With dead ends: 25 [2018-06-22 11:45:33,082 INFO ]: Without dead ends: 25 [2018-06-22 11:45:33,082 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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:45:33,083 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:45:33,094 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:45:33,095 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:45:33,096 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 53 transitions. [2018-06-22 11:45:33,096 INFO ]: Start accepts. Automaton has 23 states and 53 transitions. Word has length 9 [2018-06-22 11:45:33,096 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:33,096 INFO ]: Abstraction has 23 states and 53 transitions. [2018-06-22 11:45:33,096 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:33,096 INFO ]: Start isEmpty. Operand 23 states and 53 transitions. [2018-06-22 11:45:33,098 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:33,098 INFO ]: Found error trace [2018-06-22 11:45:33,098 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:33,099 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:33,099 INFO ]: Analyzing trace with hash -51096390, now seen corresponding path program 1 times [2018-06-22 11:45:33,099 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:33,099 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:33,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:33,100 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:33,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:33,115 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:33,330 WARN ]: Spent 178.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-06-22 11:45:33,348 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:45:33,352 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:33,353 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:33,353 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:33,353 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:33,353 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:33,353 INFO ]: Start difference. First operand 23 states and 53 transitions. Second operand 4 states. [2018-06-22 11:45:33,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:33,639 INFO ]: Finished difference Result 25 states and 53 transitions. [2018-06-22 11:45:33,639 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:33,640 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:33,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:33,641 INFO ]: With dead ends: 25 [2018-06-22 11:45:33,641 INFO ]: Without dead ends: 25 [2018-06-22 11:45:33,641 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:33,641 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:45:33,649 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:45:33,649 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:45:33,650 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 51 transitions. [2018-06-22 11:45:33,650 INFO ]: Start accepts. Automaton has 23 states and 51 transitions. Word has length 9 [2018-06-22 11:45:33,650 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:33,650 INFO ]: Abstraction has 23 states and 51 transitions. [2018-06-22 11:45:33,650 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:33,650 INFO ]: Start isEmpty. Operand 23 states and 51 transitions. [2018-06-22 11:45:33,652 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:33,652 INFO ]: Found error trace [2018-06-22 11:45:33,652 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:33,652 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:33,652 INFO ]: Analyzing trace with hash 1287106087, now seen corresponding path program 1 times [2018-06-22 11:45:33,652 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:33,652 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:33,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:33,653 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:33,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:33,684 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:33,762 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:45:33,762 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:33,762 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:33,762 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:33,762 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:33,762 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:33,762 INFO ]: Start difference. First operand 23 states and 51 transitions. Second operand 4 states. [2018-06-22 11:45:34,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:34,307 INFO ]: Finished difference Result 25 states and 52 transitions. [2018-06-22 11:45:34,310 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:34,310 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:34,310 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:34,311 INFO ]: With dead ends: 25 [2018-06-22 11:45:34,311 INFO ]: Without dead ends: 25 [2018-06-22 11:45:34,311 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:45:34,311 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:45:34,322 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:45:34,322 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:45:34,323 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 50 transitions. [2018-06-22 11:45:34,323 INFO ]: Start accepts. Automaton has 23 states and 50 transitions. Word has length 9 [2018-06-22 11:45:34,323 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:34,323 INFO ]: Abstraction has 23 states and 50 transitions. [2018-06-22 11:45:34,323 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:34,323 INFO ]: Start isEmpty. Operand 23 states and 50 transitions. [2018-06-22 11:45:34,324 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:34,324 INFO ]: Found error trace [2018-06-22 11:45:34,324 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:34,324 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:34,324 INFO ]: Analyzing trace with hash -115478698, now seen corresponding path program 1 times [2018-06-22 11:45:34,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:34,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:34,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,329 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:34,329 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:34,433 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:45:34,433 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:34,433 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:34,433 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:34,433 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:34,433 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:34,434 INFO ]: Start difference. First operand 23 states and 50 transitions. Second operand 4 states. [2018-06-22 11:45:34,532 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:34,532 INFO ]: Finished difference Result 25 states and 51 transitions. [2018-06-22 11:45:34,533 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:34,533 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:34,533 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:34,534 INFO ]: With dead ends: 25 [2018-06-22 11:45:34,534 INFO ]: Without dead ends: 25 [2018-06-22 11:45:34,535 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:45:34,535 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:45:34,540 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:45:34,540 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:45:34,541 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2018-06-22 11:45:34,541 INFO ]: Start accepts. Automaton has 23 states and 49 transitions. Word has length 9 [2018-06-22 11:45:34,541 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:34,541 INFO ]: Abstraction has 23 states and 49 transitions. [2018-06-22 11:45:34,541 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:34,541 INFO ]: Start isEmpty. Operand 23 states and 49 transitions. [2018-06-22 11:45:34,542 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:34,542 INFO ]: Found error trace [2018-06-22 11:45:34,542 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:34,542 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:34,543 INFO ]: Analyzing trace with hash 1848087637, now seen corresponding path program 1 times [2018-06-22 11:45:34,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:34,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:34,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,544 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:34,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,551 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:34,635 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:45:34,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:34,635 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:34,635 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:34,635 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:34,635 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:34,635 INFO ]: Start difference. First operand 23 states and 49 transitions. Second operand 4 states. [2018-06-22 11:45:34,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:34,681 INFO ]: Finished difference Result 25 states and 50 transitions. [2018-06-22 11:45:34,682 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:34,682 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:34,682 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:34,683 INFO ]: With dead ends: 25 [2018-06-22 11:45:34,683 INFO ]: Without dead ends: 25 [2018-06-22 11:45:34,683 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:45:34,683 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:45:34,687 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:45:34,688 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:45:34,689 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2018-06-22 11:45:34,689 INFO ]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 9 [2018-06-22 11:45:34,689 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:34,689 INFO ]: Abstraction has 23 states and 48 transitions. [2018-06-22 11:45:34,689 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:34,689 INFO ]: Start isEmpty. Operand 23 states and 48 transitions. [2018-06-22 11:45:34,690 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:34,690 INFO ]: Found error trace [2018-06-22 11:45:34,690 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:34,690 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:34,690 INFO ]: Analyzing trace with hash 1783705329, now seen corresponding path program 1 times [2018-06-22 11:45:34,690 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:34,690 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:34,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,691 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:34,691 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,698 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:34,732 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:45:34,732 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:34,732 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:34,732 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:34,733 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:34,733 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:34,733 INFO ]: Start difference. First operand 23 states and 48 transitions. Second operand 4 states. [2018-06-22 11:45:34,793 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:34,793 INFO ]: Finished difference Result 25 states and 49 transitions. [2018-06-22 11:45:34,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:34,795 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:34,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:34,796 INFO ]: With dead ends: 25 [2018-06-22 11:45:34,796 INFO ]: Without dead ends: 25 [2018-06-22 11:45:34,796 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:45:34,796 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:45:34,800 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-06-22 11:45:34,800 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:45:34,801 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 47 transitions. [2018-06-22 11:45:34,801 INFO ]: Start accepts. Automaton has 23 states and 47 transitions. Word has length 9 [2018-06-22 11:45:34,801 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:34,801 INFO ]: Abstraction has 23 states and 47 transitions. [2018-06-22 11:45:34,801 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:34,801 INFO ]: Start isEmpty. Operand 23 states and 47 transitions. [2018-06-22 11:45:34,802 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:45:34,802 INFO ]: Found error trace [2018-06-22 11:45:34,802 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:34,802 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:34,802 INFO ]: Analyzing trace with hash -395838563, now seen corresponding path program 1 times [2018-06-22 11:45:34,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:34,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:34,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:34,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:34,810 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:34,852 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:45:34,853 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:34,853 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:34,853 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:34,853 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:34,853 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:34,854 INFO ]: Start difference. First operand 23 states and 47 transitions. Second operand 4 states. [2018-06-22 11:45:35,063 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:35,064 INFO ]: Finished difference Result 27 states and 60 transitions. [2018-06-22 11:45:35,064 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:45:35,064 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:45:35,064 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:35,064 INFO ]: With dead ends: 27 [2018-06-22 11:45:35,064 INFO ]: Without dead ends: 27 [2018-06-22 11:45:35,065 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:45:35,065 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:45:35,070 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:45:35,070 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:35,071 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 58 transitions. [2018-06-22 11:45:35,071 INFO ]: Start accepts. Automaton has 25 states and 58 transitions. Word has length 9 [2018-06-22 11:45:35,071 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:35,071 INFO ]: Abstraction has 25 states and 58 transitions. [2018-06-22 11:45:35,071 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:35,071 INFO ]: Start isEmpty. Operand 25 states and 58 transitions. [2018-06-22 11:45:35,073 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:35,073 INFO ]: Found error trace [2018-06-22 11:45:35,073 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:35,073 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:35,073 INFO ]: Analyzing trace with hash -1256109372, now seen corresponding path program 1 times [2018-06-22 11:45:35,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:35,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:35,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:35,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:35,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:35,099 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:35,296 WARN ]: Spent 129.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-06-22 11:45:35,332 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:35,332 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:35,332 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:45:35,332 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:45:35,332 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:45:35,332 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:35,332 INFO ]: Start difference. First operand 25 states and 58 transitions. Second operand 5 states. [2018-06-22 11:45:35,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:35,453 INFO ]: Finished difference Result 31 states and 84 transitions. [2018-06-22 11:45:35,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:35,453 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:45:35,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:35,454 INFO ]: With dead ends: 31 [2018-06-22 11:45:35,454 INFO ]: Without dead ends: 31 [2018-06-22 11:45:35,455 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:35,455 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:35,463 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:45:35,463 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:35,464 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 69 transitions. [2018-06-22 11:45:35,464 INFO ]: Start accepts. Automaton has 27 states and 69 transitions. Word has length 13 [2018-06-22 11:45:35,464 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:35,464 INFO ]: Abstraction has 27 states and 69 transitions. [2018-06-22 11:45:35,464 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:45:35,464 INFO ]: Start isEmpty. Operand 27 states and 69 transitions. [2018-06-22 11:45:35,465 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:35,465 INFO ]: Found error trace [2018-06-22 11:45:35,465 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:35,465 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:35,466 INFO ]: Analyzing trace with hash 1436966138, now seen corresponding path program 1 times [2018-06-22 11:45:35,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:35,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:35,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:35,466 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:35,466 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:35,476 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:35,695 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:35,695 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:35,695 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:45:35,695 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:45:35,695 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:45:35,695 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:35,696 INFO ]: Start difference. First operand 27 states and 69 transitions. Second operand 5 states. [2018-06-22 11:45:35,836 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:35,836 INFO ]: Finished difference Result 31 states and 83 transitions. [2018-06-22 11:45:35,836 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:35,837 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:45:35,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:35,837 INFO ]: With dead ends: 31 [2018-06-22 11:45:35,837 INFO ]: Without dead ends: 31 [2018-06-22 11:45:35,838 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:35,838 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:35,844 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:45:35,844 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:35,845 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2018-06-22 11:45:35,845 INFO ]: Start accepts. Automaton has 27 states and 68 transitions. Word has length 13 [2018-06-22 11:45:35,845 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:35,845 INFO ]: Abstraction has 27 states and 68 transitions. [2018-06-22 11:45:35,845 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:45:35,845 INFO ]: Start isEmpty. Operand 27 states and 68 transitions. [2018-06-22 11:45:35,846 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:35,846 INFO ]: Found error trace [2018-06-22 11:45:35,846 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:35,846 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:35,847 INFO ]: Analyzing trace with hash 1692320169, now seen corresponding path program 1 times [2018-06-22 11:45:35,847 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:35,847 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:35,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:35,847 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:35,847 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:35,857 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:35,932 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:35,932 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:35,932 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:45:35,932 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:45:35,932 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:45:35,932 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:35,933 INFO ]: Start difference. First operand 27 states and 68 transitions. Second operand 5 states. [2018-06-22 11:45:36,049 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:36,049 INFO ]: Finished difference Result 31 states and 81 transitions. [2018-06-22 11:45:36,049 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:36,049 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:45:36,049 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:36,050 INFO ]: With dead ends: 31 [2018-06-22 11:45:36,050 INFO ]: Without dead ends: 31 [2018-06-22 11:45:36,050 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:36,051 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:36,057 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:45:36,057 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:36,057 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 66 transitions. [2018-06-22 11:45:36,057 INFO ]: Start accepts. Automaton has 27 states and 66 transitions. Word has length 13 [2018-06-22 11:45:36,058 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:36,058 INFO ]: Abstraction has 27 states and 66 transitions. [2018-06-22 11:45:36,058 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:45:36,058 INFO ]: Start isEmpty. Operand 27 states and 66 transitions. [2018-06-22 11:45:36,058 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:36,059 INFO ]: Found error trace [2018-06-22 11:45:36,059 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:36,059 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:36,059 INFO ]: Analyzing trace with hash 90428383, now seen corresponding path program 1 times [2018-06-22 11:45:36,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:36,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:36,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:36,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,075 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:36,181 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:36,181 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:36,181 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:45:36,181 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:45:36,181 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:45:36,181 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:36,181 INFO ]: Start difference. First operand 27 states and 66 transitions. Second operand 5 states. [2018-06-22 11:45:36,261 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:36,261 INFO ]: Finished difference Result 31 states and 80 transitions. [2018-06-22 11:45:36,261 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:36,261 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:45:36,261 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:36,262 INFO ]: With dead ends: 31 [2018-06-22 11:45:36,262 INFO ]: Without dead ends: 31 [2018-06-22 11:45:36,262 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:36,262 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:36,268 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:45:36,268 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:36,269 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 65 transitions. [2018-06-22 11:45:36,269 INFO ]: Start accepts. Automaton has 27 states and 65 transitions. Word has length 13 [2018-06-22 11:45:36,269 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:36,269 INFO ]: Abstraction has 27 states and 65 transitions. [2018-06-22 11:45:36,269 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:45:36,269 INFO ]: Start isEmpty. Operand 27 states and 65 transitions. [2018-06-22 11:45:36,270 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:36,270 INFO ]: Found error trace [2018-06-22 11:45:36,270 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:36,270 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:36,270 INFO ]: Analyzing trace with hash -734155682, now seen corresponding path program 1 times [2018-06-22 11:45:36,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:36,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:36,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:36,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,282 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:36,436 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:36,437 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:36,437 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:45:36,437 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:45:36,437 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:45:36,437 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:36,437 INFO ]: Start difference. First operand 27 states and 65 transitions. Second operand 5 states. [2018-06-22 11:45:36,718 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:36,718 INFO ]: Finished difference Result 31 states and 79 transitions. [2018-06-22 11:45:36,718 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:36,718 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:45:36,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:36,719 INFO ]: With dead ends: 31 [2018-06-22 11:45:36,719 INFO ]: Without dead ends: 31 [2018-06-22 11:45:36,720 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:36,720 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:36,724 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-06-22 11:45:36,724 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:45:36,725 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 64 transitions. [2018-06-22 11:45:36,725 INFO ]: Start accepts. Automaton has 27 states and 64 transitions. Word has length 13 [2018-06-22 11:45:36,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:36,725 INFO ]: Abstraction has 27 states and 64 transitions. [2018-06-22 11:45:36,725 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:45:36,725 INFO ]: Start isEmpty. Operand 27 states and 64 transitions. [2018-06-22 11:45:36,726 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:36,726 INFO ]: Found error trace [2018-06-22 11:45:36,726 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:36,726 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:36,726 INFO ]: Analyzing trace with hash 1542764454, now seen corresponding path program 1 times [2018-06-22 11:45:36,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:36,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:36,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:36,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,737 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:36,802 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:45:36,802 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:36,802 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:45:36,803 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:36,803 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:36,803 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:36,803 INFO ]: Start difference. First operand 27 states and 64 transitions. Second operand 6 states. [2018-06-22 11:45:36,941 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:36,942 INFO ]: Finished difference Result 29 states and 64 transitions. [2018-06-22 11:45:36,942 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:36,942 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:36,942 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:36,942 INFO ]: With dead ends: 29 [2018-06-22 11:45:36,942 INFO ]: Without dead ends: 28 [2018-06-22 11:45:36,943 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:36,943 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:45:36,947 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-06-22 11:45:36,947 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:45:36,949 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 48 transitions. [2018-06-22 11:45:36,949 INFO ]: Start accepts. Automaton has 24 states and 48 transitions. Word has length 13 [2018-06-22 11:45:36,949 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:36,949 INFO ]: Abstraction has 24 states and 48 transitions. [2018-06-22 11:45:36,949 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:36,949 INFO ]: Start isEmpty. Operand 24 states and 48 transitions. [2018-06-22 11:45:36,950 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:36,950 INFO ]: Found error trace [2018-06-22 11:45:36,950 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:36,950 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:36,950 INFO ]: Analyzing trace with hash -164925648, now seen corresponding path program 1 times [2018-06-22 11:45:36,950 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:36,950 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:36,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,951 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:36,951 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:36,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:37,438 WARN ]: Spent 372.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-06-22 11:45:37,889 WARN ]: Spent 402.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 17 [2018-06-22 11:45:38,086 WARN ]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:45:38,095 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:38,095 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:38,095 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:45:38,095 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:45:38,095 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:45:38,095 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:38,095 INFO ]: Start difference. First operand 24 states and 48 transitions. Second operand 5 states. [2018-06-22 11:45:38,191 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:38,191 INFO ]: Finished difference Result 28 states and 61 transitions. [2018-06-22 11:45:38,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:38,191 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:45:38,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:38,192 INFO ]: With dead ends: 28 [2018-06-22 11:45:38,192 INFO ]: Without dead ends: 28 [2018-06-22 11:45:38,192 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:38,192 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:45:38,197 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 22. [2018-06-22 11:45:38,197 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:45:38,198 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 43 transitions. [2018-06-22 11:45:38,198 INFO ]: Start accepts. Automaton has 22 states and 43 transitions. Word has length 13 [2018-06-22 11:45:38,198 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:38,198 INFO ]: Abstraction has 22 states and 43 transitions. [2018-06-22 11:45:38,198 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:45:38,198 INFO ]: Start isEmpty. Operand 22 states and 43 transitions. [2018-06-22 11:45:38,199 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:38,199 INFO ]: Found error trace [2018-06-22 11:45:38,199 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:38,199 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:38,199 INFO ]: Analyzing trace with hash 1969023006, now seen corresponding path program 1 times [2018-06-22 11:45:38,199 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:38,199 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:38,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:38,200 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:38,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:38,208 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:38,266 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:45:38,266 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:38,266 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:45:38,269 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:38,269 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:38,269 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:38,269 INFO ]: Start difference. First operand 22 states and 43 transitions. Second operand 6 states. [2018-06-22 11:45:38,322 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:38,322 INFO ]: Finished difference Result 24 states and 44 transitions. [2018-06-22 11:45:38,323 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:38,323 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:38,323 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:38,323 INFO ]: With dead ends: 24 [2018-06-22 11:45:38,323 INFO ]: Without dead ends: 23 [2018-06-22 11:45:38,323 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:38,323 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:45:38,326 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 11:45:38,326 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:45:38,326 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 40 transitions. [2018-06-22 11:45:38,326 INFO ]: Start accepts. Automaton has 21 states and 40 transitions. Word has length 13 [2018-06-22 11:45:38,326 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:38,326 INFO ]: Abstraction has 21 states and 40 transitions. [2018-06-22 11:45:38,326 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:38,326 INFO ]: Start isEmpty. Operand 21 states and 40 transitions. [2018-06-22 11:45:38,327 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:38,327 INFO ]: Found error trace [2018-06-22 11:45:38,327 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:38,327 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:38,327 INFO ]: Analyzing trace with hash -1501360225, now seen corresponding path program 1 times [2018-06-22 11:45:38,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:38,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:38,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:38,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:38,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:38,338 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:38,458 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:45:38,459 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:38,480 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:45:38,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:38,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:38,534 INFO ]: Computing forward predicates... [2018-06-22 11:45:38,603 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:45:38,623 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:38,623 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:38,623 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:38,623 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:38,623 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:38,624 INFO ]: Start difference. First operand 21 states and 40 transitions. Second operand 6 states. [2018-06-22 11:45:38,757 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:38,757 INFO ]: Finished difference Result 29 states and 67 transitions. [2018-06-22 11:45:38,757 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:38,757 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:38,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:38,758 INFO ]: With dead ends: 29 [2018-06-22 11:45:38,758 INFO ]: Without dead ends: 29 [2018-06-22 11:45:38,758 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:38,758 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:45:38,761 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:45:38,761 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:38,762 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2018-06-22 11:45:38,762 INFO ]: Start accepts. Automaton has 25 states and 54 transitions. Word has length 13 [2018-06-22 11:45:38,762 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:38,762 INFO ]: Abstraction has 25 states and 54 transitions. [2018-06-22 11:45:38,762 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:38,762 INFO ]: Start isEmpty. Operand 25 states and 54 transitions. [2018-06-22 11:45:38,763 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:38,763 INFO ]: Found error trace [2018-06-22 11:45:38,763 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:38,763 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:38,763 INFO ]: Analyzing trace with hash -1756714256, now seen corresponding path program 1 times [2018-06-22 11:45:38,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:38,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:38,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:38,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:38,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:38,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:38,907 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:45:38,907 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:38,907 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:45:38,916 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:38,937 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:38,939 INFO ]: Computing forward predicates... [2018-06-22 11:45:39,100 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:45:39,119 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:39,119 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:45:39,119 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:39,119 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:39,119 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:39,120 INFO ]: Start difference. First operand 25 states and 54 transitions. Second operand 10 states. [2018-06-22 11:45:40,273 WARN ]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-22 11:45:42,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:42,750 INFO ]: Finished difference Result 29 states and 66 transitions. [2018-06-22 11:45:42,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:42,750 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:45:42,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:42,751 INFO ]: With dead ends: 29 [2018-06-22 11:45:42,751 INFO ]: Without dead ends: 29 [2018-06-22 11:45:42,751 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2018-06-22 11:45:42,751 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:45:42,755 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:45:42,755 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:42,755 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 53 transitions. [2018-06-22 11:45:42,755 INFO ]: Start accepts. Automaton has 25 states and 53 transitions. Word has length 13 [2018-06-22 11:45:42,755 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:42,755 INFO ]: Abstraction has 25 states and 53 transitions. [2018-06-22 11:45:42,755 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:42,755 INFO ]: Start isEmpty. Operand 25 states and 53 transitions. [2018-06-22 11:45:42,756 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:42,756 INFO ]: Found error trace [2018-06-22 11:45:42,756 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:42,756 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:42,756 INFO ]: Analyzing trace with hash -410176501, now seen corresponding path program 1 times [2018-06-22 11:45:42,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:42,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:42,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:42,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:42,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:42,767 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:43,175 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:45:43,175 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:43,175 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:45:43,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:43,198 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:43,200 INFO ]: Computing forward predicates... [2018-06-22 11:45:43,227 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:45:43,246 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:43,246 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:43,246 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:43,246 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:43,246 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:43,246 INFO ]: Start difference. First operand 25 states and 53 transitions. Second operand 6 states. [2018-06-22 11:45:43,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:43,407 INFO ]: Finished difference Result 29 states and 65 transitions. [2018-06-22 11:45:43,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:43,407 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:43,407 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:43,408 INFO ]: With dead ends: 29 [2018-06-22 11:45:43,408 INFO ]: Without dead ends: 29 [2018-06-22 11:45:43,408 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:43,408 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:45:43,412 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:45:43,412 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:43,412 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2018-06-22 11:45:43,412 INFO ]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2018-06-22 11:45:43,412 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:43,412 INFO ]: Abstraction has 25 states and 52 transitions. [2018-06-22 11:45:43,412 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:43,413 INFO ]: Start isEmpty. Operand 25 states and 52 transitions. [2018-06-22 11:45:43,417 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:43,417 INFO ]: Found error trace [2018-06-22 11:45:43,417 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:43,417 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:43,417 INFO ]: Analyzing trace with hash -154822470, now seen corresponding path program 1 times [2018-06-22 11:45:43,417 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:43,417 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:43,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:43,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:43,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:43,425 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:43,565 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:45:43,565 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:43,565 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:45:43,572 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:43,595 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:43,597 INFO ]: Computing forward predicates... [2018-06-22 11:45:43,733 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:45:43,764 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:43,764 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:45:43,764 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:45:43,764 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:45:43,764 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:43,764 INFO ]: Start difference. First operand 25 states and 52 transitions. Second operand 10 states. [2018-06-22 11:45:44,947 WARN ]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-22 11:45:47,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:47,522 INFO ]: Finished difference Result 31 states and 66 transitions. [2018-06-22 11:45:47,523 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:45:47,523 INFO ]: Start accepts. Automaton has 10 states. Word has length 13 [2018-06-22 11:45:47,523 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:47,523 INFO ]: With dead ends: 31 [2018-06-22 11:45:47,523 INFO ]: Without dead ends: 31 [2018-06-22 11:45:47,524 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2018-06-22 11:45:47,524 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:45:47,527 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-06-22 11:45:47,527 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:45:47,527 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 51 transitions. [2018-06-22 11:45:47,527 INFO ]: Start accepts. Automaton has 25 states and 51 transitions. Word has length 13 [2018-06-22 11:45:47,527 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:47,527 INFO ]: Abstraction has 25 states and 51 transitions. [2018-06-22 11:45:47,527 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:45:47,527 INFO ]: Start isEmpty. Operand 25 states and 51 transitions. [2018-06-22 11:45:47,528 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:47,528 INFO ]: Found error trace [2018-06-22 11:45:47,528 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:47,528 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:47,528 INFO ]: Analyzing trace with hash -979406535, now seen corresponding path program 1 times [2018-06-22 11:45:47,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:47,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:47,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,531 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:47,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:47,536 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:47,739 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:45:47,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:47,739 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:47,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:47,764 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:47,765 INFO ]: Computing forward predicates... [2018-06-22 11:45:47,798 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:45:47,817 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:47,817 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:47,817 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:47,817 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:47,817 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:47,817 INFO ]: Start difference. First operand 25 states and 51 transitions. Second operand 6 states. [2018-06-22 11:45:48,418 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:48,418 INFO ]: Finished difference Result 41 states and 89 transitions. [2018-06-22 11:45:48,418 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:48,418 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:48,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:48,419 INFO ]: With dead ends: 41 [2018-06-22 11:45:48,419 INFO ]: Without dead ends: 41 [2018-06-22 11:45:48,419 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:48,419 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-22 11:45:48,423 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-06-22 11:45:48,423 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:45:48,424 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2018-06-22 11:45:48,424 INFO ]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 13 [2018-06-22 11:45:48,424 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:48,424 INFO ]: Abstraction has 33 states and 68 transitions. [2018-06-22 11:45:48,424 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:48,424 INFO ]: Start isEmpty. Operand 33 states and 68 transitions. [2018-06-22 11:45:48,425 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:48,425 INFO ]: Found error trace [2018-06-22 11:45:48,425 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:48,425 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:48,426 INFO ]: Analyzing trace with hash 1191715285, now seen corresponding path program 1 times [2018-06-22 11:45:48,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:48,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:48,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:48,426 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:48,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:48,431 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:48,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:45:48,495 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:48,495 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:45:48,503 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:48,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:48,515 INFO ]: Computing forward predicates... [2018-06-22 11:45:48,530 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:45:48,549 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:48,549 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:48,549 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:48,549 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:48,549 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:48,550 INFO ]: Start difference. First operand 33 states and 68 transitions. Second operand 6 states. [2018-06-22 11:45:48,860 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:48,861 INFO ]: Finished difference Result 39 states and 84 transitions. [2018-06-22 11:45:48,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:48,862 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:48,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:48,862 INFO ]: With dead ends: 39 [2018-06-22 11:45:48,862 INFO ]: Without dead ends: 39 [2018-06-22 11:45:48,863 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:48,863 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:45:48,867 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-06-22 11:45:48,867 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:45:48,867 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 67 transitions. [2018-06-22 11:45:48,867 INFO ]: Start accepts. Automaton has 33 states and 67 transitions. Word has length 13 [2018-06-22 11:45:48,867 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:48,867 INFO ]: Abstraction has 33 states and 67 transitions. [2018-06-22 11:45:48,867 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:48,867 INFO ]: Start isEmpty. Operand 33 states and 67 transitions. [2018-06-22 11:45:48,868 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:48,868 INFO ]: Found error trace [2018-06-22 11:45:48,868 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:48,868 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:48,868 INFO ]: Analyzing trace with hash 1447069316, now seen corresponding path program 1 times [2018-06-22 11:45:48,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:48,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:48,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:48,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:48,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:48,886 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:48,970 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:45:48,970 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:48,970 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:48,984 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:48,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:49,000 INFO ]: Computing forward predicates... [2018-06-22 11:45:49,012 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:45:49,031 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:49,031 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:49,031 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:49,031 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:49,032 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:49,032 INFO ]: Start difference. First operand 33 states and 67 transitions. Second operand 6 states. [2018-06-22 11:45:49,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:49,241 INFO ]: Finished difference Result 39 states and 83 transitions. [2018-06-22 11:45:49,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:49,241 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:49,241 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:49,242 INFO ]: With dead ends: 39 [2018-06-22 11:45:49,242 INFO ]: Without dead ends: 39 [2018-06-22 11:45:49,242 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:49,242 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-22 11:45:49,245 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-06-22 11:45:49,245 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:45:49,246 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 66 transitions. [2018-06-22 11:45:49,246 INFO ]: Start accepts. Automaton has 33 states and 66 transitions. Word has length 13 [2018-06-22 11:45:49,246 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:49,246 INFO ]: Abstraction has 33 states and 66 transitions. [2018-06-22 11:45:49,246 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:49,246 INFO ]: Start isEmpty. Operand 33 states and 66 transitions. [2018-06-22 11:45:49,250 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:49,250 INFO ]: Found error trace [2018-06-22 11:45:49,250 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:49,250 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:49,250 INFO ]: Analyzing trace with hash 335679236, now seen corresponding path program 1 times [2018-06-22 11:45:49,250 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:49,250 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:49,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:49,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:49,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:49,260 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:49,348 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:45:49,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:49,348 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:45:49,354 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:49,377 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:49,379 INFO ]: Computing forward predicates... [2018-06-22 11:45:49,419 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:45:49,437 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:49,437 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:49,437 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:49,438 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:49,438 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:49,438 INFO ]: Start difference. First operand 33 states and 66 transitions. Second operand 6 states. [2018-06-22 11:45:49,586 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:49,586 INFO ]: Finished difference Result 43 states and 97 transitions. [2018-06-22 11:45:49,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:49,587 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:49,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:49,587 INFO ]: With dead ends: 43 [2018-06-22 11:45:49,587 INFO ]: Without dead ends: 43 [2018-06-22 11:45:49,587 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:49,587 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:45:49,591 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-22 11:45:49,592 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:45:49,592 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 80 transitions. [2018-06-22 11:45:49,592 INFO ]: Start accepts. Automaton has 37 states and 80 transitions. Word has length 13 [2018-06-22 11:45:49,592 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:49,592 INFO ]: Abstraction has 37 states and 80 transitions. [2018-06-22 11:45:49,592 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:49,592 INFO ]: Start isEmpty. Operand 37 states and 80 transitions. [2018-06-22 11:45:49,593 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:49,593 INFO ]: Found error trace [2018-06-22 11:45:49,593 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:49,593 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:49,594 INFO ]: Analyzing trace with hash -1010858519, now seen corresponding path program 1 times [2018-06-22 11:45:49,594 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:49,594 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:49,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:49,595 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:49,595 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:49,607 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:49,654 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:45:49,654 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:49,654 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:45:49,660 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:49,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:49,681 INFO ]: Computing forward predicates... [2018-06-22 11:45:49,710 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:45:49,729 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:49,729 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:49,729 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:49,729 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:49,729 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:49,729 INFO ]: Start difference. First operand 37 states and 80 transitions. Second operand 6 states. [2018-06-22 11:45:49,832 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:49,832 INFO ]: Finished difference Result 43 states and 96 transitions. [2018-06-22 11:45:49,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:49,833 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:49,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:49,833 INFO ]: With dead ends: 43 [2018-06-22 11:45:49,833 INFO ]: Without dead ends: 43 [2018-06-22 11:45:49,834 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:49,834 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:45:49,838 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-22 11:45:49,838 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:45:49,838 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 79 transitions. [2018-06-22 11:45:49,838 INFO ]: Start accepts. Automaton has 37 states and 79 transitions. Word has length 13 [2018-06-22 11:45:49,838 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:49,838 INFO ]: Abstraction has 37 states and 79 transitions. [2018-06-22 11:45:49,838 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:49,838 INFO ]: Start isEmpty. Operand 37 states and 79 transitions. [2018-06-22 11:45:49,840 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:49,840 INFO ]: Found error trace [2018-06-22 11:45:49,840 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:49,840 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:49,840 INFO ]: Analyzing trace with hash 80325205, now seen corresponding path program 1 times [2018-06-22 11:45:49,840 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:49,840 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:49,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:49,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:49,841 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:49,851 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,247 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:45:50,247 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:50,247 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:45:50,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,263 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,265 INFO ]: Computing forward predicates... [2018-06-22 11:45:50,284 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:45:50,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:50,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:50,304 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:50,304 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:50,304 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:50,304 INFO ]: Start difference. First operand 37 states and 79 transitions. Second operand 6 states. [2018-06-22 11:45:50,465 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:50,465 INFO ]: Finished difference Result 43 states and 95 transitions. [2018-06-22 11:45:50,465 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:50,465 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:50,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:50,466 INFO ]: With dead ends: 43 [2018-06-22 11:45:50,466 INFO ]: Without dead ends: 43 [2018-06-22 11:45:50,466 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:50,466 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:45:50,470 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-22 11:45:50,470 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:45:50,471 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 78 transitions. [2018-06-22 11:45:50,471 INFO ]: Start accepts. Automaton has 37 states and 78 transitions. Word has length 13 [2018-06-22 11:45:50,471 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:50,471 INFO ]: Abstraction has 37 states and 78 transitions. [2018-06-22 11:45:50,471 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:50,471 INFO ]: Start isEmpty. Operand 37 states and 78 transitions. [2018-06-22 11:45:50,472 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:50,472 INFO ]: Found error trace [2018-06-22 11:45:50,472 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:50,472 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:50,472 INFO ]: Analyzing trace with hash -488904829, now seen corresponding path program 1 times [2018-06-22 11:45:50,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:50,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:50,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,479 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,548 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:45:50,548 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:50,548 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:45:50,554 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,565 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,566 INFO ]: Computing forward predicates... [2018-06-22 11:45:50,586 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:45:50,606 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:50,606 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:50,606 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:50,606 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:50,606 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:50,606 INFO ]: Start difference. First operand 37 states and 78 transitions. Second operand 6 states. [2018-06-22 11:45:50,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:50,695 INFO ]: Finished difference Result 43 states and 94 transitions. [2018-06-22 11:45:50,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:50,695 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:50,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:50,696 INFO ]: With dead ends: 43 [2018-06-22 11:45:50,696 INFO ]: Without dead ends: 43 [2018-06-22 11:45:50,696 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:50,696 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:45:50,699 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-22 11:45:50,699 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:45:50,703 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 77 transitions. [2018-06-22 11:45:50,703 INFO ]: Start accepts. Automaton has 37 states and 77 transitions. Word has length 13 [2018-06-22 11:45:50,703 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:50,703 INFO ]: Abstraction has 37 states and 77 transitions. [2018-06-22 11:45:50,703 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:50,703 INFO ]: Start isEmpty. Operand 37 states and 77 transitions. [2018-06-22 11:45:50,704 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:50,704 INFO ]: Found error trace [2018-06-22 11:45:50,704 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:50,704 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:50,704 INFO ]: Analyzing trace with hash 1682216991, now seen corresponding path program 1 times [2018-06-22 11:45:50,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:50,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:50,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:50,713 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,755 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:45:50,755 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:50,755 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:45:50,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:50,775 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:50,776 INFO ]: Computing forward predicates... [2018-06-22 11:45:50,795 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:45:50,815 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:50,815 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:50,816 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:50,816 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:50,816 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:50,816 INFO ]: Start difference. First operand 37 states and 77 transitions. Second operand 6 states. [2018-06-22 11:45:50,999 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:50,999 INFO ]: Finished difference Result 43 states and 93 transitions. [2018-06-22 11:45:50,999 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:50,999 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:50,999 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:50,999 INFO ]: With dead ends: 43 [2018-06-22 11:45:50,999 INFO ]: Without dead ends: 43 [2018-06-22 11:45:51,000 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:51,000 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:45:51,002 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-22 11:45:51,003 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:45:51,003 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2018-06-22 11:45:51,003 INFO ]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 13 [2018-06-22 11:45:51,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:51,003 INFO ]: Abstraction has 37 states and 76 transitions. [2018-06-22 11:45:51,003 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:51,003 INFO ]: Start isEmpty. Operand 37 states and 76 transitions. [2018-06-22 11:45:51,004 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:51,004 INFO ]: Found error trace [2018-06-22 11:45:51,004 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:51,004 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:51,004 INFO ]: Analyzing trace with hash -1266212550, now seen corresponding path program 1 times [2018-06-22 11:45:51,004 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:51,004 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:51,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:51,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:51,102 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:45:51,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:51,102 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:51,109 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:51,123 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:51,124 INFO ]: Computing forward predicates... [2018-06-22 11:45:51,140 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:45:51,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:51,159 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:45:51,159 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:45:51,160 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:45:51,160 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:45:51,160 INFO ]: Start difference. First operand 37 states and 76 transitions. Second operand 6 states. [2018-06-22 11:45:51,255 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:51,255 INFO ]: Finished difference Result 43 states and 92 transitions. [2018-06-22 11:45:51,255 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:45:51,255 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:45:51,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:51,256 INFO ]: With dead ends: 43 [2018-06-22 11:45:51,256 INFO ]: Without dead ends: 43 [2018-06-22 11:45:51,256 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:51,256 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-22 11:45:51,261 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-22 11:45:51,261 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-22 11:45:51,261 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 75 transitions. [2018-06-22 11:45:51,261 INFO ]: Start accepts. Automaton has 37 states and 75 transitions. Word has length 13 [2018-06-22 11:45:51,261 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:51,261 INFO ]: Abstraction has 37 states and 75 transitions. [2018-06-22 11:45:51,261 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:45:51,261 INFO ]: Start isEmpty. Operand 37 states and 75 transitions. [2018-06-22 11:45:51,262 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:45:51,262 INFO ]: Found error trace [2018-06-22 11:45:51,262 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:51,262 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:51,262 INFO ]: Analyzing trace with hash 1937571022, now seen corresponding path program 1 times [2018-06-22 11:45:51,262 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:51,262 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:51,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,263 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:51,263 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,267 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:51,448 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:45:51,449 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:51,449 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:45:51,463 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:51,477 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:51,478 INFO ]: Computing forward predicates... [2018-06-22 11:45:51,528 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:45:51,547 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:51,547 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:45:51,548 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:51,548 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:51,548 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:51,548 INFO ]: Start difference. First operand 37 states and 75 transitions. Second operand 8 states. [2018-06-22 11:45:51,755 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:51,755 INFO ]: Finished difference Result 79 states and 183 transitions. [2018-06-22 11:45:51,755 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:45:51,755 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:45:51,755 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:51,756 INFO ]: With dead ends: 79 [2018-06-22 11:45:51,756 INFO ]: Without dead ends: 79 [2018-06-22 11:45:51,756 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:45:51,756 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 11:45:51,762 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 53. [2018-06-22 11:45:51,762 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 11:45:51,763 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 113 transitions. [2018-06-22 11:45:51,763 INFO ]: Start accepts. Automaton has 53 states and 113 transitions. Word has length 13 [2018-06-22 11:45:51,763 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:51,763 INFO ]: Abstraction has 53 states and 113 transitions. [2018-06-22 11:45:51,763 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:51,763 INFO ]: Start isEmpty. Operand 53 states and 113 transitions. [2018-06-22 11:45:51,764 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:51,764 INFO ]: Found error trace [2018-06-22 11:45:51,764 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:51,764 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:51,764 INFO ]: Analyzing trace with hash 815970600, now seen corresponding path program 1 times [2018-06-22 11:45:51,764 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:51,764 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:51,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:51,767 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:51,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:51,889 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:45:51,889 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:45:51,889 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:45:51,889 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:45:51,889 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:45:51,889 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:45:51,890 INFO ]: Start difference. First operand 53 states and 113 transitions. Second operand 4 states. [2018-06-22 11:45:52,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:52,004 INFO ]: Finished difference Result 80 states and 172 transitions. [2018-06-22 11:45:52,004 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:45:52,004 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:45:52,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:52,005 INFO ]: With dead ends: 80 [2018-06-22 11:45:52,005 INFO ]: Without dead ends: 78 [2018-06-22 11:45:52,005 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:45:52,005 INFO ]: Start minimizeSevpa. Operand 78 states. [2018-06-22 11:45:52,013 INFO ]: Finished minimizeSevpa. Reduced states from 78 to 56. [2018-06-22 11:45:52,013 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:45:52,014 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 116 transitions. [2018-06-22 11:45:52,015 INFO ]: Start accepts. Automaton has 56 states and 116 transitions. Word has length 17 [2018-06-22 11:45:52,015 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:52,015 INFO ]: Abstraction has 56 states and 116 transitions. [2018-06-22 11:45:52,018 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:45:52,019 INFO ]: Start isEmpty. Operand 56 states and 116 transitions. [2018-06-22 11:45:52,020 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:52,020 INFO ]: Found error trace [2018-06-22 11:45:52,020 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:52,020 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:52,020 INFO ]: Analyzing trace with hash 666692136, now seen corresponding path program 1 times [2018-06-22 11:45:52,020 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:52,020 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:52,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:52,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:52,021 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:52,030 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:52,112 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:45:52,113 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:52,113 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:52,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:52,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:52,134 INFO ]: Computing forward predicates... [2018-06-22 11:45:52,236 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:52,256 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:52,256 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-22 11:45:52,256 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:45:52,256 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:45:52,256 INFO ]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:52,257 INFO ]: Start difference. First operand 56 states and 116 transitions. Second operand 14 states. [2018-06-22 11:45:53,703 WARN ]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 11:45:53,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:53,986 INFO ]: Finished difference Result 196 states and 410 transitions. [2018-06-22 11:45:53,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-22 11:45:53,986 INFO ]: Start accepts. Automaton has 14 states. Word has length 17 [2018-06-22 11:45:53,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:53,988 INFO ]: With dead ends: 196 [2018-06-22 11:45:53,988 INFO ]: Without dead ends: 165 [2018-06-22 11:45:53,988 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:45:53,989 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-22 11:45:54,002 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 77. [2018-06-22 11:45:54,002 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:45:54,005 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 169 transitions. [2018-06-22 11:45:54,005 INFO ]: Start accepts. Automaton has 77 states and 169 transitions. Word has length 17 [2018-06-22 11:45:54,005 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:54,005 INFO ]: Abstraction has 77 states and 169 transitions. [2018-06-22 11:45:54,005 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:45:54,005 INFO ]: Start isEmpty. Operand 77 states and 169 transitions. [2018-06-22 11:45:54,006 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:54,006 INFO ]: Found error trace [2018-06-22 11:45:54,006 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:54,006 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:54,006 INFO ]: Analyzing trace with hash -258292494, now seen corresponding path program 1 times [2018-06-22 11:45:54,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:54,007 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:54,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:54,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:54,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:54,014 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:54,272 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:45:54,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:54,272 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:54,278 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:54,294 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:54,295 INFO ]: Computing forward predicates... [2018-06-22 11:45:54,490 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:45:54,509 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:54,509 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-06-22 11:45:54,509 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:45:54,509 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:45:54,509 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:45:54,509 INFO ]: Start difference. First operand 77 states and 169 transitions. Second operand 13 states. [2018-06-22 11:45:55,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:55,172 INFO ]: Finished difference Result 155 states and 300 transitions. [2018-06-22 11:45:55,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:45:55,172 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:45:55,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:55,173 INFO ]: With dead ends: 155 [2018-06-22 11:45:55,173 INFO ]: Without dead ends: 145 [2018-06-22 11:45:55,174 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:45:55,174 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-22 11:45:55,184 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 75. [2018-06-22 11:45:55,184 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:45:55,185 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 139 transitions. [2018-06-22 11:45:55,185 INFO ]: Start accepts. Automaton has 75 states and 139 transitions. Word has length 17 [2018-06-22 11:45:55,185 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:55,185 INFO ]: Abstraction has 75 states and 139 transitions. [2018-06-22 11:45:55,185 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:45:55,185 INFO ]: Start isEmpty. Operand 75 states and 139 transitions. [2018-06-22 11:45:55,186 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:55,186 INFO ]: Found error trace [2018-06-22 11:45:55,186 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:55,186 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:55,186 INFO ]: Analyzing trace with hash -1853517154, now seen corresponding path program 1 times [2018-06-22 11:45:55,186 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:55,186 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:55,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:55,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:55,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:55,193 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:55,764 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:45:55,764 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:55,764 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:55,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:55,784 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:55,785 INFO ]: Computing forward predicates... [2018-06-22 11:45:55,815 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:45:55,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:55,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:45:55,833 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:45:55,834 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:45:55,834 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:45:55,834 INFO ]: Start difference. First operand 75 states and 139 transitions. Second operand 8 states. [2018-06-22 11:45:56,166 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:56,166 INFO ]: Finished difference Result 123 states and 241 transitions. [2018-06-22 11:45:56,166 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:45:56,166 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:45:56,166 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:56,167 INFO ]: With dead ends: 123 [2018-06-22 11:45:56,167 INFO ]: Without dead ends: 121 [2018-06-22 11:45:56,167 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:45:56,168 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 11:45:56,174 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 77. [2018-06-22 11:45:56,174 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:45:56,176 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 143 transitions. [2018-06-22 11:45:56,176 INFO ]: Start accepts. Automaton has 77 states and 143 transitions. Word has length 17 [2018-06-22 11:45:56,176 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:56,176 INFO ]: Abstraction has 77 states and 143 transitions. [2018-06-22 11:45:56,176 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:45:56,176 INFO ]: Start isEmpty. Operand 77 states and 143 transitions. [2018-06-22 11:45:56,177 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:56,177 INFO ]: Found error trace [2018-06-22 11:45:56,177 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:56,177 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:56,177 INFO ]: Analyzing trace with hash 1516465512, now seen corresponding path program 2 times [2018-06-22 11:45:56,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:56,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:56,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:56,178 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:56,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:56,198 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:56,540 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 11:45:56,781 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:45:57,060 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:45:57,060 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:57,060 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:45:57,072 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:57,116 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:45:57,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:57,118 INFO ]: Computing forward predicates... [2018-06-22 11:45:57,356 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:45:57,375 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:57,375 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:45:57,375 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:45:57,376 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:45:57,376 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:45:57,376 INFO ]: Start difference. First operand 77 states and 143 transitions. Second operand 7 states. [2018-06-22 11:45:57,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:45:57,567 INFO ]: Finished difference Result 143 states and 280 transitions. [2018-06-22 11:45:57,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:45:57,568 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:45:57,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:45:57,569 INFO ]: With dead ends: 143 [2018-06-22 11:45:57,569 INFO ]: Without dead ends: 141 [2018-06-22 11:45:57,569 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:45:57,569 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 11:45:57,576 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 77. [2018-06-22 11:45:57,576 INFO ]: Start removeUnreachable. Operand 77 states. [2018-06-22 11:45:57,577 INFO ]: Finished removeUnreachable. Reduced from 77 states to 77 states and 142 transitions. [2018-06-22 11:45:57,577 INFO ]: Start accepts. Automaton has 77 states and 142 transitions. Word has length 17 [2018-06-22 11:45:57,577 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:45:57,577 INFO ]: Abstraction has 77 states and 142 transitions. [2018-06-22 11:45:57,577 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:45:57,577 INFO ]: Start isEmpty. Operand 77 states and 142 transitions. [2018-06-22 11:45:57,578 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:45:57,578 INFO ]: Found error trace [2018-06-22 11:45:57,578 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:45:57,579 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:45:57,579 INFO ]: Analyzing trace with hash 1978957827, now seen corresponding path program 1 times [2018-06-22 11:45:57,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:45:57,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:45:57,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:57,579 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:45:57,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:45:57,591 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:57,919 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:45:57,919 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:45:57,919 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:45:57,927 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:45:57,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:45:57,943 INFO ]: Computing forward predicates... [2018-06-22 11:45:58,474 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:45:58,495 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:45:58,495 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:45:58,495 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:45:58,495 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:45:58,496 INFO ]: CoverageRelationStatistics Valid=21, Invalid=109, Unknown=2, NotChecked=0, Total=132 [2018-06-22 11:45:58,496 INFO ]: Start difference. First operand 77 states and 142 transitions. Second operand 12 states. [2018-06-22 11:45:59,582 WARN ]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-22 11:46:04,056 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:04,056 INFO ]: Finished difference Result 143 states and 278 transitions. [2018-06-22 11:46:04,087 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:04,087 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:46:04,087 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:04,088 INFO ]: With dead ends: 143 [2018-06-22 11:46:04,088 INFO ]: Without dead ends: 143 [2018-06-22 11:46:04,089 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=54, Invalid=247, Unknown=5, NotChecked=0, Total=306 [2018-06-22 11:46:04,089 INFO ]: Start minimizeSevpa. Operand 143 states. [2018-06-22 11:46:04,100 INFO ]: Finished minimizeSevpa. Reduced states from 143 to 79. [2018-06-22 11:46:04,100 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:46:04,101 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 147 transitions. [2018-06-22 11:46:04,101 INFO ]: Start accepts. Automaton has 79 states and 147 transitions. Word has length 17 [2018-06-22 11:46:04,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:04,101 INFO ]: Abstraction has 79 states and 147 transitions. [2018-06-22 11:46:04,101 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:04,101 INFO ]: Start isEmpty. Operand 79 states and 147 transitions. [2018-06-22 11:46:04,102 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:04,102 INFO ]: Found error trace [2018-06-22 11:46:04,102 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:04,103 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:04,103 INFO ]: Analyzing trace with hash -928532524, now seen corresponding path program 1 times [2018-06-22 11:46:04,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:04,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:04,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:04,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:04,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:04,117 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:04,227 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:46:04,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:04,227 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:04,234 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:04,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:04,251 INFO ]: Computing forward predicates... [2018-06-22 11:46:04,434 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:46:04,453 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:04,453 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:04,453 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:04,453 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:04,453 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:04,454 INFO ]: Start difference. First operand 79 states and 147 transitions. Second operand 7 states. [2018-06-22 11:46:04,671 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:04,671 INFO ]: Finished difference Result 141 states and 275 transitions. [2018-06-22 11:46:04,671 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:04,671 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:04,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:04,673 INFO ]: With dead ends: 141 [2018-06-22 11:46:04,673 INFO ]: Without dead ends: 141 [2018-06-22 11:46:04,673 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:04,673 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 11:46:04,679 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 79. [2018-06-22 11:46:04,679 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:46:04,680 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2018-06-22 11:46:04,680 INFO ]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 17 [2018-06-22 11:46:04,680 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:04,680 INFO ]: Abstraction has 79 states and 146 transitions. [2018-06-22 11:46:04,680 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:04,681 INFO ]: Start isEmpty. Operand 79 states and 146 transitions. [2018-06-22 11:46:04,681 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:04,681 INFO ]: Found error trace [2018-06-22 11:46:04,681 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:04,682 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:04,682 INFO ]: Analyzing trace with hash 207145986, now seen corresponding path program 1 times [2018-06-22 11:46:04,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:04,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:04,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:04,682 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:04,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:04,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:04,772 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:46:04,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:04,772 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:04,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:04,793 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:04,794 INFO ]: Computing forward predicates... [2018-06-22 11:46:04,822 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:46:04,841 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:04,841 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:46:04,841 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:46:04,841 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:46:04,841 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:04,841 INFO ]: Start difference. First operand 79 states and 146 transitions. Second operand 8 states. [2018-06-22 11:46:05,082 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:05,083 INFO ]: Finished difference Result 119 states and 231 transitions. [2018-06-22 11:46:05,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:46:05,083 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:46:05,083 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:05,084 INFO ]: With dead ends: 119 [2018-06-22 11:46:05,084 INFO ]: Without dead ends: 119 [2018-06-22 11:46:05,084 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:46:05,084 INFO ]: Start minimizeSevpa. Operand 119 states. [2018-06-22 11:46:05,089 INFO ]: Finished minimizeSevpa. Reduced states from 119 to 79. [2018-06-22 11:46:05,089 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:46:05,090 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 145 transitions. [2018-06-22 11:46:05,090 INFO ]: Start accepts. Automaton has 79 states and 145 transitions. Word has length 17 [2018-06-22 11:46:05,090 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:05,090 INFO ]: Abstraction has 79 states and 145 transitions. [2018-06-22 11:46:05,090 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:46:05,090 INFO ]: Start isEmpty. Operand 79 states and 145 transitions. [2018-06-22 11:46:05,091 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:05,091 INFO ]: Found error trace [2018-06-22 11:46:05,091 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:05,091 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:05,091 INFO ]: Analyzing trace with hash 1053973197, now seen corresponding path program 1 times [2018-06-22 11:46:05,091 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:05,091 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:05,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:05,092 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:05,092 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:05,106 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:05,432 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-22 11:46:05,663 WARN ]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-22 11:46:05,786 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:46:05,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:05,786 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:05,794 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:05,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:05,809 INFO ]: Computing forward predicates... [2018-06-22 11:46:05,837 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:46:05,856 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:05,856 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:05,856 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:05,856 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:05,856 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:05,856 INFO ]: Start difference. First operand 79 states and 145 transitions. Second operand 7 states. [2018-06-22 11:46:06,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:06,051 INFO ]: Finished difference Result 141 states and 273 transitions. [2018-06-22 11:46:06,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:06,051 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:06,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:06,053 INFO ]: With dead ends: 141 [2018-06-22 11:46:06,053 INFO ]: Without dead ends: 141 [2018-06-22 11:46:06,053 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:06,053 INFO ]: Start minimizeSevpa. Operand 141 states. [2018-06-22 11:46:06,059 INFO ]: Finished minimizeSevpa. Reduced states from 141 to 79. [2018-06-22 11:46:06,059 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-22 11:46:06,060 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 144 transitions. [2018-06-22 11:46:06,060 INFO ]: Start accepts. Automaton has 79 states and 144 transitions. Word has length 17 [2018-06-22 11:46:06,061 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:06,061 INFO ]: Abstraction has 79 states and 144 transitions. [2018-06-22 11:46:06,061 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:06,061 INFO ]: Start isEmpty. Operand 79 states and 144 transitions. [2018-06-22 11:46:06,062 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:06,062 INFO ]: Found error trace [2018-06-22 11:46:06,062 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:06,062 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:06,062 INFO ]: Analyzing trace with hash -1391024839, now seen corresponding path program 1 times [2018-06-22 11:46:06,062 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:06,062 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:06,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:06,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:06,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:06,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:06,646 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:46:06,646 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:06,646 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:06,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:06,667 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:06,668 INFO ]: Computing forward predicates... [2018-06-22 11:46:07,201 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:46:07,224 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:07,224 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:46:07,225 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:07,225 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:07,225 INFO ]: CoverageRelationStatistics Valid=21, Invalid=109, Unknown=2, NotChecked=0, Total=132 [2018-06-22 11:46:07,225 INFO ]: Start difference. First operand 79 states and 144 transitions. Second operand 12 states. [2018-06-22 11:46:08,312 WARN ]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-22 11:46:12,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:12,389 INFO ]: Finished difference Result 141 states and 272 transitions. [2018-06-22 11:46:12,390 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:12,390 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:46:12,390 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:12,390 INFO ]: With dead ends: 141 [2018-06-22 11:46:12,390 INFO ]: Without dead ends: 135 [2018-06-22 11:46:12,391 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=54, Invalid=247, Unknown=5, NotChecked=0, Total=306 [2018-06-22 11:46:12,391 INFO ]: Start minimizeSevpa. Operand 135 states. [2018-06-22 11:46:12,396 INFO ]: Finished minimizeSevpa. Reduced states from 135 to 75. [2018-06-22 11:46:12,396 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:46:12,397 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 138 transitions. [2018-06-22 11:46:12,397 INFO ]: Start accepts. Automaton has 75 states and 138 transitions. Word has length 17 [2018-06-22 11:46:12,397 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:12,397 INFO ]: Abstraction has 75 states and 138 transitions. [2018-06-22 11:46:12,397 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:12,397 INFO ]: Start isEmpty. Operand 75 states and 138 transitions. [2018-06-22 11:46:12,398 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:12,398 INFO ]: Found error trace [2018-06-22 11:46:12,398 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:12,398 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:12,398 INFO ]: Analyzing trace with hash 1904318595, now seen corresponding path program 1 times [2018-06-22 11:46:12,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:12,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:12,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:12,400 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:12,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:12,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:12,509 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:46:12,509 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:12,509 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:12,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:12,528 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:12,529 INFO ]: Computing forward predicates... [2018-06-22 11:46:12,595 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:46:12,614 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:12,614 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 11:46:12,614 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:12,614 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:12,614 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:12,615 INFO ]: Start difference. First operand 75 states and 138 transitions. Second operand 13 states. [2018-06-22 11:46:13,196 WARN ]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 11:46:13,212 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:13,212 INFO ]: Finished difference Result 221 states and 450 transitions. [2018-06-22 11:46:13,213 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:46:13,213 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:46:13,213 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:13,215 INFO ]: With dead ends: 221 [2018-06-22 11:46:13,215 INFO ]: Without dead ends: 211 [2018-06-22 11:46:13,215 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:46:13,215 INFO ]: Start minimizeSevpa. Operand 211 states. [2018-06-22 11:46:13,224 INFO ]: Finished minimizeSevpa. Reduced states from 211 to 85. [2018-06-22 11:46:13,224 INFO ]: Start removeUnreachable. Operand 85 states. [2018-06-22 11:46:13,225 INFO ]: Finished removeUnreachable. Reduced from 85 states to 85 states and 162 transitions. [2018-06-22 11:46:13,225 INFO ]: Start accepts. Automaton has 85 states and 162 transitions. Word has length 17 [2018-06-22 11:46:13,225 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:13,225 INFO ]: Abstraction has 85 states and 162 transitions. [2018-06-22 11:46:13,225 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:13,225 INFO ]: Start isEmpty. Operand 85 states and 162 transitions. [2018-06-22 11:46:13,226 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:13,226 INFO ]: Found error trace [2018-06-22 11:46:13,226 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:13,226 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:13,227 INFO ]: Analyzing trace with hash -1465664071, now seen corresponding path program 1 times [2018-06-22 11:46:13,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:13,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:13,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:13,227 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:13,227 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:13,233 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:13,340 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:46:13,341 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:13,341 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:13,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:13,366 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:13,367 INFO ]: Computing forward predicates... [2018-06-22 11:46:13,517 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:46:13,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:13,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:46:13,536 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:46:13,536 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:46:13,536 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:13,536 INFO ]: Start difference. First operand 85 states and 162 transitions. Second operand 9 states. [2018-06-22 11:46:14,083 WARN ]: Spent 373.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-06-22 11:46:14,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:14,264 INFO ]: Finished difference Result 121 states and 230 transitions. [2018-06-22 11:46:14,265 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:14,265 INFO ]: Start accepts. Automaton has 9 states. Word has length 17 [2018-06-22 11:46:14,265 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:14,266 INFO ]: With dead ends: 121 [2018-06-22 11:46:14,266 INFO ]: Without dead ends: 113 [2018-06-22 11:46:14,266 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:14,266 INFO ]: Start minimizeSevpa. Operand 113 states. [2018-06-22 11:46:14,271 INFO ]: Finished minimizeSevpa. Reduced states from 113 to 75. [2018-06-22 11:46:14,271 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:46:14,271 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 137 transitions. [2018-06-22 11:46:14,271 INFO ]: Start accepts. Automaton has 75 states and 137 transitions. Word has length 17 [2018-06-22 11:46:14,271 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:14,271 INFO ]: Abstraction has 75 states and 137 transitions. [2018-06-22 11:46:14,271 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:46:14,271 INFO ]: Start isEmpty. Operand 75 states and 137 transitions. [2018-06-22 11:46:14,272 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:14,272 INFO ]: Found error trace [2018-06-22 11:46:14,272 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:14,272 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:14,273 INFO ]: Analyzing trace with hash -958787406, now seen corresponding path program 2 times [2018-06-22 11:46:14,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:14,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:14,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:14,273 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:14,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:14,283 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:14,389 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:46:14,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:14,389 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:14,398 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:14,413 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:14,413 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:14,414 INFO ]: Computing forward predicates... [2018-06-22 11:46:14,441 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:46:14,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:14,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:46:14,460 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:46:14,460 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:46:14,461 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:14,461 INFO ]: Start difference. First operand 75 states and 137 transitions. Second operand 8 states. [2018-06-22 11:46:14,681 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:14,681 INFO ]: Finished difference Result 145 states and 284 transitions. [2018-06-22 11:46:14,681 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:14,681 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:46:14,681 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:14,682 INFO ]: With dead ends: 145 [2018-06-22 11:46:14,682 INFO ]: Without dead ends: 139 [2018-06-22 11:46:14,682 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:14,682 INFO ]: Start minimizeSevpa. Operand 139 states. [2018-06-22 11:46:14,691 INFO ]: Finished minimizeSevpa. Reduced states from 139 to 75. [2018-06-22 11:46:14,691 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 11:46:14,692 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 136 transitions. [2018-06-22 11:46:14,692 INFO ]: Start accepts. Automaton has 75 states and 136 transitions. Word has length 17 [2018-06-22 11:46:14,692 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:14,692 INFO ]: Abstraction has 75 states and 136 transitions. [2018-06-22 11:46:14,692 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:46:14,692 INFO ]: Start isEmpty. Operand 75 states and 136 transitions. [2018-06-22 11:46:14,693 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:14,693 INFO ]: Found error trace [2018-06-22 11:46:14,693 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:14,693 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:14,693 INFO ]: Analyzing trace with hash -421655859, now seen corresponding path program 1 times [2018-06-22 11:46:14,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:14,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:14,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:14,696 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:14,696 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:14,701 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:14,793 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:46:14,793 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:14,793 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:14,793 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:14,794 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:14,794 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:14,794 INFO ]: Start difference. First operand 75 states and 136 transitions. Second operand 4 states. [2018-06-22 11:46:15,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:15,003 INFO ]: Finished difference Result 107 states and 191 transitions. [2018-06-22 11:46:15,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:15,003 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:46:15,004 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:15,004 INFO ]: With dead ends: 107 [2018-06-22 11:46:15,004 INFO ]: Without dead ends: 88 [2018-06-22 11:46:15,004 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:15,004 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:46:15,007 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 64. [2018-06-22 11:46:15,007 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:46:15,008 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2018-06-22 11:46:15,008 INFO ]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 17 [2018-06-22 11:46:15,008 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:15,008 INFO ]: Abstraction has 64 states and 106 transitions. [2018-06-22 11:46:15,008 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:15,008 INFO ]: Start isEmpty. Operand 64 states and 106 transitions. [2018-06-22 11:46:15,009 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:15,009 INFO ]: Found error trace [2018-06-22 11:46:15,009 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:15,009 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:15,009 INFO ]: Analyzing trace with hash -33802776, now seen corresponding path program 2 times [2018-06-22 11:46:15,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:15,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:15,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:15,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:15,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:15,019 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:15,548 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:46:15,548 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:15,548 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:15,554 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:15,569 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:15,569 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:15,570 INFO ]: Computing forward predicates... [2018-06-22 11:46:15,701 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:46:15,720 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:15,720 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:15,720 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:15,720 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:15,720 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:15,720 INFO ]: Start difference. First operand 64 states and 106 transitions. Second operand 7 states. [2018-06-22 11:46:15,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:15,965 INFO ]: Finished difference Result 114 states and 208 transitions. [2018-06-22 11:46:15,965 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:15,965 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:15,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:15,965 INFO ]: With dead ends: 114 [2018-06-22 11:46:15,965 INFO ]: Without dead ends: 112 [2018-06-22 11:46:15,965 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:15,966 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:46:15,970 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 66. [2018-06-22 11:46:15,970 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:46:15,970 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 109 transitions. [2018-06-22 11:46:15,970 INFO ]: Start accepts. Automaton has 66 states and 109 transitions. Word has length 17 [2018-06-22 11:46:15,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:15,971 INFO ]: Abstraction has 66 states and 109 transitions. [2018-06-22 11:46:15,971 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:15,971 INFO ]: Start isEmpty. Operand 66 states and 109 transitions. [2018-06-22 11:46:15,971 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:15,971 INFO ]: Found error trace [2018-06-22 11:46:15,971 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:15,971 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:15,971 INFO ]: Analyzing trace with hash 891181854, now seen corresponding path program 1 times [2018-06-22 11:46:15,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:15,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:15,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:15,972 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:15,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:15,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:16,126 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:46:16,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:16,127 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:16,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:16,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:16,148 INFO ]: Computing forward predicates... [2018-06-22 11:46:16,181 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:46:16,200 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:16,200 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:16,201 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:16,201 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:16,201 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:16,201 INFO ]: Start difference. First operand 66 states and 109 transitions. Second operand 7 states. [2018-06-22 11:46:16,385 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:16,385 INFO ]: Finished difference Result 112 states and 204 transitions. [2018-06-22 11:46:16,385 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:16,385 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:16,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:16,386 INFO ]: With dead ends: 112 [2018-06-22 11:46:16,386 INFO ]: Without dead ends: 112 [2018-06-22 11:46:16,386 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:16,386 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:46:16,391 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 68. [2018-06-22 11:46:16,391 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:46:16,391 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 114 transitions. [2018-06-22 11:46:16,391 INFO ]: Start accepts. Automaton has 68 states and 114 transitions. Word has length 17 [2018-06-22 11:46:16,391 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:16,391 INFO ]: Abstraction has 68 states and 114 transitions. [2018-06-22 11:46:16,392 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:16,392 INFO ]: Start isEmpty. Operand 68 states and 114 transitions. [2018-06-22 11:46:16,392 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:16,392 INFO ]: Found error trace [2018-06-22 11:46:16,392 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:16,392 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:16,392 INFO ]: Analyzing trace with hash 2026860364, now seen corresponding path program 1 times [2018-06-22 11:46:16,392 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:16,392 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:16,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:16,393 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:16,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:16,403 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:16,590 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:46:16,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:16,590 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:16,595 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:16,609 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:16,611 INFO ]: Computing forward predicates... [2018-06-22 11:46:16,644 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:46:16,662 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:16,662 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:16,663 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:16,663 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:16,663 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:16,663 INFO ]: Start difference. First operand 68 states and 114 transitions. Second operand 7 states. [2018-06-22 11:46:16,850 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:16,850 INFO ]: Finished difference Result 112 states and 203 transitions. [2018-06-22 11:46:16,850 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:16,850 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:16,850 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:16,850 INFO ]: With dead ends: 112 [2018-06-22 11:46:16,850 INFO ]: Without dead ends: 112 [2018-06-22 11:46:16,851 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:16,851 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:46:16,853 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 68. [2018-06-22 11:46:16,853 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:46:16,854 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 113 transitions. [2018-06-22 11:46:16,854 INFO ]: Start accepts. Automaton has 68 states and 113 transitions. Word has length 17 [2018-06-22 11:46:16,854 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:16,854 INFO ]: Abstraction has 68 states and 113 transitions. [2018-06-22 11:46:16,854 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:16,854 INFO ]: Start isEmpty. Operand 68 states and 113 transitions. [2018-06-22 11:46:16,855 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:16,855 INFO ]: Found error trace [2018-06-22 11:46:16,855 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:16,855 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:16,855 INFO ]: Analyzing trace with hash -1421279721, now seen corresponding path program 1 times [2018-06-22 11:46:16,855 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:16,855 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:16,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:16,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:16,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:16,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:17,138 WARN ]: Spent 122.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-06-22 11:46:17,629 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:46:17,629 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:17,629 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:46:17,644 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:17,677 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:17,678 INFO ]: Computing forward predicates... [2018-06-22 11:46:18,089 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:46:18,110 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:18,110 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 11:46:18,110 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:46:18,110 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:46:18,110 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:18,110 INFO ]: Start difference. First operand 68 states and 113 transitions. Second operand 11 states. [2018-06-22 11:46:18,641 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:18,641 INFO ]: Finished difference Result 148 states and 274 transitions. [2018-06-22 11:46:18,641 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:46:18,641 INFO ]: Start accepts. Automaton has 11 states. Word has length 17 [2018-06-22 11:46:18,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:18,642 INFO ]: With dead ends: 148 [2018-06-22 11:46:18,642 INFO ]: Without dead ends: 148 [2018-06-22 11:46:18,642 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:46:18,642 INFO ]: Start minimizeSevpa. Operand 148 states. [2018-06-22 11:46:18,651 INFO ]: Finished minimizeSevpa. Reduced states from 148 to 76. [2018-06-22 11:46:18,651 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:46:18,651 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 134 transitions. [2018-06-22 11:46:18,651 INFO ]: Start accepts. Automaton has 76 states and 134 transitions. Word has length 17 [2018-06-22 11:46:18,651 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:18,651 INFO ]: Abstraction has 76 states and 134 transitions. [2018-06-22 11:46:18,651 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:46:18,651 INFO ]: Start isEmpty. Operand 76 states and 134 transitions. [2018-06-22 11:46:18,653 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:18,653 INFO ]: Found error trace [2018-06-22 11:46:18,653 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:18,654 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:18,654 INFO ]: Analyzing trace with hash -496295091, now seen corresponding path program 1 times [2018-06-22 11:46:18,654 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:18,654 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:18,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:18,654 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:18,654 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:18,662 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:18,878 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:46:18,878 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:18,878 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:18,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:18,907 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:18,909 INFO ]: Computing forward predicates... [2018-06-22 11:46:19,065 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:46:19,095 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:19,095 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:19,095 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:19,095 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:19,095 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:19,096 INFO ]: Start difference. First operand 76 states and 134 transitions. Second operand 7 states. [2018-06-22 11:46:19,438 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:19,438 INFO ]: Finished difference Result 124 states and 239 transitions. [2018-06-22 11:46:19,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:19,438 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:19,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:19,439 INFO ]: With dead ends: 124 [2018-06-22 11:46:19,439 INFO ]: Without dead ends: 124 [2018-06-22 11:46:19,439 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:19,439 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-22 11:46:19,443 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 76. [2018-06-22 11:46:19,444 INFO ]: Start removeUnreachable. Operand 76 states. [2018-06-22 11:46:19,444 INFO ]: Finished removeUnreachable. Reduced from 76 states to 76 states and 133 transitions. [2018-06-22 11:46:19,444 INFO ]: Start accepts. Automaton has 76 states and 133 transitions. Word has length 17 [2018-06-22 11:46:19,444 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:19,444 INFO ]: Abstraction has 76 states and 133 transitions. [2018-06-22 11:46:19,444 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:19,444 INFO ]: Start isEmpty. Operand 76 states and 133 transitions. [2018-06-22 11:46:19,445 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:19,445 INFO ]: Found error trace [2018-06-22 11:46:19,445 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:19,445 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:19,445 INFO ]: Analyzing trace with hash 428689539, now seen corresponding path program 1 times [2018-06-22 11:46:19,445 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:19,445 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:19,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:19,446 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:19,446 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:19,456 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:19,685 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-06-22 11:46:19,713 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:46:19,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:19,713 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:19,719 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:19,733 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:19,735 INFO ]: Computing forward predicates... [2018-06-22 11:46:19,772 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:46:19,791 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:19,791 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:46:19,791 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:46:19,791 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:46:19,791 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:19,791 INFO ]: Start difference. First operand 76 states and 133 transitions. Second operand 8 states. [2018-06-22 11:46:20,023 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:20,023 INFO ]: Finished difference Result 124 states and 238 transitions. [2018-06-22 11:46:20,023 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:20,023 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:46:20,023 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:20,024 INFO ]: With dead ends: 124 [2018-06-22 11:46:20,024 INFO ]: Without dead ends: 118 [2018-06-22 11:46:20,024 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:20,024 INFO ]: Start minimizeSevpa. Operand 118 states. [2018-06-22 11:46:20,027 INFO ]: Finished minimizeSevpa. Reduced states from 118 to 72. [2018-06-22 11:46:20,027 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:46:20,027 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 127 transitions. [2018-06-22 11:46:20,028 INFO ]: Start accepts. Automaton has 72 states and 127 transitions. Word has length 17 [2018-06-22 11:46:20,028 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:20,028 INFO ]: Abstraction has 72 states and 127 transitions. [2018-06-22 11:46:20,028 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:46:20,028 INFO ]: Start isEmpty. Operand 72 states and 127 transitions. [2018-06-22 11:46:20,028 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:20,028 INFO ]: Found error trace [2018-06-22 11:46:20,028 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:20,028 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:20,029 INFO ]: Analyzing trace with hash 607615227, now seen corresponding path program 3 times [2018-06-22 11:46:20,029 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:20,029 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:20,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:20,029 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:20,029 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:20,036 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:20,134 INFO ]: Checked inductivity of 19 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:20,135 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:20,135 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:20,147 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:46:20,168 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:46:20,168 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:20,170 INFO ]: Computing forward predicates... [2018-06-22 11:46:20,272 INFO ]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:20,292 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:20,292 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-06-22 11:46:20,292 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:20,292 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:20,292 INFO ]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:20,292 INFO ]: Start difference. First operand 72 states and 127 transitions. Second operand 15 states. [2018-06-22 11:46:21,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:21,306 INFO ]: Finished difference Result 90 states and 137 transitions. [2018-06-22 11:46:21,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:46:21,306 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 11:46:21,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:21,306 INFO ]: With dead ends: 90 [2018-06-22 11:46:21,306 INFO ]: Without dead ends: 63 [2018-06-22 11:46:21,306 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:46:21,307 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 11:46:21,308 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 39. [2018-06-22 11:46:21,308 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-22 11:46:21,308 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2018-06-22 11:46:21,308 INFO ]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 21 [2018-06-22 11:46:21,308 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:21,308 INFO ]: Abstraction has 39 states and 56 transitions. [2018-06-22 11:46:21,308 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:21,309 INFO ]: Start isEmpty. Operand 39 states and 56 transitions. [2018-06-22 11:46:21,309 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:21,309 INFO ]: Found error trace [2018-06-22 11:46:21,309 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:21,309 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:21,309 INFO ]: Analyzing trace with hash -1613868842, now seen corresponding path program 1 times [2018-06-22 11:46:21,309 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:21,309 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:21,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:21,309 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:21,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:21,316 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:21,478 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:46:21,478 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:21,478 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:21,483 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:21,503 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:21,505 INFO ]: Computing forward predicates... [2018-06-22 11:46:21,604 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:46:21,623 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:21,624 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:46:21,624 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:21,624 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:21,624 INFO ]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:21,624 INFO ]: Start difference. First operand 39 states and 56 transitions. Second operand 13 states. [2018-06-22 11:46:21,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:21,762 INFO ]: Finished difference Result 33 states and 45 transitions. [2018-06-22 11:46:21,763 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:21,763 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:46:21,763 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:21,763 INFO ]: With dead ends: 33 [2018-06-22 11:46:21,763 INFO ]: Without dead ends: 0 [2018-06-22 11:46:21,763 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:46:21,763 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:46:21,763 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:46:21,763 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:46:21,763 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:46:21,763 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-06-22 11:46:21,763 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:21,763 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:46:21,763 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:21,763 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:46:21,763 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:46:21,767 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:46:21 BoogieIcfgContainer [2018-06-22 11:46:21,767 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:46:21,768 INFO ]: Toolchain (without parser) took 50536.62 ms. Allocated memory was 306.2 MB in the beginning and 637.5 MB in the end (delta: 331.4 MB). Free memory was 254.7 MB in the beginning and 481.0 MB in the end (delta: -226.3 MB). Peak memory consumption was 105.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:21,768 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:46:21,769 INFO ]: ChcToBoogie took 60.36 ms. Allocated memory is still 306.2 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:21,770 INFO ]: Boogie Preprocessor took 62.11 ms. Allocated memory is still 306.2 MB. Free memory was 252.7 MB in the beginning and 250.8 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:46:21,770 INFO ]: RCFGBuilder took 594.90 ms. Allocated memory is still 306.2 MB. Free memory was 250.8 MB in the beginning and 232.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:21,771 INFO ]: TraceAbstraction took 49810.15 ms. Allocated memory was 306.2 MB in the beginning and 637.5 MB in the end (delta: 331.4 MB). Free memory was 232.8 MB in the beginning and 481.0 MB in the end (delta: -248.2 MB). Peak memory consumption was 83.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:21,773 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.2 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 60.36 ms. Allocated memory is still 306.2 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 62.11 ms. Allocated memory is still 306.2 MB. Free memory was 252.7 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 594.90 ms. Allocated memory is still 306.2 MB. Free memory was 250.8 MB in the beginning and 232.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 49810.15 ms. Allocated memory was 306.2 MB in the beginning and 637.5 MB in the end (delta: 331.4 MB). Free memory was 232.8 MB in the beginning and 481.0 MB in the end (delta: -248.2 MB). Peak memory consumption was 83.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. SAFE Result, 49.7s OverallTime, 52 OverallIterations, 4 TraceHistogramMax, 31.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1777 SDtfs, 330 SDslu, 4619 SDs, 0 SdLazy, 8571 SolverSat, 570 SolverUnsat, 61 SolverUnknown, 0 SolverNotchecked, 23.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 993 GetRequests, 476 SyntacticMatches, 94 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 20.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 52 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 1180 ConstructedInterpolants, 16 QuantifiedInterpolants, 97016 SizeOfPredicates, 264 NumberOfNonLiveVariables, 4321 ConjunctsInSsa, 1038 ConjunctsInUnsatCore, 86 InterpolantComputations, 18 PerfectInterpolantSequences, 302/524 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strncmp_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-46-21-780.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strncmp_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-46-21-780.csv Received shutdown request...