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__strpbrk_1.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:46:23,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:46:23,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:46:23,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:46:23,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:46:23,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:46:23,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:46:23,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:46:23,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:46:23,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:46:23,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:46:23,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:46:23,920 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:46:23,921 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:46:23,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:46:23,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:46:23,928 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:46:23,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:46:23,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:46:23,933 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:46:23,934 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:46:23,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:46:23,936 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:46:23,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:46:23,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:46:23,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:46:23,939 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:46:23,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:46:23,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:46:23,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:46:23,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:46:23,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:46:23,942 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:46:23,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:46:23,944 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:46:23,944 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:46:23,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:46:23,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:46:23,958 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:46:23,958 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:46:23,959 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:46:23,959 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:46:23,960 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:46:23,960 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:46:23,960 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:46:23,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:46:23,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:46:23,961 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:46:23,961 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:46:23,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:46:23,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:46:23,961 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:46:23,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:46:23,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:46:23,962 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:46:23,963 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:46:23,963 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:46:24,013 INFO ]: Repository-Root is: /tmp [2018-06-22 11:46:24,030 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:46:24,037 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:46:24,038 INFO ]: Initializing SmtParser... [2018-06-22 11:46:24,038 INFO ]: SmtParser initialized [2018-06-22 11:46:24,039 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_1.array.smt2 [2018-06-22 11:46:24,040 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:46:24,110 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_1.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@6c42ab2 [2018-06-22 11:46:24,379 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strpbrk_1.array.smt2 [2018-06-22 11:46:24,386 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:46:24,392 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:46:24,392 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:46:24,392 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:46:24,393 INFO ]: ChcToBoogie initialized [2018-06-22 11:46:24,396 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,443 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24 Unit [2018-06-22 11:46:24,443 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:46:24,444 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:46:24,444 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:46:24,444 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:46:24,468 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,468 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,476 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,477 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,481 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,482 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,489 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (1/1) ... [2018-06-22 11:46:24,491 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:46:24,491 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:46:24,491 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:46:24,491 INFO ]: RCFGBuilder initialized [2018-06-22 11:46:24,498 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (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:46:24,509 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:46:24,509 INFO ]: Found specification of procedure False [2018-06-22 11:46:24,510 INFO ]: Found implementation of procedure False [2018-06-22 11:46:24,510 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-22 11:46:24,510 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-22 11:46:24,510 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-22 11:46:24,510 INFO ]: Specification and implementation of procedure INV_MAIN_0 given in one single declaration [2018-06-22 11:46:24,510 INFO ]: Found specification of procedure INV_MAIN_0 [2018-06-22 11:46:24,510 INFO ]: Found implementation of procedure INV_MAIN_0 [2018-06-22 11:46:24,510 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:46:24,510 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:46:24,510 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:46:24,932 INFO ]: Using library mode [2018-06-22 11:46:24,933 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:46:24 BoogieIcfgContainer [2018-06-22 11:46:24,933 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:46:24,934 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:46:24,934 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:46:24,937 INFO ]: TraceAbstraction initialized [2018-06-22 11:46:24,938 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:46:24" (1/3) ... [2018-06-22 11:46:24,939 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed1d725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:46:24, skipping insertion in model container [2018-06-22 11:46:24,939 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:24" (2/3) ... [2018-06-22 11:46:24,939 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed1d725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:46:24, skipping insertion in model container [2018-06-22 11:46:24,939 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:46:24" (3/3) ... [2018-06-22 11:46:24,941 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:46:24,950 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:46:24,958 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:46:25,005 INFO ]: Using default assertion order modulation [2018-06-22 11:46:25,005 INFO ]: Interprodecural is true [2018-06-22 11:46:25,005 INFO ]: Hoare is false [2018-06-22 11:46:25,005 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:46:25,005 INFO ]: Backedges is TWOTRACK [2018-06-22 11:46:25,005 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:46:25,005 INFO ]: Difference is false [2018-06-22 11:46:25,006 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:46:25,006 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:46:25,020 INFO ]: Start isEmpty. Operand 25 states. [2018-06-22 11:46:25,034 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:25,034 INFO ]: Found error trace [2018-06-22 11:46:25,035 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:25,035 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:25,039 INFO ]: Analyzing trace with hash 1019689641, now seen corresponding path program 1 times [2018-06-22 11:46:25,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:25,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:25,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:25,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,104 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:25,173 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:46:25,174 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:25,174 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:25,176 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:25,186 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:25,186 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:25,187 INFO ]: Start difference. First operand 25 states. Second operand 4 states. [2018-06-22 11:46:25,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:25,306 INFO ]: Finished difference Result 27 states and 46 transitions. [2018-06-22 11:46:25,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:25,308 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:25,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:25,319 INFO ]: With dead ends: 27 [2018-06-22 11:46:25,319 INFO ]: Without dead ends: 27 [2018-06-22 11:46:25,320 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:46:25,333 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:46:25,358 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:46:25,359 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:46:25,360 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2018-06-22 11:46:25,361 INFO ]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 9 [2018-06-22 11:46:25,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:25,362 INFO ]: Abstraction has 25 states and 44 transitions. [2018-06-22 11:46:25,362 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:25,362 INFO ]: Start isEmpty. Operand 25 states and 44 transitions. [2018-06-22 11:46:25,365 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:25,365 INFO ]: Found error trace [2018-06-22 11:46:25,365 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:25,365 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:25,365 INFO ]: Analyzing trace with hash 1516288883, now seen corresponding path program 1 times [2018-06-22 11:46:25,365 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:25,365 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:25,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,366 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:25,366 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,371 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:25,426 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:46:25,426 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:25,426 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:25,428 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:25,428 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:25,428 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:25,428 INFO ]: Start difference. First operand 25 states and 44 transitions. Second operand 4 states. [2018-06-22 11:46:25,537 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:25,537 INFO ]: Finished difference Result 27 states and 44 transitions. [2018-06-22 11:46:25,537 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:25,537 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:25,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:25,538 INFO ]: With dead ends: 27 [2018-06-22 11:46:25,538 INFO ]: Without dead ends: 27 [2018-06-22 11:46:25,539 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:46:25,539 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:46:25,545 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:46:25,545 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:46:25,546 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2018-06-22 11:46:25,547 INFO ]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 9 [2018-06-22 11:46:25,547 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:25,547 INFO ]: Abstraction has 25 states and 42 transitions. [2018-06-22 11:46:25,547 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:25,547 INFO ]: Start isEmpty. Operand 25 states and 42 transitions. [2018-06-22 11:46:25,548 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:25,548 INFO ]: Found error trace [2018-06-22 11:46:25,548 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:25,549 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:25,549 INFO ]: Analyzing trace with hash -537206558, now seen corresponding path program 1 times [2018-06-22 11:46:25,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:25,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:25,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,550 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:25,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:25,571 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:25,865 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:46:25,865 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:25,865 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:46:25,866 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:25,866 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:25,866 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:25,866 INFO ]: Start difference. First operand 25 states and 42 transitions. Second operand 6 states. [2018-06-22 11:46:26,349 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:26,350 INFO ]: Finished difference Result 33 states and 66 transitions. [2018-06-22 11:46:26,351 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:46:26,351 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:26,351 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:26,353 INFO ]: With dead ends: 33 [2018-06-22 11:46:26,353 INFO ]: Without dead ends: 33 [2018-06-22 11:46:26,353 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:26,353 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:46:26,366 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-22 11:46:26,366 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:46:26,369 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2018-06-22 11:46:26,369 INFO ]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 13 [2018-06-22 11:46:26,370 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:26,370 INFO ]: Abstraction has 27 states and 49 transitions. [2018-06-22 11:46:26,370 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:26,370 INFO ]: Start isEmpty. Operand 27 states and 49 transitions. [2018-06-22 11:46:26,371 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:26,371 INFO ]: Found error trace [2018-06-22 11:46:26,371 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:26,371 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:26,371 INFO ]: Analyzing trace with hash 553977166, now seen corresponding path program 1 times [2018-06-22 11:46:26,371 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:26,371 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:26,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:26,372 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:26,372 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:26,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:26,669 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:46:26,669 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:26,669 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:46:26,670 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:26,682 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:26,682 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:26,682 INFO ]: Start difference. First operand 27 states and 49 transitions. Second operand 6 states. [2018-06-22 11:46:27,233 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:27,234 INFO ]: Finished difference Result 37 states and 77 transitions. [2018-06-22 11:46:27,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:27,235 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:27,235 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:27,236 INFO ]: With dead ends: 37 [2018-06-22 11:46:27,236 INFO ]: Without dead ends: 37 [2018-06-22 11:46:27,237 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:27,237 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:46:27,248 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-06-22 11:46:27,248 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:46:27,249 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 67 transitions. [2018-06-22 11:46:27,249 INFO ]: Start accepts. Automaton has 33 states and 67 transitions. Word has length 13 [2018-06-22 11:46:27,249 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:27,249 INFO ]: Abstraction has 33 states and 67 transitions. [2018-06-22 11:46:27,249 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:27,249 INFO ]: Start isEmpty. Operand 33 states and 67 transitions. [2018-06-22 11:46:27,252 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:27,252 INFO ]: Found error trace [2018-06-22 11:46:27,252 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:27,252 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:27,252 INFO ]: Analyzing trace with hash -2139098344, now seen corresponding path program 1 times [2018-06-22 11:46:27,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:27,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:27,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:27,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:27,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:27,264 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:27,360 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:46:27,361 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:27,361 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:46:27,361 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:27,361 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:27,361 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:27,361 INFO ]: Start difference. First operand 33 states and 67 transitions. Second operand 6 states. [2018-06-22 11:46:27,952 WARN ]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 11:46:28,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:28,138 INFO ]: Finished difference Result 37 states and 75 transitions. [2018-06-22 11:46:28,139 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:28,139 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:28,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:28,141 INFO ]: With dead ends: 37 [2018-06-22 11:46:28,141 INFO ]: Without dead ends: 37 [2018-06-22 11:46:28,141 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:28,141 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-22 11:46:28,153 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-06-22 11:46:28,153 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:46:28,154 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 65 transitions. [2018-06-22 11:46:28,154 INFO ]: Start accepts. Automaton has 33 states and 65 transitions. Word has length 13 [2018-06-22 11:46:28,154 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:28,154 INFO ]: Abstraction has 33 states and 65 transitions. [2018-06-22 11:46:28,154 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:28,155 INFO ]: Start isEmpty. Operand 33 states and 65 transitions. [2018-06-22 11:46:28,156 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:28,156 INFO ]: Found error trace [2018-06-22 11:46:28,156 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:28,156 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:28,156 INFO ]: Analyzing trace with hash 1125617781, now seen corresponding path program 1 times [2018-06-22 11:46:28,157 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:28,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:28,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:28,157 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:28,157 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:28,165 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:28,228 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:46:28,228 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:28,228 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:46:28,228 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:46:28,228 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:46:28,228 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:28,228 INFO ]: Start difference. First operand 33 states and 65 transitions. Second operand 5 states. [2018-06-22 11:46:28,330 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:28,330 INFO ]: Finished difference Result 33 states and 63 transitions. [2018-06-22 11:46:28,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:28,336 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:46:28,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:28,337 INFO ]: With dead ends: 33 [2018-06-22 11:46:28,337 INFO ]: Without dead ends: 32 [2018-06-22 11:46:28,337 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:28,337 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:46:28,343 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:46:28,344 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:46:28,345 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2018-06-22 11:46:28,345 INFO ]: Start accepts. Automaton has 32 states and 61 transitions. Word has length 17 [2018-06-22 11:46:28,345 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:28,345 INFO ]: Abstraction has 32 states and 61 transitions. [2018-06-22 11:46:28,345 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:46:28,345 INFO ]: Start isEmpty. Operand 32 states and 61 transitions. [2018-06-22 11:46:28,346 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:28,346 INFO ]: Found error trace [2018-06-22 11:46:28,346 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:28,347 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:28,347 INFO ]: Analyzing trace with hash 1430742013, now seen corresponding path program 1 times [2018-06-22 11:46:28,347 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:28,347 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:28,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:28,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:28,347 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:28,361 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:28,509 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:46:28,509 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:28,509 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:46:28,524 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:28,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:28,575 INFO ]: Computing forward predicates... [2018-06-22 11:46:29,018 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:46:29,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:29,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:46:29,053 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:29,053 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:29,053 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:29,053 INFO ]: Start difference. First operand 32 states and 61 transitions. Second operand 10 states. [2018-06-22 11:46:29,451 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:46:29,773 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:29,773 INFO ]: Finished difference Result 44 states and 99 transitions. [2018-06-22 11:46:29,774 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:29,774 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:29,774 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:29,776 INFO ]: With dead ends: 44 [2018-06-22 11:46:29,776 INFO ]: Without dead ends: 44 [2018-06-22 11:46:29,776 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:29,776 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:46:29,785 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-06-22 11:46:29,785 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:46:29,787 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2018-06-22 11:46:29,787 INFO ]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 17 [2018-06-22 11:46:29,787 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:29,787 INFO ]: Abstraction has 36 states and 74 transitions. [2018-06-22 11:46:29,787 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:29,787 INFO ]: Start isEmpty. Operand 36 states and 74 transitions. [2018-06-22 11:46:29,788 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:29,789 INFO ]: Found error trace [2018-06-22 11:46:29,789 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:29,789 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:29,789 INFO ]: Analyzing trace with hash 200633151, now seen corresponding path program 1 times [2018-06-22 11:46:29,789 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:29,789 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:29,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:29,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:29,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:29,810 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:29,957 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:46:29,958 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:29,958 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:46:29,958 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:29,958 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:29,958 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:29,958 INFO ]: Start difference. First operand 36 states and 74 transitions. Second operand 7 states. [2018-06-22 11:46:30,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:30,263 INFO ]: Finished difference Result 36 states and 70 transitions. [2018-06-22 11:46:30,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:30,264 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:30,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:30,265 INFO ]: With dead ends: 36 [2018-06-22 11:46:30,265 INFO ]: Without dead ends: 34 [2018-06-22 11:46:30,265 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:30,265 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:46:30,270 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 11:46:30,270 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:46:30,271 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 66 transitions. [2018-06-22 11:46:30,271 INFO ]: Start accepts. Automaton has 34 states and 66 transitions. Word has length 17 [2018-06-22 11:46:30,271 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:30,271 INFO ]: Abstraction has 34 states and 66 transitions. [2018-06-22 11:46:30,271 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:30,271 INFO ]: Start isEmpty. Operand 34 states and 66 transitions. [2018-06-22 11:46:30,273 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:30,273 INFO ]: Found error trace [2018-06-22 11:46:30,273 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:30,273 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:30,273 INFO ]: Analyzing trace with hash 505757383, now seen corresponding path program 1 times [2018-06-22 11:46:30,273 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:30,273 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:30,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:30,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:30,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:30,288 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:30,384 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:46:30,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:30,384 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:46:30,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:30,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:30,409 INFO ]: Computing forward predicates... [2018-06-22 11:46:30,470 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:46:30,489 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:30,489 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:46:30,489 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:30,489 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:30,489 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:30,489 INFO ]: Start difference. First operand 34 states and 66 transitions. Second operand 10 states. [2018-06-22 11:46:30,707 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:30,707 INFO ]: Finished difference Result 42 states and 90 transitions. [2018-06-22 11:46:30,707 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:30,707 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:30,707 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:30,708 INFO ]: With dead ends: 42 [2018-06-22 11:46:30,708 INFO ]: Without dead ends: 42 [2018-06-22 11:46:30,708 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:30,708 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:46:30,715 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-06-22 11:46:30,715 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:46:30,716 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 65 transitions. [2018-06-22 11:46:30,716 INFO ]: Start accepts. Automaton has 34 states and 65 transitions. Word has length 17 [2018-06-22 11:46:30,716 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:30,716 INFO ]: Abstraction has 34 states and 65 transitions. [2018-06-22 11:46:30,716 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:30,716 INFO ]: Start isEmpty. Operand 34 states and 65 transitions. [2018-06-22 11:46:30,717 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:30,717 INFO ]: Found error trace [2018-06-22 11:46:30,717 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:30,717 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:30,717 INFO ]: Analyzing trace with hash -388972365, now seen corresponding path program 1 times [2018-06-22 11:46:30,717 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:30,718 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:30,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:30,718 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:30,718 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:30,730 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:30,820 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:46:30,820 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:30,820 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:46:30,826 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:30,839 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:30,842 INFO ]: Computing forward predicates... [2018-06-22 11:46:30,909 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:46:30,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:30,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:46:30,928 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:30,928 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:30,928 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:30,928 INFO ]: Start difference. First operand 34 states and 65 transitions. Second operand 10 states. [2018-06-22 11:46:31,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:31,198 INFO ]: Finished difference Result 44 states and 96 transitions. [2018-06-22 11:46:31,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:31,198 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:31,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:31,199 INFO ]: With dead ends: 44 [2018-06-22 11:46:31,199 INFO ]: Without dead ends: 44 [2018-06-22 11:46:31,200 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:31,200 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:46:31,211 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-06-22 11:46:31,211 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:46:31,217 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 71 transitions. [2018-06-22 11:46:31,217 INFO ]: Start accepts. Automaton has 36 states and 71 transitions. Word has length 17 [2018-06-22 11:46:31,217 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:31,217 INFO ]: Abstraction has 36 states and 71 transitions. [2018-06-22 11:46:31,217 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:31,217 INFO ]: Start isEmpty. Operand 36 states and 71 transitions. [2018-06-22 11:46:31,218 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:31,218 INFO ]: Found error trace [2018-06-22 11:46:31,218 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:31,218 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:31,218 INFO ]: Analyzing trace with hash -1313956995, now seen corresponding path program 1 times [2018-06-22 11:46:31,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:31,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:31,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:31,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:31,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:31,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:31,314 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:46:31,314 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:31,314 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:46:31,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:31,345 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:31,347 INFO ]: Computing forward predicates... [2018-06-22 11:46:31,509 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:46:31,531 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:31,531 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-22 11:46:31,531 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:31,532 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:31,532 INFO ]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:31,532 INFO ]: Start difference. First operand 36 states and 71 transitions. Second operand 10 states. [2018-06-22 11:46:31,715 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:31,715 INFO ]: Finished difference Result 46 states and 102 transitions. [2018-06-22 11:46:31,715 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:31,715 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:31,716 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:31,716 INFO ]: With dead ends: 46 [2018-06-22 11:46:31,716 INFO ]: Without dead ends: 46 [2018-06-22 11:46:31,717 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:31,717 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:46:31,724 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-06-22 11:46:31,724 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:46:31,725 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 77 transitions. [2018-06-22 11:46:31,725 INFO ]: Start accepts. Automaton has 38 states and 77 transitions. Word has length 17 [2018-06-22 11:46:31,725 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:31,725 INFO ]: Abstraction has 38 states and 77 transitions. [2018-06-22 11:46:31,725 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:31,725 INFO ]: Start isEmpty. Operand 38 states and 77 transitions. [2018-06-22 11:46:31,726 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:31,726 INFO ]: Found error trace [2018-06-22 11:46:31,726 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:31,726 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:31,726 INFO ]: Analyzing trace with hash 1859771344, now seen corresponding path program 1 times [2018-06-22 11:46:31,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:31,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:31,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:31,727 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:31,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:31,739 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:31,919 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:46:31,919 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:31,919 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:46:31,919 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:31,919 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:31,919 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:31,919 INFO ]: Start difference. First operand 38 states and 77 transitions. Second operand 7 states. [2018-06-22 11:46:32,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:32,046 INFO ]: Finished difference Result 50 states and 115 transitions. [2018-06-22 11:46:32,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:32,046 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:32,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:32,047 INFO ]: With dead ends: 50 [2018-06-22 11:46:32,047 INFO ]: Without dead ends: 50 [2018-06-22 11:46:32,047 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:32,048 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:46:32,057 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-06-22 11:46:32,057 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:46:32,058 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 90 transitions. [2018-06-22 11:46:32,059 INFO ]: Start accepts. Automaton has 42 states and 90 transitions. Word has length 17 [2018-06-22 11:46:32,059 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:32,059 INFO ]: Abstraction has 42 states and 90 transitions. [2018-06-22 11:46:32,059 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:32,059 INFO ]: Start isEmpty. Operand 42 states and 90 transitions. [2018-06-22 11:46:32,060 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:32,060 INFO ]: Found error trace [2018-06-22 11:46:32,060 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:32,060 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:32,060 INFO ]: Analyzing trace with hash 934786714, now seen corresponding path program 1 times [2018-06-22 11:46:32,060 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:32,060 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:32,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:32,061 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:32,061 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:32,074 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:32,153 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:46:32,153 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:32,153 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:46:32,153 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:32,153 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:32,153 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:32,153 INFO ]: Start difference. First operand 42 states and 90 transitions. Second operand 7 states. [2018-06-22 11:46:32,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:32,318 INFO ]: Finished difference Result 50 states and 113 transitions. [2018-06-22 11:46:32,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:32,318 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 11:46:32,318 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:32,319 INFO ]: With dead ends: 50 [2018-06-22 11:46:32,319 INFO ]: Without dead ends: 50 [2018-06-22 11:46:32,320 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:32,320 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:46:32,327 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-06-22 11:46:32,327 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:46:32,328 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 88 transitions. [2018-06-22 11:46:32,328 INFO ]: Start accepts. Automaton has 42 states and 88 transitions. Word has length 17 [2018-06-22 11:46:32,328 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:32,328 INFO ]: Abstraction has 42 states and 88 transitions. [2018-06-22 11:46:32,328 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:32,328 INFO ]: Start isEmpty. Operand 42 states and 88 transitions. [2018-06-22 11:46:32,329 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:32,329 INFO ]: Found error trace [2018-06-22 11:46:32,329 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:32,329 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:32,329 INFO ]: Analyzing trace with hash 1416712309, now seen corresponding path program 1 times [2018-06-22 11:46:32,330 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:32,330 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:32,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:32,330 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:32,330 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:32,339 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:32,504 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:46:32,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:32,504 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:46:32,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:32,527 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:32,529 INFO ]: Computing forward predicates... [2018-06-22 11:46:32,638 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:46:32,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:32,656 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 11:46:32,657 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:32,657 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:32,657 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:32,657 INFO ]: Start difference. First operand 42 states and 88 transitions. Second operand 13 states. [2018-06-22 11:46:33,427 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:33,427 INFO ]: Finished difference Result 66 states and 164 transitions. [2018-06-22 11:46:33,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:46:33,427 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:46:33,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:33,428 INFO ]: With dead ends: 66 [2018-06-22 11:46:33,428 INFO ]: Without dead ends: 66 [2018-06-22 11:46:33,428 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:46:33,428 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:46:33,437 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 50. [2018-06-22 11:46:33,437 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:46:33,438 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 112 transitions. [2018-06-22 11:46:33,438 INFO ]: Start accepts. Automaton has 50 states and 112 transitions. Word has length 21 [2018-06-22 11:46:33,438 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:33,438 INFO ]: Abstraction has 50 states and 112 transitions. [2018-06-22 11:46:33,438 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:33,439 INFO ]: Start isEmpty. Operand 50 states and 112 transitions. [2018-06-22 11:46:33,440 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:33,440 INFO ]: Found error trace [2018-06-22 11:46:33,440 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:33,440 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:33,440 INFO ]: Analyzing trace with hash -1957087838, now seen corresponding path program 1 times [2018-06-22 11:46:33,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:33,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:33,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:33,441 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:33,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:33,445 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:33,493 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:33,494 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:33,494 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:33,494 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:33,494 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:33,494 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:33,494 INFO ]: Start difference. First operand 50 states and 112 transitions. Second operand 4 states. [2018-06-22 11:46:33,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:33,571 INFO ]: Finished difference Result 84 states and 174 transitions. [2018-06-22 11:46:33,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:33,572 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:46:33,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:33,573 INFO ]: With dead ends: 84 [2018-06-22 11:46:33,573 INFO ]: Without dead ends: 84 [2018-06-22 11:46:33,573 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:33,573 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-22 11:46:33,583 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 66. [2018-06-22 11:46:33,584 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:46:33,585 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 149 transitions. [2018-06-22 11:46:33,585 INFO ]: Start accepts. Automaton has 66 states and 149 transitions. Word has length 21 [2018-06-22 11:46:33,585 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:33,585 INFO ]: Abstraction has 66 states and 149 transitions. [2018-06-22 11:46:33,585 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:33,585 INFO ]: Start isEmpty. Operand 66 states and 149 transitions. [2018-06-22 11:46:33,586 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:33,586 INFO ]: Found error trace [2018-06-22 11:46:33,587 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:33,587 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:33,587 INFO ]: Analyzing trace with hash 292788287, now seen corresponding path program 1 times [2018-06-22 11:46:33,587 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:33,587 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:33,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:33,587 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:33,587 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:33,595 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:33,796 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:46:33,796 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:33,796 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:46:33,802 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:33,831 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:33,834 INFO ]: Computing forward predicates... [2018-06-22 11:46:34,291 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:46:34,320 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:34,321 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-06-22 11:46:34,321 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:34,321 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:34,321 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:34,321 INFO ]: Start difference. First operand 66 states and 149 transitions. Second operand 13 states. [2018-06-22 11:46:35,460 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:35,460 INFO ]: Finished difference Result 124 states and 270 transitions. [2018-06-22 11:46:35,461 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:46:35,461 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:46:35,461 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:35,462 INFO ]: With dead ends: 124 [2018-06-22 11:46:35,462 INFO ]: Without dead ends: 124 [2018-06-22 11:46:35,462 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:46:35,462 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-22 11:46:35,475 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 66. [2018-06-22 11:46:35,476 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:46:35,477 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 152 transitions. [2018-06-22 11:46:35,478 INFO ]: Start accepts. Automaton has 66 states and 152 transitions. Word has length 21 [2018-06-22 11:46:35,478 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:35,478 INFO ]: Abstraction has 66 states and 152 transitions. [2018-06-22 11:46:35,478 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:35,479 INFO ]: Start isEmpty. Operand 66 states and 152 transitions. [2018-06-22 11:46:35,480 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:35,480 INFO ]: Found error trace [2018-06-22 11:46:35,480 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:35,480 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:35,480 INFO ]: Analyzing trace with hash 1194282111, now seen corresponding path program 2 times [2018-06-22 11:46:35,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:35,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:35,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:35,481 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:35,481 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:35,501 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:35,660 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:35,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:35,660 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:46:35,666 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:35,700 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:35,700 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:35,703 INFO ]: Computing forward predicates... [2018-06-22 11:46:35,809 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:46:35,828 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:35,828 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2018-06-22 11:46:35,829 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:35,829 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:35,829 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:35,829 INFO ]: Start difference. First operand 66 states and 152 transitions. Second operand 12 states. [2018-06-22 11:46:36,236 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:36,236 INFO ]: Finished difference Result 120 states and 286 transitions. [2018-06-22 11:46:36,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:46:36,236 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:46:36,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:36,238 INFO ]: With dead ends: 120 [2018-06-22 11:46:36,238 INFO ]: Without dead ends: 120 [2018-06-22 11:46:36,238 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:46:36,239 INFO ]: Start minimizeSevpa. Operand 120 states. [2018-06-22 11:46:36,251 INFO ]: Finished minimizeSevpa. Reduced states from 120 to 66. [2018-06-22 11:46:36,251 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:46:36,252 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 149 transitions. [2018-06-22 11:46:36,252 INFO ]: Start accepts. Automaton has 66 states and 149 transitions. Word has length 21 [2018-06-22 11:46:36,252 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:36,252 INFO ]: Abstraction has 66 states and 149 transitions. [2018-06-22 11:46:36,252 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:36,252 INFO ]: Start isEmpty. Operand 66 states and 149 transitions. [2018-06-22 11:46:36,254 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:36,254 INFO ]: Found error trace [2018-06-22 11:46:36,254 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:36,254 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:36,254 INFO ]: Analyzing trace with hash -1828760321, now seen corresponding path program 1 times [2018-06-22 11:46:36,254 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:36,254 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:36,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:36,255 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:36,255 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:36,261 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:36,407 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:36,407 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:36,407 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:46:36,416 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:36,428 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:36,430 INFO ]: Computing forward predicates... [2018-06-22 11:46:36,516 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:46:36,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:36,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-06-22 11:46:36,536 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:46:36,536 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:46:36,536 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:36,536 INFO ]: Start difference. First operand 66 states and 149 transitions. Second operand 11 states. [2018-06-22 11:46:36,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:36,868 INFO ]: Finished difference Result 100 states and 227 transitions. [2018-06-22 11:46:36,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:46:36,871 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-22 11:46:36,871 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:36,873 INFO ]: With dead ends: 100 [2018-06-22 11:46:36,873 INFO ]: Without dead ends: 100 [2018-06-22 11:46:36,873 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:36,873 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 11:46:36,883 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 70. [2018-06-22 11:46:36,883 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:46:36,884 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 155 transitions. [2018-06-22 11:46:36,884 INFO ]: Start accepts. Automaton has 70 states and 155 transitions. Word has length 21 [2018-06-22 11:46:36,884 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:36,884 INFO ]: Abstraction has 70 states and 155 transitions. [2018-06-22 11:46:36,884 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:46:36,885 INFO ]: Start isEmpty. Operand 70 states and 155 transitions. [2018-06-22 11:46:36,887 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:36,887 INFO ]: Found error trace [2018-06-22 11:46:36,887 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:36,887 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:36,887 INFO ]: Analyzing trace with hash 1792052514, now seen corresponding path program 2 times [2018-06-22 11:46:36,887 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:36,887 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:36,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:36,888 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:36,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:36,900 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:36,999 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:36,999 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:36,999 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) [2018-06-22 11:46:37,017 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:37,039 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:37,039 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:37,042 INFO ]: Computing forward predicates... [2018-06-22 11:46:37,627 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:46:37,646 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:37,646 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2018-06-22 11:46:37,647 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:37,647 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:37,647 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:37,647 INFO ]: Start difference. First operand 70 states and 155 transitions. Second operand 15 states. [2018-06-22 11:46:38,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:38,155 INFO ]: Finished difference Result 90 states and 197 transitions. [2018-06-22 11:46:38,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:46:38,155 INFO ]: Start accepts. Automaton has 15 states. Word has length 21 [2018-06-22 11:46:38,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:38,157 INFO ]: With dead ends: 90 [2018-06-22 11:46:38,157 INFO ]: Without dead ends: 90 [2018-06-22 11:46:38,157 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:46:38,157 INFO ]: Start minimizeSevpa. Operand 90 states. [2018-06-22 11:46:38,166 INFO ]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-06-22 11:46:38,167 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-22 11:46:38,167 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 168 transitions. [2018-06-22 11:46:38,167 INFO ]: Start accepts. Automaton has 78 states and 168 transitions. Word has length 21 [2018-06-22 11:46:38,168 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:38,168 INFO ]: Abstraction has 78 states and 168 transitions. [2018-06-22 11:46:38,168 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:38,168 INFO ]: Start isEmpty. Operand 78 states and 168 transitions. [2018-06-22 11:46:38,169 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:38,169 INFO ]: Found error trace [2018-06-22 11:46:38,169 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:38,170 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:38,171 INFO ]: Analyzing trace with hash -1976761163, now seen corresponding path program 2 times [2018-06-22 11:46:38,171 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:38,171 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:38,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:38,171 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:38,171 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:38,182 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:38,291 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:38,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:38,291 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:46:38,296 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:38,308 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:38,308 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:38,312 INFO ]: Computing forward predicates... [2018-06-22 11:46:38,537 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:46:38,556 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:38,556 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2018-06-22 11:46:38,556 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:38,556 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:38,556 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:38,556 INFO ]: Start difference. First operand 78 states and 168 transitions. Second operand 12 states. [2018-06-22 11:46:39,376 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:39,376 INFO ]: Finished difference Result 112 states and 246 transitions. [2018-06-22 11:46:39,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:46:39,378 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:46:39,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:39,380 INFO ]: With dead ends: 112 [2018-06-22 11:46:39,380 INFO ]: Without dead ends: 112 [2018-06-22 11:46:39,380 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:46:39,380 INFO ]: Start minimizeSevpa. Operand 112 states. [2018-06-22 11:46:39,393 INFO ]: Finished minimizeSevpa. Reduced states from 112 to 74. [2018-06-22 11:46:39,394 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:46:39,394 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 154 transitions. [2018-06-22 11:46:39,395 INFO ]: Start accepts. Automaton has 74 states and 154 transitions. Word has length 21 [2018-06-22 11:46:39,395 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:39,395 INFO ]: Abstraction has 74 states and 154 transitions. [2018-06-22 11:46:39,395 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:39,395 INFO ]: Start isEmpty. Operand 74 states and 154 transitions. [2018-06-22 11:46:39,396 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:39,396 INFO ]: Found error trace [2018-06-22 11:46:39,397 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:39,397 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:39,397 INFO ]: Analyzing trace with hash 668128492, now seen corresponding path program 1 times [2018-06-22 11:46:39,397 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:39,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:39,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:39,397 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:39,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:39,404 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:40,172 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:40,172 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:40,209 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:46:40,215 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:40,226 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:40,228 INFO ]: Computing forward predicates... [2018-06-22 11:46:40,378 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:46:40,398 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:40,398 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-06-22 11:46:40,398 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:40,398 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:40,398 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:40,398 INFO ]: Start difference. First operand 74 states and 154 transitions. Second operand 13 states. [2018-06-22 11:46:40,816 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:40,816 INFO ]: Finished difference Result 86 states and 181 transitions. [2018-06-22 11:46:40,816 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:46:40,816 INFO ]: Start accepts. Automaton has 13 states. Word has length 21 [2018-06-22 11:46:40,816 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:40,817 INFO ]: With dead ends: 86 [2018-06-22 11:46:40,817 INFO ]: Without dead ends: 86 [2018-06-22 11:46:40,817 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:46:40,818 INFO ]: Start minimizeSevpa. Operand 86 states. [2018-06-22 11:46:40,826 INFO ]: Finished minimizeSevpa. Reduced states from 86 to 74. [2018-06-22 11:46:40,826 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-22 11:46:40,827 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 152 transitions. [2018-06-22 11:46:40,827 INFO ]: Start accepts. Automaton has 74 states and 152 transitions. Word has length 21 [2018-06-22 11:46:40,827 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:40,827 INFO ]: Abstraction has 74 states and 152 transitions. [2018-06-22 11:46:40,827 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:40,827 INFO ]: Start isEmpty. Operand 74 states and 152 transitions. [2018-06-22 11:46:40,828 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:40,828 INFO ]: Found error trace [2018-06-22 11:46:40,828 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:40,829 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:40,829 INFO ]: Analyzing trace with hash 1342282953, now seen corresponding path program 1 times [2018-06-22 11:46:40,829 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:40,829 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:40,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:40,829 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:40,829 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:40,836 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:41,114 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:41,114 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:41,114 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:46:41,123 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:41,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:41,138 INFO ]: Computing forward predicates... [2018-06-22 11:46:41,271 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:46:41,292 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:41,292 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2018-06-22 11:46:41,292 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:41,292 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:41,292 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:41,292 INFO ]: Start difference. First operand 74 states and 152 transitions. Second operand 12 states. [2018-06-22 11:46:41,702 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:41,702 INFO ]: Finished difference Result 100 states and 212 transitions. [2018-06-22 11:46:41,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:46:41,704 INFO ]: Start accepts. Automaton has 12 states. Word has length 21 [2018-06-22 11:46:41,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:41,705 INFO ]: With dead ends: 100 [2018-06-22 11:46:41,705 INFO ]: Without dead ends: 100 [2018-06-22 11:46:41,705 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:46:41,705 INFO ]: Start minimizeSevpa. Operand 100 states. [2018-06-22 11:46:41,713 INFO ]: Finished minimizeSevpa. Reduced states from 100 to 70. [2018-06-22 11:46:41,713 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:46:41,713 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 146 transitions. [2018-06-22 11:46:41,714 INFO ]: Start accepts. Automaton has 70 states and 146 transitions. Word has length 21 [2018-06-22 11:46:41,714 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:41,714 INFO ]: Abstraction has 70 states and 146 transitions. [2018-06-22 11:46:41,714 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:41,714 INFO ]: Start isEmpty. Operand 70 states and 146 transitions. [2018-06-22 11:46:41,715 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:46:41,715 INFO ]: Found error trace [2018-06-22 11:46:41,715 INFO ]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:41,715 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:41,715 INFO ]: Analyzing trace with hash -1076579410, now seen corresponding path program 1 times [2018-06-22 11:46:41,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:41,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:41,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:41,717 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:41,717 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:41,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:42,309 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:46:42,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:42,309 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:46:42,321 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:42,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:42,351 INFO ]: Computing forward predicates... [2018-06-22 11:46:42,822 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:46:42,853 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:42,853 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:42,853 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:42,853 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:42,853 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:42,853 INFO ]: Start difference. First operand 70 states and 146 transitions. Second operand 7 states. [2018-06-22 11:46:43,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:43,101 INFO ]: Finished difference Result 153 states and 325 transitions. [2018-06-22 11:46:43,102 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:43,102 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:46:43,102 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:43,104 INFO ]: With dead ends: 153 [2018-06-22 11:46:43,104 INFO ]: Without dead ends: 145 [2018-06-22 11:46:43,104 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:43,104 INFO ]: Start minimizeSevpa. Operand 145 states. [2018-06-22 11:46:43,122 INFO ]: Finished minimizeSevpa. Reduced states from 145 to 101. [2018-06-22 11:46:43,122 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 11:46:43,124 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 240 transitions. [2018-06-22 11:46:43,124 INFO ]: Start accepts. Automaton has 101 states and 240 transitions. Word has length 21 [2018-06-22 11:46:43,124 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:43,124 INFO ]: Abstraction has 101 states and 240 transitions. [2018-06-22 11:46:43,124 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:43,124 INFO ]: Start isEmpty. Operand 101 states and 240 transitions. [2018-06-22 11:46:43,126 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:43,126 INFO ]: Found error trace [2018-06-22 11:46:43,126 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:43,126 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:43,126 INFO ]: Analyzing trace with hash 1214538139, now seen corresponding path program 2 times [2018-06-22 11:46:43,126 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:43,126 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:43,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:43,127 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:43,127 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:43,134 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:43,373 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:43,373 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:43,373 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:46:43,378 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:43,392 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:43,392 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:43,396 INFO ]: Computing forward predicates... [2018-06-22 11:46:43,549 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:46:43,568 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:43,568 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2018-06-22 11:46:43,568 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:43,568 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:43,568 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:43,568 INFO ]: Start difference. First operand 101 states and 240 transitions. Second operand 15 states. [2018-06-22 11:46:44,083 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:44,083 INFO ]: Finished difference Result 121 states and 283 transitions. [2018-06-22 11:46:44,083 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:46:44,083 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:46:44,083 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:44,084 INFO ]: With dead ends: 121 [2018-06-22 11:46:44,084 INFO ]: Without dead ends: 121 [2018-06-22 11:46:44,084 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:46:44,084 INFO ]: Start minimizeSevpa. Operand 121 states. [2018-06-22 11:46:44,095 INFO ]: Finished minimizeSevpa. Reduced states from 121 to 105. [2018-06-22 11:46:44,095 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-22 11:46:44,097 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 245 transitions. [2018-06-22 11:46:44,097 INFO ]: Start accepts. Automaton has 105 states and 245 transitions. Word has length 25 [2018-06-22 11:46:44,097 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:44,097 INFO ]: Abstraction has 105 states and 245 transitions. [2018-06-22 11:46:44,097 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:44,097 INFO ]: Start isEmpty. Operand 105 states and 245 transitions. [2018-06-22 11:46:44,099 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:44,099 INFO ]: Found error trace [2018-06-22 11:46:44,099 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:44,100 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:44,100 INFO ]: Analyzing trace with hash 42025070, now seen corresponding path program 1 times [2018-06-22 11:46:44,100 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:44,100 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:44,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:44,100 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:44,100 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:44,107 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:44,418 INFO ]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:44,418 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:44,418 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:44,418 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:44,419 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:44,419 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:44,419 INFO ]: Start difference. First operand 105 states and 245 transitions. Second operand 4 states. [2018-06-22 11:46:44,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:44,783 INFO ]: Finished difference Result 139 states and 314 transitions. [2018-06-22 11:46:44,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:44,784 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:46:44,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:44,785 INFO ]: With dead ends: 139 [2018-06-22 11:46:44,785 INFO ]: Without dead ends: 116 [2018-06-22 11:46:44,785 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:44,785 INFO ]: Start minimizeSevpa. Operand 116 states. [2018-06-22 11:46:44,797 INFO ]: Finished minimizeSevpa. Reduced states from 116 to 108. [2018-06-22 11:46:44,797 INFO ]: Start removeUnreachable. Operand 108 states. [2018-06-22 11:46:44,799 INFO ]: Finished removeUnreachable. Reduced from 108 states to 108 states and 252 transitions. [2018-06-22 11:46:44,799 INFO ]: Start accepts. Automaton has 108 states and 252 transitions. Word has length 25 [2018-06-22 11:46:44,799 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:44,799 INFO ]: Abstraction has 108 states and 252 transitions. [2018-06-22 11:46:44,799 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:44,799 INFO ]: Start isEmpty. Operand 108 states and 252 transitions. [2018-06-22 11:46:44,801 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:44,801 INFO ]: Found error trace [2018-06-22 11:46:44,801 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:44,801 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:44,801 INFO ]: Analyzing trace with hash 822987878, now seen corresponding path program 1 times [2018-06-22 11:46:44,801 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:44,801 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:44,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:44,803 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:44,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:44,813 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:45,302 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:45,302 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:45,327 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:46:45,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:45,350 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:45,352 INFO ]: Computing forward predicates... [2018-06-22 11:46:45,406 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:45,437 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:45,437 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-22 11:46:45,437 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:46:45,437 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:46:45,437 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:45,437 INFO ]: Start difference. First operand 108 states and 252 transitions. Second operand 13 states. [2018-06-22 11:46:46,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:46,075 INFO ]: Finished difference Result 285 states and 818 transitions. [2018-06-22 11:46:46,075 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:46:46,075 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:46:46,075 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:46,084 INFO ]: With dead ends: 285 [2018-06-22 11:46:46,084 INFO ]: Without dead ends: 257 [2018-06-22 11:46:46,084 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:46:46,084 INFO ]: Start minimizeSevpa. Operand 257 states. [2018-06-22 11:46:46,113 INFO ]: Finished minimizeSevpa. Reduced states from 257 to 199. [2018-06-22 11:46:46,113 INFO ]: Start removeUnreachable. Operand 199 states. [2018-06-22 11:46:46,115 INFO ]: Finished removeUnreachable. Reduced from 199 states to 199 states and 485 transitions. [2018-06-22 11:46:46,115 INFO ]: Start accepts. Automaton has 199 states and 485 transitions. Word has length 25 [2018-06-22 11:46:46,115 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:46,115 INFO ]: Abstraction has 199 states and 485 transitions. [2018-06-22 11:46:46,115 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:46:46,115 INFO ]: Start isEmpty. Operand 199 states and 485 transitions. [2018-06-22 11:46:46,118 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:46,118 INFO ]: Found error trace [2018-06-22 11:46:46,118 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:46,118 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:46,118 INFO ]: Analyzing trace with hash 1514754815, now seen corresponding path program 1 times [2018-06-22 11:46:46,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:46,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:46,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:46,119 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:46,119 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:46,124 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:46,227 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:46,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:46,227 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:46:46,233 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:46,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:46,247 INFO ]: Computing forward predicates... [2018-06-22 11:46:46,265 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:46,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:46,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-22 11:46:46,284 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:46:46,284 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:46:46,284 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:46,284 INFO ]: Start difference. First operand 199 states and 485 transitions. Second operand 8 states. [2018-06-22 11:46:46,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:46,825 INFO ]: Finished difference Result 272 states and 762 transitions. [2018-06-22 11:46:46,825 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:46:46,825 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:46:46,825 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:46,828 INFO ]: With dead ends: 272 [2018-06-22 11:46:46,828 INFO ]: Without dead ends: 266 [2018-06-22 11:46:46,829 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:46,829 INFO ]: Start minimizeSevpa. Operand 266 states. [2018-06-22 11:46:46,864 INFO ]: Finished minimizeSevpa. Reduced states from 266 to 217. [2018-06-22 11:46:46,864 INFO ]: Start removeUnreachable. Operand 217 states. [2018-06-22 11:46:46,866 INFO ]: Finished removeUnreachable. Reduced from 217 states to 217 states and 524 transitions. [2018-06-22 11:46:46,866 INFO ]: Start accepts. Automaton has 217 states and 524 transitions. Word has length 25 [2018-06-22 11:46:46,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:46,867 INFO ]: Abstraction has 217 states and 524 transitions. [2018-06-22 11:46:46,867 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:46:46,867 INFO ]: Start isEmpty. Operand 217 states and 524 transitions. [2018-06-22 11:46:46,869 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:46,869 INFO ]: Found error trace [2018-06-22 11:46:46,869 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:46,869 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:46,869 INFO ]: Analyzing trace with hash 1486470291, now seen corresponding path program 1 times [2018-06-22 11:46:46,869 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:46,869 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:46,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:46,871 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:46,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:46,878 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:46,979 INFO ]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:46:46,979 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:46,979 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:46:46,979 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:46,979 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:46,979 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:46,979 INFO ]: Start difference. First operand 217 states and 524 transitions. Second operand 7 states. [2018-06-22 11:46:47,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:47,052 INFO ]: Finished difference Result 229 states and 538 transitions. [2018-06-22 11:46:47,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:47,052 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:46:47,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:47,054 INFO ]: With dead ends: 229 [2018-06-22 11:46:47,054 INFO ]: Without dead ends: 224 [2018-06-22 11:46:47,054 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:47,054 INFO ]: Start minimizeSevpa. Operand 224 states. [2018-06-22 11:46:47,073 INFO ]: Finished minimizeSevpa. Reduced states from 224 to 196. [2018-06-22 11:46:47,073 INFO ]: Start removeUnreachable. Operand 196 states. [2018-06-22 11:46:47,075 INFO ]: Finished removeUnreachable. Reduced from 196 states to 196 states and 458 transitions. [2018-06-22 11:46:47,075 INFO ]: Start accepts. Automaton has 196 states and 458 transitions. Word has length 25 [2018-06-22 11:46:47,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:47,075 INFO ]: Abstraction has 196 states and 458 transitions. [2018-06-22 11:46:47,075 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:47,075 INFO ]: Start isEmpty. Operand 196 states and 458 transitions. [2018-06-22 11:46:47,077 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:47,077 INFO ]: Found error trace [2018-06-22 11:46:47,077 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:47,077 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:47,078 INFO ]: Analyzing trace with hash 1641683603, now seen corresponding path program 1 times [2018-06-22 11:46:47,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:47,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:47,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:47,079 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:47,079 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:47,085 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:47,179 INFO ]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:46:47,179 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:47,179 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:46:47,187 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:47,200 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:47,201 INFO ]: Computing forward predicates... [2018-06-22 11:46:47,221 INFO ]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-22 11:46:47,240 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:47,240 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-22 11:46:47,240 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:46:47,240 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:46:47,240 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:47,240 INFO ]: Start difference. First operand 196 states and 458 transitions. Second operand 7 states. [2018-06-22 11:46:47,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:47,380 INFO ]: Finished difference Result 216 states and 497 transitions. [2018-06-22 11:46:47,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:47,380 INFO ]: Start accepts. Automaton has 7 states. Word has length 25 [2018-06-22 11:46:47,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:47,382 INFO ]: With dead ends: 216 [2018-06-22 11:46:47,382 INFO ]: Without dead ends: 216 [2018-06-22 11:46:47,383 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:47,383 INFO ]: Start minimizeSevpa. Operand 216 states. [2018-06-22 11:46:47,400 INFO ]: Finished minimizeSevpa. Reduced states from 216 to 186. [2018-06-22 11:46:47,400 INFO ]: Start removeUnreachable. Operand 186 states. [2018-06-22 11:46:47,402 INFO ]: Finished removeUnreachable. Reduced from 186 states to 186 states and 410 transitions. [2018-06-22 11:46:47,402 INFO ]: Start accepts. Automaton has 186 states and 410 transitions. Word has length 25 [2018-06-22 11:46:47,402 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:47,402 INFO ]: Abstraction has 186 states and 410 transitions. [2018-06-22 11:46:47,402 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:46:47,402 INFO ]: Start isEmpty. Operand 186 states and 410 transitions. [2018-06-22 11:46:47,404 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:47,404 INFO ]: Found error trace [2018-06-22 11:46:47,404 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:47,404 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:47,404 INFO ]: Analyzing trace with hash 1303996260, now seen corresponding path program 1 times [2018-06-22 11:46:47,404 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:47,404 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:47,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:47,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:47,405 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:47,411 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:47,657 INFO ]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:46:47,658 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:47,658 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:47,664 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:47,679 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:47,681 INFO ]: Computing forward predicates... [2018-06-22 11:46:47,776 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:46:47,799 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:47,799 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2018-06-22 11:46:47,799 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:47,799 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:47,799 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:47,799 INFO ]: Start difference. First operand 186 states and 410 transitions. Second operand 15 states. [2018-06-22 11:46:48,295 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:48,295 INFO ]: Finished difference Result 274 states and 605 transitions. [2018-06-22 11:46:48,295 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:46:48,295 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:46:48,295 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:48,298 INFO ]: With dead ends: 274 [2018-06-22 11:46:48,298 INFO ]: Without dead ends: 274 [2018-06-22 11:46:48,299 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:46:48,299 INFO ]: Start minimizeSevpa. Operand 274 states. [2018-06-22 11:46:48,319 INFO ]: Finished minimizeSevpa. Reduced states from 274 to 192. [2018-06-22 11:46:48,319 INFO ]: Start removeUnreachable. Operand 192 states. [2018-06-22 11:46:48,321 INFO ]: Finished removeUnreachable. Reduced from 192 states to 192 states and 418 transitions. [2018-06-22 11:46:48,322 INFO ]: Start accepts. Automaton has 192 states and 418 transitions. Word has length 25 [2018-06-22 11:46:48,322 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:48,322 INFO ]: Abstraction has 192 states and 418 transitions. [2018-06-22 11:46:48,322 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:48,322 INFO ]: Start isEmpty. Operand 192 states and 418 transitions. [2018-06-22 11:46:48,324 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:48,324 INFO ]: Found error trace [2018-06-22 11:46:48,324 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:48,324 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:48,324 INFO ]: Analyzing trace with hash 1289853998, now seen corresponding path program 2 times [2018-06-22 11:46:48,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:48,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:48,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:48,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:48,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:48,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:49,068 INFO ]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:46:49,068 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:49,068 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:46:49,075 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:49,096 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:49,096 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:49,098 INFO ]: Computing forward predicates... [2018-06-22 11:46:49,234 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:46:49,253 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:49,253 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2018-06-22 11:46:49,253 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:49,253 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:49,253 INFO ]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:49,254 INFO ]: Start difference. First operand 192 states and 418 transitions. Second operand 15 states. [2018-06-22 11:46:49,805 WARN ]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-22 11:46:50,422 WARN ]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-22 11:46:50,886 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:50,886 INFO ]: Finished difference Result 274 states and 603 transitions. [2018-06-22 11:46:50,886 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:46:50,886 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-22 11:46:50,887 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:50,889 INFO ]: With dead ends: 274 [2018-06-22 11:46:50,889 INFO ]: Without dead ends: 274 [2018-06-22 11:46:50,890 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:46:50,890 INFO ]: Start minimizeSevpa. Operand 274 states. [2018-06-22 11:46:50,906 INFO ]: Finished minimizeSevpa. Reduced states from 274 to 190. [2018-06-22 11:46:50,906 INFO ]: Start removeUnreachable. Operand 190 states. [2018-06-22 11:46:50,908 INFO ]: Finished removeUnreachable. Reduced from 190 states to 190 states and 415 transitions. [2018-06-22 11:46:50,908 INFO ]: Start accepts. Automaton has 190 states and 415 transitions. Word has length 25 [2018-06-22 11:46:50,908 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:50,908 INFO ]: Abstraction has 190 states and 415 transitions. [2018-06-22 11:46:50,908 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:50,908 INFO ]: Start isEmpty. Operand 190 states and 415 transitions. [2018-06-22 11:46:50,910 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:50,910 INFO ]: Found error trace [2018-06-22 11:46:50,910 INFO ]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:50,910 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:50,910 INFO ]: Analyzing trace with hash 1448744410, now seen corresponding path program 3 times [2018-06-22 11:46:50,910 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:50,910 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:50,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:50,911 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:50,911 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:50,918 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:51,552 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:46:51,799 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-22 11:46:52,078 WARN ]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-22 11:46:52,563 INFO ]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:46:52,563 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:52,563 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:52,569 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:46:52,582 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-22 11:46:52,582 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:52,584 INFO ]: Computing forward predicates... [2018-06-22 11:46:52,690 INFO ]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:46:52,709 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:46:52,709 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2018-06-22 11:46:52,709 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:46:52,710 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:46:52,710 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:46:52,710 INFO ]: Start difference. First operand 190 states and 415 transitions. Second operand 14 states. [2018-06-22 11:46:53,003 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:53,003 INFO ]: Finished difference Result 224 states and 455 transitions. [2018-06-22 11:46:53,003 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:53,003 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:46:53,003 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:53,005 INFO ]: With dead ends: 224 [2018-06-22 11:46:53,005 INFO ]: Without dead ends: 214 [2018-06-22 11:46:53,005 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:46:53,005 INFO ]: Start minimizeSevpa. Operand 214 states. [2018-06-22 11:46:53,021 INFO ]: Finished minimizeSevpa. Reduced states from 214 to 174. [2018-06-22 11:46:53,021 INFO ]: Start removeUnreachable. Operand 174 states. [2018-06-22 11:46:53,022 INFO ]: Finished removeUnreachable. Reduced from 174 states to 174 states and 370 transitions. [2018-06-22 11:46:53,022 INFO ]: Start accepts. Automaton has 174 states and 370 transitions. Word has length 25 [2018-06-22 11:46:53,022 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:53,022 INFO ]: Abstraction has 174 states and 370 transitions. [2018-06-22 11:46:53,022 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:46:53,022 INFO ]: Start isEmpty. Operand 174 states and 370 transitions. [2018-06-22 11:46:53,025 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:53,025 INFO ]: Found error trace [2018-06-22 11:46:53,025 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:53,025 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:53,025 INFO ]: Analyzing trace with hash -1731641015, now seen corresponding path program 1 times [2018-06-22 11:46:53,025 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:53,025 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:53,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:53,026 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:53,026 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:53,036 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:53,468 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:53,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:53,468 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:53,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:53,488 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:53,490 INFO ]: Computing forward predicates... [2018-06-22 11:46:53,583 INFO ]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:46:53,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:53,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-06-22 11:46:53,602 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:46:53,602 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:46:53,602 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:46:53,602 INFO ]: Start difference. First operand 174 states and 370 transitions. Second operand 14 states. [2018-06-22 11:46:53,837 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:53,837 INFO ]: Finished difference Result 188 states and 396 transitions. [2018-06-22 11:46:53,837 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:53,837 INFO ]: Start accepts. Automaton has 14 states. Word has length 25 [2018-06-22 11:46:53,837 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:53,839 INFO ]: With dead ends: 188 [2018-06-22 11:46:53,839 INFO ]: Without dead ends: 187 [2018-06-22 11:46:53,839 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:46:53,839 INFO ]: Start minimizeSevpa. Operand 187 states. [2018-06-22 11:46:53,851 INFO ]: Finished minimizeSevpa. Reduced states from 187 to 173. [2018-06-22 11:46:53,851 INFO ]: Start removeUnreachable. Operand 173 states. [2018-06-22 11:46:53,853 INFO ]: Finished removeUnreachable. Reduced from 173 states to 173 states and 366 transitions. [2018-06-22 11:46:53,853 INFO ]: Start accepts. Automaton has 173 states and 366 transitions. Word has length 25 [2018-06-22 11:46:53,853 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:53,853 INFO ]: Abstraction has 173 states and 366 transitions. [2018-06-22 11:46:53,853 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:46:53,853 INFO ]: Start isEmpty. Operand 173 states and 366 transitions. [2018-06-22 11:46:53,855 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:46:53,855 INFO ]: Found error trace [2018-06-22 11:46:53,855 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:53,855 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:53,856 INFO ]: Analyzing trace with hash -584947585, now seen corresponding path program 2 times [2018-06-22 11:46:53,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:53,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:53,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:53,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:53,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:53,861 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:54,141 INFO ]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:54,141 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:54,141 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:54,148 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:54,162 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:54,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:54,163 INFO ]: Computing forward predicates... [2018-06-22 11:46:54,181 INFO ]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:54,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:54,214 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-06-22 11:46:54,214 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:46:54,214 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:46:54,214 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:54,214 INFO ]: Start difference. First operand 173 states and 366 transitions. Second operand 8 states. [2018-06-22 11:46:54,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:54,505 INFO ]: Finished difference Result 159 states and 294 transitions. [2018-06-22 11:46:54,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:46:54,505 INFO ]: Start accepts. Automaton has 8 states. Word has length 25 [2018-06-22 11:46:54,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:54,506 INFO ]: With dead ends: 159 [2018-06-22 11:46:54,506 INFO ]: Without dead ends: 109 [2018-06-22 11:46:54,506 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:46:54,506 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 11:46:54,510 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-06-22 11:46:54,511 INFO ]: Start removeUnreachable. Operand 101 states. [2018-06-22 11:46:54,511 INFO ]: Finished removeUnreachable. Reduced from 101 states to 101 states and 186 transitions. [2018-06-22 11:46:54,511 INFO ]: Start accepts. Automaton has 101 states and 186 transitions. Word has length 25 [2018-06-22 11:46:54,511 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:54,511 INFO ]: Abstraction has 101 states and 186 transitions. [2018-06-22 11:46:54,511 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:46:54,511 INFO ]: Start isEmpty. Operand 101 states and 186 transitions. [2018-06-22 11:46:54,512 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:54,512 INFO ]: Found error trace [2018-06-22 11:46:54,512 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:54,512 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:54,513 INFO ]: Analyzing trace with hash 379980161, now seen corresponding path program 1 times [2018-06-22 11:46:54,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:54,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:54,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:54,513 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:54,513 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:54,526 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:54,906 INFO ]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:46:54,906 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:54,906 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:54,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:54,928 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:54,931 INFO ]: Computing forward predicates... [2018-06-22 11:46:55,005 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:55,024 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:55,024 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-06-22 11:46:55,024 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:55,024 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:55,024 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:55,024 INFO ]: Start difference. First operand 101 states and 186 transitions. Second operand 15 states. [2018-06-22 11:46:55,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:55,348 INFO ]: Finished difference Result 111 states and 206 transitions. [2018-06-22 11:46:55,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:46:55,348 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 11:46:55,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:55,349 INFO ]: With dead ends: 111 [2018-06-22 11:46:55,349 INFO ]: Without dead ends: 109 [2018-06-22 11:46:55,349 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:46:55,349 INFO ]: Start minimizeSevpa. Operand 109 states. [2018-06-22 11:46:55,354 INFO ]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-06-22 11:46:55,354 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-22 11:46:55,355 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 182 transitions. [2018-06-22 11:46:55,355 INFO ]: Start accepts. Automaton has 99 states and 182 transitions. Word has length 29 [2018-06-22 11:46:55,355 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:55,355 INFO ]: Abstraction has 99 states and 182 transitions. [2018-06-22 11:46:55,355 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:55,355 INFO ]: Start isEmpty. Operand 99 states and 182 transitions. [2018-06-22 11:46:55,355 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:55,355 INFO ]: Found error trace [2018-06-22 11:46:55,356 INFO ]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:55,356 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:55,356 INFO ]: Analyzing trace with hash -1625041515, now seen corresponding path program 1 times [2018-06-22 11:46:55,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:55,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:55,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:55,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:55,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:55,364 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:55,519 INFO ]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:46:55,519 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:55,519 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:55,524 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:55,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:55,542 INFO ]: Computing forward predicates... [2018-06-22 11:46:55,972 INFO ]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:55,991 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:56,021 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-06-22 11:46:56,021 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:46:56,021 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:46:56,021 INFO ]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:56,022 INFO ]: Start difference. First operand 99 states and 182 transitions. Second operand 15 states. [2018-06-22 11:46:56,300 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:56,300 INFO ]: Finished difference Result 107 states and 198 transitions. [2018-06-22 11:46:56,300 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:46:56,300 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-22 11:46:56,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:56,301 INFO ]: With dead ends: 107 [2018-06-22 11:46:56,301 INFO ]: Without dead ends: 98 [2018-06-22 11:46:56,301 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:46:56,301 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-22 11:46:56,305 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 90. [2018-06-22 11:46:56,305 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-22 11:46:56,306 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 155 transitions. [2018-06-22 11:46:56,306 INFO ]: Start accepts. Automaton has 90 states and 155 transitions. Word has length 29 [2018-06-22 11:46:56,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:56,306 INFO ]: Abstraction has 90 states and 155 transitions. [2018-06-22 11:46:56,306 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:46:56,306 INFO ]: Start isEmpty. Operand 90 states and 155 transitions. [2018-06-22 11:46:56,307 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:56,307 INFO ]: Found error trace [2018-06-22 11:46:56,307 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:56,307 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:56,307 INFO ]: Analyzing trace with hash -628363288, now seen corresponding path program 2 times [2018-06-22 11:46:56,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:56,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:56,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:56,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:56,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:56,314 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:56,425 INFO ]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:46:56,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:56,425 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:56,430 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:46:56,448 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:46:56,448 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:56,450 INFO ]: Computing forward predicates... [2018-06-22 11:46:56,587 INFO ]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:56,620 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:56,620 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-06-22 11:46:56,620 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:46:56,620 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:46:56,620 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:46:56,621 INFO ]: Start difference. First operand 90 states and 155 transitions. Second operand 11 states. [2018-06-22 11:46:57,193 WARN ]: Spent 319.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-06-22 11:46:57,669 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:57,669 INFO ]: Finished difference Result 132 states and 229 transitions. [2018-06-22 11:46:57,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:46:57,669 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-22 11:46:57,670 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:57,670 INFO ]: With dead ends: 132 [2018-06-22 11:46:57,670 INFO ]: Without dead ends: 132 [2018-06-22 11:46:57,671 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:57,671 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-22 11:46:57,676 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 94. [2018-06-22 11:46:57,676 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 11:46:57,677 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 165 transitions. [2018-06-22 11:46:57,677 INFO ]: Start accepts. Automaton has 94 states and 165 transitions. Word has length 29 [2018-06-22 11:46:57,677 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:57,677 INFO ]: Abstraction has 94 states and 165 transitions. [2018-06-22 11:46:57,677 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:46:57,677 INFO ]: Start isEmpty. Operand 94 states and 165 transitions. [2018-06-22 11:46:57,678 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:57,678 INFO ]: Found error trace [2018-06-22 11:46:57,678 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:57,678 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:57,678 INFO ]: Analyzing trace with hash 670846494, now seen corresponding path program 1 times [2018-06-22 11:46:57,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:57,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:57,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:57,678 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:46:57,678 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:57,685 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:58,044 INFO ]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:46:58,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:58,044 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:58,050 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:58,066 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:58,068 INFO ]: Computing forward predicates... [2018-06-22 11:46:58,568 INFO ]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:46:58,598 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:58,598 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-06-22 11:46:58,598 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:46:58,598 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:46:58,598 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:46:58,598 INFO ]: Start difference. First operand 94 states and 165 transitions. Second operand 17 states. [2018-06-22 11:46:59,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:59,622 INFO ]: Finished difference Result 255 states and 458 transitions. [2018-06-22 11:46:59,622 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-22 11:46:59,622 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-22 11:46:59,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:59,623 INFO ]: With dead ends: 255 [2018-06-22 11:46:59,623 INFO ]: Without dead ends: 251 [2018-06-22 11:46:59,623 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=344, Invalid=2106, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:46:59,624 INFO ]: Start minimizeSevpa. Operand 251 states. [2018-06-22 11:46:59,634 INFO ]: Finished minimizeSevpa. Reduced states from 251 to 131. [2018-06-22 11:46:59,634 INFO ]: Start removeUnreachable. Operand 131 states. [2018-06-22 11:46:59,635 INFO ]: Finished removeUnreachable. Reduced from 131 states to 131 states and 237 transitions. [2018-06-22 11:46:59,635 INFO ]: Start accepts. Automaton has 131 states and 237 transitions. Word has length 29 [2018-06-22 11:46:59,635 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:59,635 INFO ]: Abstraction has 131 states and 237 transitions. [2018-06-22 11:46:59,635 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:46:59,635 INFO ]: Start isEmpty. Operand 131 states and 237 transitions. [2018-06-22 11:46:59,636 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:46:59,636 INFO ]: Found error trace [2018-06-22 11:46:59,636 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:59,636 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:59,637 INFO ]: Analyzing trace with hash 691283512, now seen corresponding path program 2 times [2018-06-22 11:46:59,637 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:59,637 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:59,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:59,637 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:59,637 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:59,644 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:00,898 INFO ]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:47:00,898 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:00,898 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:47:00,907 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:00,953 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:00,953 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:00,956 INFO ]: Computing forward predicates... [2018-06-22 11:47:01,149 WARN ]: Array PQE input equivalent to false [2018-06-22 11:47:01,149 INFO ]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-06-22 11:47:01,174 INFO ]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-22 11:47:01,174 INFO ]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-06-22 11:47:01,175 INFO ]: Checked inductivity of 23 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-22 11:47:01,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:01,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-22 11:47:01,194 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:47:01,194 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:47:01,194 INFO ]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:47:01,194 INFO ]: Start difference. First operand 131 states and 237 transitions. Second operand 17 states. [2018-06-22 11:47:01,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:01,811 INFO ]: Finished difference Result 193 states and 325 transitions. [2018-06-22 11:47:01,812 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:47:01,812 INFO ]: Start accepts. Automaton has 17 states. Word has length 29 [2018-06-22 11:47:01,812 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:01,812 INFO ]: With dead ends: 193 [2018-06-22 11:47:01,812 INFO ]: Without dead ends: 137 [2018-06-22 11:47:01,813 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=1275, Unknown=0, NotChecked=0, Total=1482 [2018-06-22 11:47:01,813 INFO ]: Start minimizeSevpa. Operand 137 states. [2018-06-22 11:47:01,819 INFO ]: Finished minimizeSevpa. Reduced states from 137 to 111. [2018-06-22 11:47:01,819 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-22 11:47:01,819 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 207 transitions. [2018-06-22 11:47:01,819 INFO ]: Start accepts. Automaton has 111 states and 207 transitions. Word has length 29 [2018-06-22 11:47:01,820 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:01,820 INFO ]: Abstraction has 111 states and 207 transitions. [2018-06-22 11:47:01,820 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:47:01,820 INFO ]: Start isEmpty. Operand 111 states and 207 transitions. [2018-06-22 11:47:01,820 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:47:01,820 INFO ]: Found error trace [2018-06-22 11:47:01,820 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:01,821 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:01,821 INFO ]: Analyzing trace with hash 178497549, now seen corresponding path program 1 times [2018-06-22 11:47:01,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:01,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:01,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:01,821 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:01,821 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:01,828 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:02,101 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:47:02,101 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:02,101 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:47:02,107 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:02,126 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:02,128 INFO ]: Computing forward predicates... [2018-06-22 11:47:02,223 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:47:02,241 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:02,241 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-22 11:47:02,241 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:47:02,241 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:47:02,241 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:47:02,242 INFO ]: Start difference. First operand 111 states and 207 transitions. Second operand 14 states. [2018-06-22 11:47:02,854 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:02,854 INFO ]: Finished difference Result 275 states and 490 transitions. [2018-06-22 11:47:02,854 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-22 11:47:02,854 INFO ]: Start accepts. Automaton has 14 states. Word has length 33 [2018-06-22 11:47:02,854 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:02,856 INFO ]: With dead ends: 275 [2018-06-22 11:47:02,856 INFO ]: Without dead ends: 267 [2018-06-22 11:47:02,856 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:47:02,856 INFO ]: Start minimizeSevpa. Operand 267 states. [2018-06-22 11:47:02,865 INFO ]: Finished minimizeSevpa. Reduced states from 267 to 121. [2018-06-22 11:47:02,865 INFO ]: Start removeUnreachable. Operand 121 states. [2018-06-22 11:47:02,866 INFO ]: Finished removeUnreachable. Reduced from 121 states to 121 states and 245 transitions. [2018-06-22 11:47:02,866 INFO ]: Start accepts. Automaton has 121 states and 245 transitions. Word has length 33 [2018-06-22 11:47:02,866 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:02,866 INFO ]: Abstraction has 121 states and 245 transitions. [2018-06-22 11:47:02,866 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:47:02,866 INFO ]: Start isEmpty. Operand 121 states and 245 transitions. [2018-06-22 11:47:02,867 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:47:02,867 INFO ]: Found error trace [2018-06-22 11:47:02,867 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:02,867 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:02,867 INFO ]: Analyzing trace with hash -1172208435, now seen corresponding path program 1 times [2018-06-22 11:47:02,867 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:02,867 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:02,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:02,868 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:02,868 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:02,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:03,008 INFO ]: Checked inductivity of 35 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:47:03,008 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:03,008 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:47:03,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:03,031 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:03,034 INFO ]: Computing forward predicates... [2018-06-22 11:47:03,135 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:47:03,161 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:03,161 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-06-22 11:47:03,161 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:47:03,161 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:47:03,161 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:47:03,161 INFO ]: Start difference. First operand 121 states and 245 transitions. Second operand 18 states. [2018-06-22 11:47:04,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:04,486 INFO ]: Finished difference Result 277 states and 542 transitions. [2018-06-22 11:47:04,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-22 11:47:04,487 INFO ]: Start accepts. Automaton has 18 states. Word has length 33 [2018-06-22 11:47:04,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:04,488 INFO ]: With dead ends: 277 [2018-06-22 11:47:04,488 INFO ]: Without dead ends: 265 [2018-06-22 11:47:04,489 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=2702, Unknown=0, NotChecked=0, Total=3080 [2018-06-22 11:47:04,489 INFO ]: Start minimizeSevpa. Operand 265 states. [2018-06-22 11:47:04,499 INFO ]: Finished minimizeSevpa. Reduced states from 265 to 125. [2018-06-22 11:47:04,499 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-22 11:47:04,500 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 241 transitions. [2018-06-22 11:47:04,500 INFO ]: Start accepts. Automaton has 125 states and 241 transitions. Word has length 33 [2018-06-22 11:47:04,500 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:04,500 INFO ]: Abstraction has 125 states and 241 transitions. [2018-06-22 11:47:04,500 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:47:04,500 INFO ]: Start isEmpty. Operand 125 states and 241 transitions. [2018-06-22 11:47:04,501 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:47:04,501 INFO ]: Found error trace [2018-06-22 11:47:04,501 INFO ]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:04,501 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:04,501 INFO ]: Analyzing trace with hash -949240755, now seen corresponding path program 2 times [2018-06-22 11:47:04,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:04,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:04,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:04,502 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:47:04,502 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:04,509 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:04,653 INFO ]: Checked inductivity of 35 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-06-22 11:47:04,653 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:04,653 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:04,659 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:04,678 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:04,678 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:04,680 INFO ]: Computing forward predicates... [2018-06-22 11:47:04,749 INFO ]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:47:04,767 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:04,767 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 13 [2018-06-22 11:47:04,767 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:47:04,767 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:47:04,767 INFO ]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:47:04,767 INFO ]: Start difference. First operand 125 states and 241 transitions. Second operand 13 states. [2018-06-22 11:47:05,043 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:05,043 INFO ]: Finished difference Result 237 states and 429 transitions. [2018-06-22 11:47:05,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:47:05,043 INFO ]: Start accepts. Automaton has 13 states. Word has length 33 [2018-06-22 11:47:05,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:05,044 INFO ]: With dead ends: 237 [2018-06-22 11:47:05,044 INFO ]: Without dead ends: 231 [2018-06-22 11:47:05,045 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:47:05,045 INFO ]: Start minimizeSevpa. Operand 231 states. [2018-06-22 11:47:05,052 INFO ]: Finished minimizeSevpa. Reduced states from 231 to 125. [2018-06-22 11:47:05,052 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-22 11:47:05,052 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 240 transitions. [2018-06-22 11:47:05,053 INFO ]: Start accepts. Automaton has 125 states and 240 transitions. Word has length 33 [2018-06-22 11:47:05,053 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:05,053 INFO ]: Abstraction has 125 states and 240 transitions. [2018-06-22 11:47:05,053 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:47:05,053 INFO ]: Start isEmpty. Operand 125 states and 240 transitions. [2018-06-22 11:47:05,054 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:47:05,054 INFO ]: Found error trace [2018-06-22 11:47:05,054 INFO ]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:05,054 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:05,054 INFO ]: Analyzing trace with hash -989680992, now seen corresponding path program 2 times [2018-06-22 11:47:05,054 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:05,054 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:05,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:05,054 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:05,054 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:05,063 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:05,454 INFO ]: Checked inductivity of 37 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:47:05,454 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:05,454 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:47:05,459 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:05,481 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:05,481 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:05,484 INFO ]: Computing forward predicates... [2018-06-22 11:47:05,604 INFO ]: Checked inductivity of 37 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:47:05,623 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:05,623 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-22 11:47:05,623 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:47:05,623 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:47:05,624 INFO ]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:47:05,624 INFO ]: Start difference. First operand 125 states and 240 transitions. Second operand 18 states. [2018-06-22 11:47:06,825 WARN ]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-06-22 11:47:07,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:07,436 INFO ]: Finished difference Result 281 states and 501 transitions. [2018-06-22 11:47:07,436 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-06-22 11:47:07,436 INFO ]: Start accepts. Automaton has 18 states. Word has length 33 [2018-06-22 11:47:07,436 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:07,438 INFO ]: With dead ends: 281 [2018-06-22 11:47:07,438 INFO ]: Without dead ends: 255 [2018-06-22 11:47:07,439 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=413, Invalid=2557, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:47:07,439 INFO ]: Start minimizeSevpa. Operand 255 states. [2018-06-22 11:47:07,448 INFO ]: Finished minimizeSevpa. Reduced states from 255 to 135. [2018-06-22 11:47:07,448 INFO ]: Start removeUnreachable. Operand 135 states. [2018-06-22 11:47:07,449 INFO ]: Finished removeUnreachable. Reduced from 135 states to 135 states and 248 transitions. [2018-06-22 11:47:07,449 INFO ]: Start accepts. Automaton has 135 states and 248 transitions. Word has length 33 [2018-06-22 11:47:07,449 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:07,449 INFO ]: Abstraction has 135 states and 248 transitions. [2018-06-22 11:47:07,449 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:47:07,449 INFO ]: Start isEmpty. Operand 135 states and 248 transitions. [2018-06-22 11:47:07,450 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:47:07,450 INFO ]: Found error trace [2018-06-22 11:47:07,450 INFO ]: trace histogram [7, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:07,450 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:07,450 INFO ]: Analyzing trace with hash 1008240539, now seen corresponding path program 2 times [2018-06-22 11:47:07,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:07,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:07,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:07,451 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:07,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:07,473 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:07,644 INFO ]: Checked inductivity of 73 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-06-22 11:47:07,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:07,644 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:47:07,650 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:07,674 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:07,674 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:07,678 INFO ]: Computing forward predicates... [2018-06-22 11:47:07,910 INFO ]: Checked inductivity of 73 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-06-22 11:47:07,929 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:07,929 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-06-22 11:47:07,929 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:47:07,929 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:47:07,930 INFO ]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:47:07,930 INFO ]: Start difference. First operand 135 states and 248 transitions. Second operand 25 states. [2018-06-22 11:47:08,853 WARN ]: Spent 210.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-06-22 11:47:13,035 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:13,035 INFO ]: Finished difference Result 661 states and 1510 transitions. [2018-06-22 11:47:13,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-06-22 11:47:13,035 INFO ]: Start accepts. Automaton has 25 states. Word has length 41 [2018-06-22 11:47:13,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:13,039 INFO ]: With dead ends: 661 [2018-06-22 11:47:13,039 INFO ]: Without dead ends: 629 [2018-06-22 11:47:13,041 INFO ]: 0 DeclaredPredicates, 141 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2957 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1104, Invalid=9196, Unknown=2, NotChecked=0, Total=10302 [2018-06-22 11:47:13,041 INFO ]: Start minimizeSevpa. Operand 629 states. [2018-06-22 11:47:13,073 INFO ]: Finished minimizeSevpa. Reduced states from 629 to 292. [2018-06-22 11:47:13,073 INFO ]: Start removeUnreachable. Operand 292 states. [2018-06-22 11:47:13,075 INFO ]: Finished removeUnreachable. Reduced from 292 states to 292 states and 689 transitions. [2018-06-22 11:47:13,075 INFO ]: Start accepts. Automaton has 292 states and 689 transitions. Word has length 41 [2018-06-22 11:47:13,075 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:13,075 INFO ]: Abstraction has 292 states and 689 transitions. [2018-06-22 11:47:13,075 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:47:13,075 INFO ]: Start isEmpty. Operand 292 states and 689 transitions. [2018-06-22 11:47:13,077 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:47:13,077 INFO ]: Found error trace [2018-06-22 11:47:13,077 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:13,077 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:13,078 INFO ]: Analyzing trace with hash -1069816251, now seen corresponding path program 2 times [2018-06-22 11:47:13,078 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:13,078 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:13,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:13,078 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:13,078 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:13,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:13,356 INFO ]: Checked inductivity of 52 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:47:13,356 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:13,356 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:47:13,362 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:13,384 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:13,384 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:13,387 INFO ]: Computing forward predicates... [2018-06-22 11:47:13,505 INFO ]: Checked inductivity of 52 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:47:13,524 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:13,524 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 16 [2018-06-22 11:47:13,524 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:47:13,524 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:47:13,524 INFO ]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:47:13,524 INFO ]: Start difference. First operand 292 states and 689 transitions. Second operand 16 states. [2018-06-22 11:47:14,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:14,042 INFO ]: Finished difference Result 512 states and 1096 transitions. [2018-06-22 11:47:14,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-22 11:47:14,042 INFO ]: Start accepts. Automaton has 16 states. Word has length 37 [2018-06-22 11:47:14,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:14,045 INFO ]: With dead ends: 512 [2018-06-22 11:47:14,045 INFO ]: Without dead ends: 496 [2018-06-22 11:47:14,045 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:47:14,046 INFO ]: Start minimizeSevpa. Operand 496 states. [2018-06-22 11:47:14,066 INFO ]: Finished minimizeSevpa. Reduced states from 496 to 294. [2018-06-22 11:47:14,066 INFO ]: Start removeUnreachable. Operand 294 states. [2018-06-22 11:47:14,068 INFO ]: Finished removeUnreachable. Reduced from 294 states to 294 states and 683 transitions. [2018-06-22 11:47:14,068 INFO ]: Start accepts. Automaton has 294 states and 683 transitions. Word has length 37 [2018-06-22 11:47:14,068 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:14,068 INFO ]: Abstraction has 294 states and 683 transitions. [2018-06-22 11:47:14,068 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:47:14,068 INFO ]: Start isEmpty. Operand 294 states and 683 transitions. [2018-06-22 11:47:14,070 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:47:14,070 INFO ]: Found error trace [2018-06-22 11:47:14,070 INFO ]: trace histogram [6, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:14,070 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:14,070 INFO ]: Analyzing trace with hash -1679287675, now seen corresponding path program 3 times [2018-06-22 11:47:14,070 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:14,070 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:14,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:14,072 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:14,072 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:14,082 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:14,329 INFO ]: Checked inductivity of 52 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:47:14,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:14,330 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:47:14,335 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:47:14,358 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:47:14,358 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:14,361 INFO ]: Computing forward predicates... [2018-06-22 11:47:14,602 INFO ]: Checked inductivity of 52 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:47:14,621 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:14,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 17 [2018-06-22 11:47:14,621 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:47:14,621 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:47:14,621 INFO ]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:47:14,621 INFO ]: Start difference. First operand 294 states and 683 transitions. Second operand 17 states. [2018-06-22 11:47:15,099 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:15,099 INFO ]: Finished difference Result 438 states and 966 transitions. [2018-06-22 11:47:15,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:47:15,099 INFO ]: Start accepts. Automaton has 17 states. Word has length 37 [2018-06-22 11:47:15,100 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:15,102 INFO ]: With dead ends: 438 [2018-06-22 11:47:15,102 INFO ]: Without dead ends: 426 [2018-06-22 11:47:15,102 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:47:15,102 INFO ]: Start minimizeSevpa. Operand 426 states. [2018-06-22 11:47:15,116 INFO ]: Finished minimizeSevpa. Reduced states from 426 to 288. [2018-06-22 11:47:15,116 INFO ]: Start removeUnreachable. Operand 288 states. [2018-06-22 11:47:15,118 INFO ]: Finished removeUnreachable. Reduced from 288 states to 288 states and 666 transitions. [2018-06-22 11:47:15,118 INFO ]: Start accepts. Automaton has 288 states and 666 transitions. Word has length 37 [2018-06-22 11:47:15,118 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:15,118 INFO ]: Abstraction has 288 states and 666 transitions. [2018-06-22 11:47:15,118 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:47:15,118 INFO ]: Start isEmpty. Operand 288 states and 666 transitions. [2018-06-22 11:47:15,119 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:47:15,119 INFO ]: Found error trace [2018-06-22 11:47:15,119 INFO ]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:15,119 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:15,120 INFO ]: Analyzing trace with hash -307654414, now seen corresponding path program 3 times [2018-06-22 11:47:15,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:15,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:15,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:15,120 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:15,120 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:15,127 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:15,343 INFO ]: Checked inductivity of 51 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:47:15,343 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:15,343 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:15,349 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:47:15,369 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:47:15,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:15,370 INFO ]: Computing forward predicates... [2018-06-22 11:47:15,434 INFO ]: Checked inductivity of 51 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:47:15,469 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:15,469 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4] total 15 [2018-06-22 11:47:15,469 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:47:15,469 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:47:15,469 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:47:15,469 INFO ]: Start difference. First operand 288 states and 666 transitions. Second operand 15 states. [2018-06-22 11:47:16,822 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:47:16,822 INFO ]: Finished difference Result 311 states and 524 transitions. [2018-06-22 11:47:16,822 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:47:16,822 INFO ]: Start accepts. Automaton has 15 states. Word has length 37 [2018-06-22 11:47:16,822 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:47:16,823 INFO ]: With dead ends: 311 [2018-06-22 11:47:16,823 INFO ]: Without dead ends: 182 [2018-06-22 11:47:16,823 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=393, Invalid=1769, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:47:16,824 INFO ]: Start minimizeSevpa. Operand 182 states. [2018-06-22 11:47:16,829 INFO ]: Finished minimizeSevpa. Reduced states from 182 to 134. [2018-06-22 11:47:16,829 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-22 11:47:16,830 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 216 transitions. [2018-06-22 11:47:16,830 INFO ]: Start accepts. Automaton has 134 states and 216 transitions. Word has length 37 [2018-06-22 11:47:16,830 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:47:16,830 INFO ]: Abstraction has 134 states and 216 transitions. [2018-06-22 11:47:16,830 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:47:16,830 INFO ]: Start isEmpty. Operand 134 states and 216 transitions. [2018-06-22 11:47:16,831 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:47:16,831 INFO ]: Found error trace [2018-06-22 11:47:16,831 INFO ]: trace histogram [7, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:47:16,831 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:47:16,831 INFO ]: Analyzing trace with hash 853359569, now seen corresponding path program 2 times [2018-06-22 11:47:16,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:47:16,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:47:16,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:16,832 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:47:16,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:47:16,841 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:17,295 INFO ]: Checked inductivity of 73 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-22 11:47:17,295 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:47:17,295 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:47:17,301 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:47:17,324 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:47:17,324 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:47:17,327 INFO ]: Computing forward predicates... [2018-06-22 11:47:17,463 INFO ]: Checked inductivity of 73 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:47:17,482 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:47:17,482 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-06-22 11:47:17,482 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:47:17,482 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:47:17,482 INFO ]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:47:17,482 INFO ]: Start difference. First operand 134 states and 216 transitions. Second operand 21 states. Received shutdown request... [2018-06-22 11:47:18,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-22 11:47:18,208 WARN ]: Verification canceled [2018-06-22 11:47:18,211 WARN ]: Timeout [2018-06-22 11:47:18,212 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:47:18 BoogieIcfgContainer [2018-06-22 11:47:18,212 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:47:18,212 INFO ]: Toolchain (without parser) took 53825.75 ms. Allocated memory was 309.3 MB in the beginning and 792.7 MB in the end (delta: 483.4 MB). Free memory was 263.7 MB in the beginning and 727.0 MB in the end (delta: -463.3 MB). Peak memory consumption was 20.1 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:18,213 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:47:18,213 INFO ]: ChcToBoogie took 50.85 ms. Allocated memory is still 309.3 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:47:18,213 INFO ]: Boogie Preprocessor took 46.96 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.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:47:18,214 INFO ]: RCFGBuilder took 441.78 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:18,214 INFO ]: TraceAbstraction took 53277.19 ms. Allocated memory was 309.3 MB in the beginning and 792.7 MB in the end (delta: 483.4 MB). Free memory was 247.8 MB in the beginning and 727.0 MB in the end (delta: -479.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:47:18,216 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 50.85 ms. Allocated memory is still 309.3 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.96 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 441.78 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53277.19 ms. Allocated memory was 309.3 MB in the beginning and 792.7 MB in the end (delta: 483.4 MB). Free memory was 247.8 MB in the beginning and 727.0 MB in the end (delta: -479.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (134states) and interpolant automaton (currently 33 states, 21 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 42 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. TIMEOUT Result, 53.2s OverallTime, 48 OverallIterations, 7 TraceHistogramMax, 30.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1491 SDtfs, 441 SDslu, 8044 SDs, 0 SdLazy, 17749 SolverSat, 1663 SolverUnsat, 64 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1877 GetRequests, 827 SyntacticMatches, 140 SemanticMatches, 909 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7040 ImplicationChecksByTransitivity, 28.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=45, 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.6s AutomataMinimizationTime, 47 MinimizatonAttempts, 2234 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 2100 NumberOfCodeBlocks, 2092 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 2016 ConstructedInterpolants, 12 QuantifiedInterpolants, 337648 SizeOfPredicates, 307 NumberOfNonLiveVariables, 5332 ConjunctsInSsa, 1928 ConjunctsInUnsatCore, 84 InterpolantComputations, 13 PerfectInterpolantSequences, 844/1624 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strpbrk_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-47-18-225.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strpbrk_1.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-47-18-225.csv Completed graceful shutdown