java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_3.array.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:46:06,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:46:06,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:46:06,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:46:06,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:46:06,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:46:06,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:46:06,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:46:06,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:46:06,425 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:46:06,426 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:46:06,426 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:46:06,427 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:46:06,428 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:46:06,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:46:06,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:46:06,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:46:06,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:46:06,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:46:06,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:46:06,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:46:06,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:46:06,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:46:06,453 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:46:06,454 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:46:06,455 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:46:06,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:46:06,463 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:46:06,464 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:46:06,464 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:46:06,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:46:06,465 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:46:06,465 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:46:06,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:46:06,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:46:06,467 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:06,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:46:06,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:46:06,483 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:46:06,483 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:46:06,484 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:46:06,484 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:46:06,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:46:06,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:46:06,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:46:06,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:46:06,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:46:06,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:46:06,486 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:46:06,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:46:06,486 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:46:06,486 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:46:06,487 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:46:06,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:46:06,487 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:46:06,488 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:46:06,488 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:46:06,530 INFO ]: Repository-Root is: /tmp [2018-06-22 11:46:06,549 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:46:06,555 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:46:06,556 INFO ]: Initializing SmtParser... [2018-06-22 11:46:06,557 INFO ]: SmtParser initialized [2018-06-22 11:46:06,559 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_3.array.smt2 [2018-06-22 11:46:06,560 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:06,650 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_3.array.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@209ff94e [2018-06-22 11:46:06,986 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/arrays/libc__strncmp_3.array.smt2 [2018-06-22 11:46:06,991 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:46:06,996 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:46:06,996 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:46:06,996 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:46:06,996 INFO ]: ChcToBoogie initialized [2018-06-22 11:46:07,000 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:46:06" (1/1) ... [2018-06-22 11:46:07,057 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07 Unit [2018-06-22 11:46:07,057 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:46:07,058 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:46:07,058 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:46:07,058 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:46:07,088 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07" (1/1) ... [2018-06-22 11:46:07,088 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07" (1/1) ... [2018-06-22 11:46:07,097 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07" (1/1) ... [2018-06-22 11:46:07,097 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07" (1/1) ... [2018-06-22 11:46:07,103 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07" (1/1) ... [2018-06-22 11:46:07,106 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07" (1/1) ... [2018-06-22 11:46:07,113 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07" (1/1) ... [2018-06-22 11:46:07,115 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:46:07,116 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:46:07,116 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:46:07,116 INFO ]: RCFGBuilder initialized [2018-06-22 11:46:07,117 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07" (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:07,145 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:46:07,145 INFO ]: Found specification of procedure False [2018-06-22 11:46:07,145 INFO ]: Found implementation of procedure False [2018-06-22 11:46:07,145 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:46:07,145 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:46:07,145 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:46:07,145 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:46:07,145 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:46:07,145 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:46:07,657 INFO ]: Using library mode [2018-06-22 11:46:07,658 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:46:07 BoogieIcfgContainer [2018-06-22 11:46:07,658 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:46:07,659 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:46:07,659 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:46:07,666 INFO ]: TraceAbstraction initialized [2018-06-22 11:46:07,666 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:46:06" (1/3) ... [2018-06-22 11:46:07,667 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45682bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:46:07, skipping insertion in model container [2018-06-22 11:46:07,667 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:46:07" (2/3) ... [2018-06-22 11:46:07,667 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45682bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:46:07, skipping insertion in model container [2018-06-22 11:46:07,667 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:46:07" (3/3) ... [2018-06-22 11:46:07,670 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:46:07,678 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:46:07,686 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:46:07,720 INFO ]: Using default assertion order modulation [2018-06-22 11:46:07,721 INFO ]: Interprodecural is true [2018-06-22 11:46:07,721 INFO ]: Hoare is false [2018-06-22 11:46:07,721 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:46:07,721 INFO ]: Backedges is TWOTRACK [2018-06-22 11:46:07,721 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:46:07,721 INFO ]: Difference is false [2018-06-22 11:46:07,721 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:46:07,721 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:46:07,733 INFO ]: Start isEmpty. Operand 23 states. [2018-06-22 11:46:07,750 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:46:07,750 INFO ]: Found error trace [2018-06-22 11:46:07,751 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:46:07,751 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:07,757 INFO ]: Analyzing trace with hash 146052874, now seen corresponding path program 1 times [2018-06-22 11:46:07,759 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:07,759 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:07,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:07,790 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:07,790 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:07,802 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:07,822 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:07,825 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:07,825 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:46:07,827 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:46:07,837 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:46:07,837 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:46:07,839 INFO ]: Start difference. First operand 23 states. Second operand 2 states. [2018-06-22 11:46:07,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:07,862 INFO ]: Finished difference Result 21 states and 42 transitions. [2018-06-22 11:46:07,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:46:07,863 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:46:07,864 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:07,878 INFO ]: With dead ends: 21 [2018-06-22 11:46:07,878 INFO ]: Without dead ends: 21 [2018-06-22 11:46:07,881 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:46:07,894 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:46:07,917 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 11:46:07,918 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:46:07,919 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. [2018-06-22 11:46:07,920 INFO ]: Start accepts. Automaton has 21 states and 42 transitions. Word has length 5 [2018-06-22 11:46:07,920 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:07,920 INFO ]: Abstraction has 21 states and 42 transitions. [2018-06-22 11:46:07,920 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:46:07,920 INFO ]: Start isEmpty. Operand 21 states and 42 transitions. [2018-06-22 11:46:07,923 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:07,923 INFO ]: Found error trace [2018-06-22 11:46:07,923 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:07,923 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:07,924 INFO ]: Analyzing trace with hash -51096390, now seen corresponding path program 1 times [2018-06-22 11:46:07,924 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:07,924 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:07,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:07,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:07,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:07,948 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:08,014 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:08,014 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:08,014 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:08,016 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:08,016 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:08,016 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:08,016 INFO ]: Start difference. First operand 21 states and 42 transitions. Second operand 4 states. [2018-06-22 11:46:08,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:08,609 INFO ]: Finished difference Result 21 states and 41 transitions. [2018-06-22 11:46:08,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:08,609 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:08,610 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:08,611 INFO ]: With dead ends: 21 [2018-06-22 11:46:08,611 INFO ]: Without dead ends: 20 [2018-06-22 11:46:08,611 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:08,611 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:46:08,617 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 11:46:08,617 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:46:08,618 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 39 transitions. [2018-06-22 11:46:08,618 INFO ]: Start accepts. Automaton has 20 states and 39 transitions. Word has length 9 [2018-06-22 11:46:08,618 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:08,618 INFO ]: Abstraction has 20 states and 39 transitions. [2018-06-22 11:46:08,618 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:08,619 INFO ]: Start isEmpty. Operand 20 states and 39 transitions. [2018-06-22 11:46:08,622 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:08,622 INFO ]: Found error trace [2018-06-22 11:46:08,622 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:08,622 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:08,622 INFO ]: Analyzing trace with hash -2014531815, now seen corresponding path program 1 times [2018-06-22 11:46:08,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:08,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:08,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:08,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:08,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:08,636 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:08,692 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:08,692 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:08,692 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:08,693 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:08,693 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:08,693 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:08,693 INFO ]: Start difference. First operand 20 states and 39 transitions. Second operand 4 states. [2018-06-22 11:46:08,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:08,967 INFO ]: Finished difference Result 20 states and 38 transitions. [2018-06-22 11:46:08,967 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:08,967 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:08,967 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:08,968 INFO ]: With dead ends: 20 [2018-06-22 11:46:08,968 INFO ]: Without dead ends: 19 [2018-06-22 11:46:08,968 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:08,968 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:46:08,973 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 11:46:08,973 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:46:08,974 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-06-22 11:46:08,974 INFO ]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 9 [2018-06-22 11:46:08,974 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:08,974 INFO ]: Abstraction has 19 states and 36 transitions. [2018-06-22 11:46:08,974 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:08,974 INFO ]: Start isEmpty. Operand 19 states and 36 transitions. [2018-06-22 11:46:08,975 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:08,975 INFO ]: Found error trace [2018-06-22 11:46:08,975 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:08,975 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:08,975 INFO ]: Analyzing trace with hash -1453550265, now seen corresponding path program 1 times [2018-06-22 11:46:08,975 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:08,975 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:08,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:08,976 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:08,976 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:09,020 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:09,346 WARN ]: Spent 227.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 18 [2018-06-22 11:46:09,482 WARN ]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-22 11:46:09,484 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:09,484 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:09,484 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:09,484 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:09,485 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:09,485 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:09,485 INFO ]: Start difference. First operand 19 states and 36 transitions. Second operand 4 states. [2018-06-22 11:46:09,705 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:09,705 INFO ]: Finished difference Result 23 states and 48 transitions. [2018-06-22 11:46:09,706 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:09,706 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:09,706 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:09,707 INFO ]: With dead ends: 23 [2018-06-22 11:46:09,707 INFO ]: Without dead ends: 23 [2018-06-22 11:46:09,707 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:09,708 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:46:09,716 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-22 11:46:09,716 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:46:09,717 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 46 transitions. [2018-06-22 11:46:09,717 INFO ]: Start accepts. Automaton has 21 states and 46 transitions. Word has length 9 [2018-06-22 11:46:09,717 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:09,717 INFO ]: Abstraction has 21 states and 46 transitions. [2018-06-22 11:46:09,717 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:09,717 INFO ]: Start isEmpty. Operand 21 states and 46 transitions. [2018-06-22 11:46:09,718 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:09,718 INFO ]: Found error trace [2018-06-22 11:46:09,718 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:09,718 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:09,719 INFO ]: Analyzing trace with hash -331718075, now seen corresponding path program 1 times [2018-06-22 11:46:09,719 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:09,719 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:09,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:09,720 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:09,720 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:09,725 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:09,770 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:09,770 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:09,770 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:09,770 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:09,770 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:09,770 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:09,770 INFO ]: Start difference. First operand 21 states and 46 transitions. Second operand 4 states. [2018-06-22 11:46:10,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:10,158 INFO ]: Finished difference Result 21 states and 44 transitions. [2018-06-22 11:46:10,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:10,159 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:10,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:10,160 INFO ]: With dead ends: 21 [2018-06-22 11:46:10,160 INFO ]: Without dead ends: 20 [2018-06-22 11:46:10,160 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:10,160 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:46:10,164 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-22 11:46:10,164 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:46:10,166 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 42 transitions. [2018-06-22 11:46:10,166 INFO ]: Start accepts. Automaton has 20 states and 42 transitions. Word has length 9 [2018-06-22 11:46:10,166 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:10,166 INFO ]: Abstraction has 20 states and 42 transitions. [2018-06-22 11:46:10,166 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:10,166 INFO ]: Start isEmpty. Operand 20 states and 42 transitions. [2018-06-22 11:46:10,167 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:10,167 INFO ]: Found error trace [2018-06-22 11:46:10,167 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:10,167 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:10,167 INFO ]: Analyzing trace with hash -115347788, now seen corresponding path program 1 times [2018-06-22 11:46:10,167 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:10,167 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:10,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,168 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:10,168 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:10,361 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:10,361 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:10,361 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:10,361 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:10,361 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:10,361 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:10,361 INFO ]: Start difference. First operand 20 states and 42 transitions. Second operand 4 states. [2018-06-22 11:46:10,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:10,459 INFO ]: Finished difference Result 22 states and 43 transitions. [2018-06-22 11:46:10,459 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:10,459 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:10,460 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:10,460 INFO ]: With dead ends: 22 [2018-06-22 11:46:10,460 INFO ]: Without dead ends: 22 [2018-06-22 11:46:10,461 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:10,461 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:46:10,467 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 11:46:10,467 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:46:10,468 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2018-06-22 11:46:10,468 INFO ]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 9 [2018-06-22 11:46:10,468 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:10,468 INFO ]: Abstraction has 20 states and 41 transitions. [2018-06-22 11:46:10,468 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:10,468 INFO ]: Start isEmpty. Operand 20 states and 41 transitions. [2018-06-22 11:46:10,469 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:10,469 INFO ]: Found error trace [2018-06-22 11:46:10,469 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:10,469 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:10,469 INFO ]: Analyzing trace with hash 445633762, now seen corresponding path program 1 times [2018-06-22 11:46:10,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:10,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:10,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,470 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:10,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,475 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:10,493 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:10,493 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:10,493 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:10,493 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:10,494 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:10,494 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:10,494 INFO ]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2018-06-22 11:46:10,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:10,551 INFO ]: Finished difference Result 20 states and 39 transitions. [2018-06-22 11:46:10,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:10,551 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:10,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:10,552 INFO ]: With dead ends: 20 [2018-06-22 11:46:10,552 INFO ]: Without dead ends: 19 [2018-06-22 11:46:10,552 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:10,553 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:46:10,556 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 11:46:10,556 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:46:10,557 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. [2018-06-22 11:46:10,557 INFO ]: Start accepts. Automaton has 19 states and 37 transitions. Word has length 9 [2018-06-22 11:46:10,557 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:10,557 INFO ]: Abstraction has 19 states and 37 transitions. [2018-06-22 11:46:10,557 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:10,557 INFO ]: Start isEmpty. Operand 19 states and 37 transitions. [2018-06-22 11:46:10,558 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:10,558 INFO ]: Found error trace [2018-06-22 11:46:10,558 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:10,558 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:10,558 INFO ]: Analyzing trace with hash 1783705329, now seen corresponding path program 1 times [2018-06-22 11:46:10,558 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:10,558 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:10,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,559 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:10,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:10,630 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:10,630 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:10,630 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:10,630 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:10,631 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:10,631 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:10,631 INFO ]: Start difference. First operand 19 states and 37 transitions. Second operand 4 states. [2018-06-22 11:46:10,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:10,675 INFO ]: Finished difference Result 21 states and 38 transitions. [2018-06-22 11:46:10,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:10,675 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:10,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:10,676 INFO ]: With dead ends: 21 [2018-06-22 11:46:10,676 INFO ]: Without dead ends: 21 [2018-06-22 11:46:10,676 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:10,676 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:46:10,680 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:46:10,680 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:46:10,680 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 36 transitions. [2018-06-22 11:46:10,680 INFO ]: Start accepts. Automaton has 19 states and 36 transitions. Word has length 9 [2018-06-22 11:46:10,681 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:10,681 INFO ]: Abstraction has 19 states and 36 transitions. [2018-06-22 11:46:10,681 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:10,681 INFO ]: Start isEmpty. Operand 19 states and 36 transitions. [2018-06-22 11:46:10,681 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:10,681 INFO ]: Found error trace [2018-06-22 11:46:10,682 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:10,682 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:10,682 INFO ]: Analyzing trace with hash -1950280417, now seen corresponding path program 1 times [2018-06-22 11:46:10,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:10,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:10,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,683 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:10,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,695 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:10,810 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:10,810 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:10,810 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:10,810 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:10,811 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:10,811 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:10,811 INFO ]: Start difference. First operand 19 states and 36 transitions. Second operand 4 states. [2018-06-22 11:46:10,895 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:10,895 INFO ]: Finished difference Result 21 states and 37 transitions. [2018-06-22 11:46:10,896 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:10,896 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:10,896 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:10,896 INFO ]: With dead ends: 21 [2018-06-22 11:46:10,896 INFO ]: Without dead ends: 21 [2018-06-22 11:46:10,897 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:10,897 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:46:10,900 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:46:10,900 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:46:10,900 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-06-22 11:46:10,900 INFO ]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 9 [2018-06-22 11:46:10,901 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:10,901 INFO ]: Abstraction has 19 states and 35 transitions. [2018-06-22 11:46:10,901 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:10,901 INFO ]: Start isEmpty. Operand 19 states and 35 transitions. [2018-06-22 11:46:10,901 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:46:10,901 INFO ]: Found error trace [2018-06-22 11:46:10,901 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:10,901 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:10,901 INFO ]: Analyzing trace with hash -612077940, now seen corresponding path program 1 times [2018-06-22 11:46:10,901 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:10,901 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:10,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,902 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:10,902 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:10,907 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:11,016 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:11,017 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:11,017 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:11,017 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:11,017 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:11,017 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:11,017 INFO ]: Start difference. First operand 19 states and 35 transitions. Second operand 4 states. [2018-06-22 11:46:11,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:11,045 INFO ]: Finished difference Result 21 states and 36 transitions. [2018-06-22 11:46:11,046 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:46:11,046 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:46:11,046 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:11,047 INFO ]: With dead ends: 21 [2018-06-22 11:46:11,047 INFO ]: Without dead ends: 21 [2018-06-22 11:46:11,047 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:11,047 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:46:11,049 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:46:11,049 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:46:11,050 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2018-06-22 11:46:11,050 INFO ]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 9 [2018-06-22 11:46:11,050 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:11,050 INFO ]: Abstraction has 19 states and 34 transitions. [2018-06-22 11:46:11,050 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:11,050 INFO ]: Start isEmpty. Operand 19 states and 34 transitions. [2018-06-22 11:46:11,051 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:11,051 INFO ]: Found error trace [2018-06-22 11:46:11,051 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:11,051 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:11,051 INFO ]: Analyzing trace with hash 1489865296, now seen corresponding path program 1 times [2018-06-22 11:46:11,051 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:11,051 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:11,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:11,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:11,052 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:11,068 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:11,248 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:11,248 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:11,248 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:11,254 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:11,289 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:11,297 INFO ]: Computing forward predicates... [2018-06-22 11:46:11,392 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:11,411 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:11,411 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:46:11,411 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:46:11,411 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:46:11,411 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:11,412 INFO ]: Start difference. First operand 19 states and 34 transitions. Second operand 9 states. [2018-06-22 11:46:11,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:11,770 INFO ]: Finished difference Result 29 states and 57 transitions. [2018-06-22 11:46:11,771 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:11,771 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:46:11,771 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:11,772 INFO ]: With dead ends: 29 [2018-06-22 11:46:11,772 INFO ]: Without dead ends: 29 [2018-06-22 11:46:11,772 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:46:11,772 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:46:11,777 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-22 11:46:11,777 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:46:11,777 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-06-22 11:46:11,778 INFO ]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 13 [2018-06-22 11:46:11,778 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:11,778 INFO ]: Abstraction has 21 states and 39 transitions. [2018-06-22 11:46:11,778 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:46:11,778 INFO ]: Start isEmpty. Operand 21 states and 39 transitions. [2018-06-22 11:46:11,778 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:11,778 INFO ]: Found error trace [2018-06-22 11:46:11,778 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:11,779 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:11,779 INFO ]: Analyzing trace with hash 1436966138, now seen corresponding path program 1 times [2018-06-22 11:46:11,779 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:11,779 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:11,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:11,779 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:11,779 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:11,791 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:11,857 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:11,857 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:11,857 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:11,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:11,875 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:11,877 INFO ]: Computing forward predicates... [2018-06-22 11:46:11,918 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:11,948 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:11,948 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:46:11,948 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:11,948 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:11,948 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:11,948 INFO ]: Start difference. First operand 21 states and 39 transitions. Second operand 6 states. [2018-06-22 11:46:12,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:12,029 INFO ]: Finished difference Result 25 states and 49 transitions. [2018-06-22 11:46:12,029 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:12,029 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:12,029 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:12,030 INFO ]: With dead ends: 25 [2018-06-22 11:46:12,030 INFO ]: Without dead ends: 25 [2018-06-22 11:46:12,030 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:12,030 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:46:12,035 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-06-22 11:46:12,035 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:46:12,035 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2018-06-22 11:46:12,035 INFO ]: Start accepts. Automaton has 19 states and 34 transitions. Word has length 13 [2018-06-22 11:46:12,035 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:12,035 INFO ]: Abstraction has 19 states and 34 transitions. [2018-06-22 11:46:12,035 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:12,035 INFO ]: Start isEmpty. Operand 19 states and 34 transitions. [2018-06-22 11:46:12,036 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:12,036 INFO ]: Found error trace [2018-06-22 11:46:12,036 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:12,036 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:12,036 INFO ]: Analyzing trace with hash 1244614443, now seen corresponding path program 1 times [2018-06-22 11:46:12,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:12,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:12,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:12,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:12,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:12,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:12,210 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:12,210 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:12,210 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:46:12,210 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:46:12,210 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:46:12,210 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:12,211 INFO ]: Start difference. First operand 19 states and 34 transitions. Second operand 5 states. [2018-06-22 11:46:12,353 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:12,353 INFO ]: Finished difference Result 27 states and 57 transitions. [2018-06-22 11:46:12,354 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:12,354 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:46:12,354 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:12,355 INFO ]: With dead ends: 27 [2018-06-22 11:46:12,355 INFO ]: Without dead ends: 27 [2018-06-22 11:46:12,355 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:12,355 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:46:12,360 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:46:12,360 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:46:12,361 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 46 transitions. [2018-06-22 11:46:12,361 INFO ]: Start accepts. Automaton has 23 states and 46 transitions. Word has length 13 [2018-06-22 11:46:12,361 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:12,361 INFO ]: Abstraction has 23 states and 46 transitions. [2018-06-22 11:46:12,361 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:46:12,361 INFO ]: Start isEmpty. Operand 23 states and 46 transitions. [2018-06-22 11:46:12,362 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:12,362 INFO ]: Found error trace [2018-06-22 11:46:12,362 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:12,362 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:12,362 INFO ]: Analyzing trace with hash -1134585064, now seen corresponding path program 1 times [2018-06-22 11:46:12,362 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:12,362 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:12,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:12,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:12,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:12,386 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:12,541 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:12,541 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:12,541 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:46:12,541 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:46:12,541 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:46:12,541 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:12,542 INFO ]: Start difference. First operand 23 states and 46 transitions. Second operand 5 states. [2018-06-22 11:46:12,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:12,667 INFO ]: Finished difference Result 27 states and 56 transitions. [2018-06-22 11:46:12,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:12,667 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:46:12,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:12,668 INFO ]: With dead ends: 27 [2018-06-22 11:46:12,668 INFO ]: Without dead ends: 27 [2018-06-22 11:46:12,668 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:12,668 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:46:12,672 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:46:12,672 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:46:12,676 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 45 transitions. [2018-06-22 11:46:12,676 INFO ]: Start accepts. Automaton has 23 states and 45 transitions. Word has length 13 [2018-06-22 11:46:12,676 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:12,676 INFO ]: Abstraction has 23 states and 45 transitions. [2018-06-22 11:46:12,676 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:46:12,676 INFO ]: Start isEmpty. Operand 23 states and 45 transitions. [2018-06-22 11:46:12,677 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:12,677 INFO ]: Found error trace [2018-06-22 11:46:12,677 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:12,677 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:12,677 INFO ]: Analyzing trace with hash 1191715285, now seen corresponding path program 1 times [2018-06-22 11:46:12,677 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:12,677 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:12,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:12,677 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:12,677 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:12,687 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:12,753 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:12,753 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:12,753 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:46:12,753 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:46:12,753 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:46:12,753 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:12,753 INFO ]: Start difference. First operand 23 states and 45 transitions. Second operand 5 states. [2018-06-22 11:46:13,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:13,152 INFO ]: Finished difference Result 27 states and 55 transitions. [2018-06-22 11:46:13,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:13,152 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:46:13,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:13,153 INFO ]: With dead ends: 27 [2018-06-22 11:46:13,153 INFO ]: Without dead ends: 27 [2018-06-22 11:46:13,153 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:13,153 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:46:13,157 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:46:13,157 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:46:13,157 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 44 transitions. [2018-06-22 11:46:13,157 INFO ]: Start accepts. Automaton has 23 states and 44 transitions. Word has length 13 [2018-06-22 11:46:13,158 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:13,158 INFO ]: Abstraction has 23 states and 44 transitions. [2018-06-22 11:46:13,158 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:46:13,158 INFO ]: Start isEmpty. Operand 23 states and 44 transitions. [2018-06-22 11:46:13,158 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:13,158 INFO ]: Found error trace [2018-06-22 11:46:13,158 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:13,158 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:13,158 INFO ]: Analyzing trace with hash -1756714256, now seen corresponding path program 1 times [2018-06-22 11:46:13,158 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:13,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:13,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:13,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:13,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:13,166 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:13,264 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:13,264 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:13,264 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:46:13,264 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:46:13,264 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:46:13,264 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:13,264 INFO ]: Start difference. First operand 23 states and 44 transitions. Second operand 5 states. [2018-06-22 11:46:13,442 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:13,442 INFO ]: Finished difference Result 27 states and 54 transitions. [2018-06-22 11:46:13,442 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:13,442 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:46:13,442 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:13,443 INFO ]: With dead ends: 27 [2018-06-22 11:46:13,443 INFO ]: Without dead ends: 27 [2018-06-22 11:46:13,443 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:13,443 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:46:13,447 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:46:13,447 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:46:13,447 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2018-06-22 11:46:13,447 INFO ]: Start accepts. Automaton has 23 states and 43 transitions. Word has length 13 [2018-06-22 11:46:13,447 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:13,447 INFO ]: Abstraction has 23 states and 43 transitions. [2018-06-22 11:46:13,447 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:46:13,447 INFO ]: Start isEmpty. Operand 23 states and 43 transitions. [2018-06-22 11:46:13,450 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:13,450 INFO ]: Found error trace [2018-06-22 11:46:13,450 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:13,450 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:13,450 INFO ]: Analyzing trace with hash 622485251, now seen corresponding path program 1 times [2018-06-22 11:46:13,450 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:13,450 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:13,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:13,451 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:13,451 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:13,471 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:13,713 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:13,713 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:13,713 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:46:13,713 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:46:13,713 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:46:13,713 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:13,714 INFO ]: Start difference. First operand 23 states and 43 transitions. Second operand 5 states. [2018-06-22 11:46:13,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:13,862 INFO ]: Finished difference Result 27 states and 53 transitions. [2018-06-22 11:46:13,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:13,862 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:46:13,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:13,863 INFO ]: With dead ends: 27 [2018-06-22 11:46:13,863 INFO ]: Without dead ends: 27 [2018-06-22 11:46:13,863 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:13,863 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:46:13,867 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-06-22 11:46:13,867 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:46:13,867 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 42 transitions. [2018-06-22 11:46:13,867 INFO ]: Start accepts. Automaton has 23 states and 42 transitions. Word has length 13 [2018-06-22 11:46:13,867 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:13,867 INFO ]: Abstraction has 23 states and 42 transitions. [2018-06-22 11:46:13,867 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:46:13,867 INFO ]: Start isEmpty. Operand 23 states and 42 transitions. [2018-06-22 11:46:13,868 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:13,868 INFO ]: Found error trace [2018-06-22 11:46:13,868 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:13,868 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:13,868 INFO ]: Analyzing trace with hash 1682216991, now seen corresponding path program 1 times [2018-06-22 11:46:13,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:13,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:13,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:13,869 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:13,869 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:13,878 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:14,127 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:14,127 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:14,127 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:14,133 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:14,143 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:14,145 INFO ]: Computing forward predicates... [2018-06-22 11:46:14,475 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:14,495 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:14,496 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:46:14,496 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:14,496 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:14,496 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:14,496 INFO ]: Start difference. First operand 23 states and 42 transitions. Second operand 6 states. [2018-06-22 11:46:14,645 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:14,645 INFO ]: Finished difference Result 29 states and 61 transitions. [2018-06-22 11:46:14,645 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:14,645 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:14,645 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:14,645 INFO ]: With dead ends: 29 [2018-06-22 11:46:14,645 INFO ]: Without dead ends: 29 [2018-06-22 11:46:14,646 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:14,646 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:46:14,650 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:46:14,650 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:46:14,650 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 50 transitions. [2018-06-22 11:46:14,650 INFO ]: Start accepts. Automaton has 25 states and 50 transitions. Word has length 13 [2018-06-22 11:46:14,650 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:14,650 INFO ]: Abstraction has 25 states and 50 transitions. [2018-06-22 11:46:14,650 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:14,650 INFO ]: Start isEmpty. Operand 25 states and 50 transitions. [2018-06-22 11:46:14,651 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:14,651 INFO ]: Found error trace [2018-06-22 11:46:14,651 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:14,651 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:14,651 INFO ]: Analyzing trace with hash 1735116149, now seen corresponding path program 1 times [2018-06-22 11:46:14,651 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:14,651 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:14,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:14,652 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:14,652 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:14,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:15,110 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:15,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:15,110 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) [2018-06-22 11:46:15,125 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:15,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:15,154 INFO ]: Computing forward predicates... [2018-06-22 11:46:15,395 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:15,426 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:15,426 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:46:15,427 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:15,427 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:15,427 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:15,427 INFO ]: Start difference. First operand 25 states and 50 transitions. Second operand 6 states. [2018-06-22 11:46:15,830 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:15,830 INFO ]: Finished difference Result 29 states and 60 transitions. [2018-06-22 11:46:15,831 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:15,831 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:15,831 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:15,831 INFO ]: With dead ends: 29 [2018-06-22 11:46:15,831 INFO ]: Without dead ends: 29 [2018-06-22 11:46:15,832 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:15,832 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:46:15,835 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:46:15,835 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:46:15,836 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-06-22 11:46:15,836 INFO ]: Start accepts. Automaton has 25 states and 49 transitions. Word has length 13 [2018-06-22 11:46:15,836 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:15,836 INFO ]: Abstraction has 25 states and 49 transitions. [2018-06-22 11:46:15,836 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:15,836 INFO ]: Start isEmpty. Operand 25 states and 49 transitions. [2018-06-22 11:46:15,839 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:15,839 INFO ]: Found error trace [2018-06-22 11:46:15,839 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:15,839 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:15,839 INFO ]: Analyzing trace with hash -644083358, now seen corresponding path program 1 times [2018-06-22 11:46:15,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:15,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:15,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:15,840 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:15,840 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:15,855 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:16,017 WARN ]: Spent 109.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-06-22 11:46:16,097 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:16,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:16,097 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:16,103 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:16,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:16,134 INFO ]: Computing forward predicates... [2018-06-22 11:46:16,534 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-22 11:46:16,962 WARN ]: Spent 199.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-06-22 11:46:16,967 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:16,992 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:16,992 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-22 11:46:16,992 INFO ]: Interpolant automaton has 9 states [2018-06-22 11:46:16,992 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 11:46:16,992 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:46:16,992 INFO ]: Start difference. First operand 25 states and 49 transitions. Second operand 9 states. [2018-06-22 11:46:17,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:17,356 INFO ]: Finished difference Result 29 states and 59 transitions. [2018-06-22 11:46:17,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:17,357 INFO ]: Start accepts. Automaton has 9 states. Word has length 13 [2018-06-22 11:46:17,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:17,357 INFO ]: With dead ends: 29 [2018-06-22 11:46:17,357 INFO ]: Without dead ends: 29 [2018-06-22 11:46:17,357 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:17,357 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:46:17,361 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:46:17,361 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:46:17,362 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 48 transitions. [2018-06-22 11:46:17,362 INFO ]: Start accepts. Automaton has 25 states and 48 transitions. Word has length 13 [2018-06-22 11:46:17,362 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:17,362 INFO ]: Abstraction has 25 states and 48 transitions. [2018-06-22 11:46:17,362 INFO ]: Interpolant automaton has 9 states. [2018-06-22 11:46:17,362 INFO ]: Start isEmpty. Operand 25 states and 48 transitions. [2018-06-22 11:46:17,363 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:17,363 INFO ]: Found error trace [2018-06-22 11:46:17,363 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:17,363 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:17,363 INFO ]: Analyzing trace with hash 1112986957, now seen corresponding path program 1 times [2018-06-22 11:46:17,363 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:17,363 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:17,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:17,363 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:17,363 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:17,372 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:17,555 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:17,555 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:17,555 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:17,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:17,571 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:17,573 INFO ]: Computing forward predicates... [2018-06-22 11:46:17,862 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:17,882 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:17,882 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:46:17,882 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:17,882 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:17,882 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:17,882 INFO ]: Start difference. First operand 25 states and 48 transitions. Second operand 6 states. [2018-06-22 11:46:17,972 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:17,972 INFO ]: Finished difference Result 29 states and 58 transitions. [2018-06-22 11:46:17,972 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:17,972 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:17,972 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:17,973 INFO ]: With dead ends: 29 [2018-06-22 11:46:17,973 INFO ]: Without dead ends: 29 [2018-06-22 11:46:17,973 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:17,973 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:46:17,976 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:46:17,976 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:46:17,977 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2018-06-22 11:46:17,977 INFO ]: Start accepts. Automaton has 25 states and 47 transitions. Word has length 13 [2018-06-22 11:46:17,977 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:17,977 INFO ]: Abstraction has 25 states and 47 transitions. [2018-06-22 11:46:17,977 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:17,977 INFO ]: Start isEmpty. Operand 25 states and 47 transitions. [2018-06-22 11:46:17,978 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:46:17,978 INFO ]: Found error trace [2018-06-22 11:46:17,978 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:17,978 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:17,978 INFO ]: Analyzing trace with hash -1266212550, now seen corresponding path program 1 times [2018-06-22 11:46:17,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:17,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:17,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:17,979 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:17,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:17,987 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:18,151 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:18,151 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:18,151 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:18,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:18,170 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:18,171 INFO ]: Computing forward predicates... [2018-06-22 11:46:18,186 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:18,217 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:18,217 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-22 11:46:18,217 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:46:18,217 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:46:18,217 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:18,217 INFO ]: Start difference. First operand 25 states and 47 transitions. Second operand 6 states. [2018-06-22 11:46:18,264 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:18,264 INFO ]: Finished difference Result 29 states and 57 transitions. [2018-06-22 11:46:18,264 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:18,264 INFO ]: Start accepts. Automaton has 6 states. Word has length 13 [2018-06-22 11:46:18,264 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:18,265 INFO ]: With dead ends: 29 [2018-06-22 11:46:18,265 INFO ]: Without dead ends: 29 [2018-06-22 11:46:18,265 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:46:18,265 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:46:18,268 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-06-22 11:46:18,268 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:46:18,269 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2018-06-22 11:46:18,269 INFO ]: Start accepts. Automaton has 25 states and 46 transitions. Word has length 13 [2018-06-22 11:46:18,269 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:18,269 INFO ]: Abstraction has 25 states and 46 transitions. [2018-06-22 11:46:18,269 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:46:18,270 INFO ]: Start isEmpty. Operand 25 states and 46 transitions. [2018-06-22 11:46:18,270 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:18,270 INFO ]: Found error trace [2018-06-22 11:46:18,270 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:18,270 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:18,270 INFO ]: Analyzing trace with hash 872655422, now seen corresponding path program 1 times [2018-06-22 11:46:18,270 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:18,270 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:18,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:18,271 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:18,271 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:18,276 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:18,425 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:18,425 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:18,425 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:18,425 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:18,425 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:18,425 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:18,425 INFO ]: Start difference. First operand 25 states and 46 transitions. Second operand 4 states. [2018-06-22 11:46:18,534 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:18,534 INFO ]: Finished difference Result 40 states and 83 transitions. [2018-06-22 11:46:18,534 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:18,534 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:46:18,534 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:18,534 INFO ]: With dead ends: 40 [2018-06-22 11:46:18,534 INFO ]: Without dead ends: 40 [2018-06-22 11:46:18,535 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:18,535 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:46:18,540 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-06-22 11:46:18,540 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:46:18,540 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 69 transitions. [2018-06-22 11:46:18,541 INFO ]: Start accepts. Automaton has 34 states and 69 transitions. Word has length 17 [2018-06-22 11:46:18,541 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:18,541 INFO ]: Abstraction has 34 states and 69 transitions. [2018-06-22 11:46:18,541 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:18,541 INFO ]: Start isEmpty. Operand 34 states and 69 transitions. [2018-06-22 11:46:18,542 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:18,542 INFO ]: Found error trace [2018-06-22 11:46:18,542 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:18,542 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:18,542 INFO ]: Analyzing trace with hash -1620245151, now seen corresponding path program 1 times [2018-06-22 11:46:18,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:18,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:18,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:18,542 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:18,542 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:18,548 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:18,614 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:18,614 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:18,614 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:46:18,614 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:46:18,615 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:46:18,615 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:46:18,615 INFO ]: Start difference. First operand 34 states and 69 transitions. Second operand 4 states. [2018-06-22 11:46:18,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:18,750 INFO ]: Finished difference Result 40 states and 79 transitions. [2018-06-22 11:46:18,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:46:18,750 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:46:18,750 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:18,750 INFO ]: With dead ends: 40 [2018-06-22 11:46:18,750 INFO ]: Without dead ends: 36 [2018-06-22 11:46:18,750 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:18,751 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:46:18,755 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-06-22 11:46:18,755 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:46:18,755 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 60 transitions. [2018-06-22 11:46:18,756 INFO ]: Start accepts. Automaton has 30 states and 60 transitions. Word has length 17 [2018-06-22 11:46:18,756 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:18,756 INFO ]: Abstraction has 30 states and 60 transitions. [2018-06-22 11:46:18,756 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:46:18,756 INFO ]: Start isEmpty. Operand 30 states and 60 transitions. [2018-06-22 11:46:18,756 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:18,756 INFO ]: Found error trace [2018-06-22 11:46:18,756 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:18,757 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:18,757 INFO ]: Analyzing trace with hash 736600774, now seen corresponding path program 1 times [2018-06-22 11:46:18,757 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:18,757 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:18,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:18,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:18,757 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:18,766 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:18,940 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:18,940 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:46:18,940 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:46:18,941 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:46:18,941 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:46:18,941 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:46:18,941 INFO ]: Start difference. First operand 30 states and 60 transitions. Second operand 5 states. [2018-06-22 11:46:19,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:19,005 INFO ]: Finished difference Result 26 states and 41 transitions. [2018-06-22 11:46:19,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:46:19,005 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:46:19,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:19,005 INFO ]: With dead ends: 26 [2018-06-22 11:46:19,005 INFO ]: Without dead ends: 24 [2018-06-22 11:46:19,006 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:46:19,006 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-22 11:46:19,007 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-06-22 11:46:19,007 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-22 11:46:19,008 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 34 transitions. [2018-06-22 11:46:19,008 INFO ]: Start accepts. Automaton has 22 states and 34 transitions. Word has length 17 [2018-06-22 11:46:19,008 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:19,008 INFO ]: Abstraction has 22 states and 34 transitions. [2018-06-22 11:46:19,008 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:46:19,008 INFO ]: Start isEmpty. Operand 22 states and 34 transitions. [2018-06-22 11:46:19,008 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:19,008 INFO ]: Found error trace [2018-06-22 11:46:19,008 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:19,008 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:19,009 INFO ]: Analyzing trace with hash -1418333556, now seen corresponding path program 1 times [2018-06-22 11:46:19,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:19,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:19,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:19,009 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:19,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:19,016 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:19,191 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:19,191 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:19,191 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:19,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:19,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:19,211 INFO ]: Computing forward predicates... [2018-06-22 11:46:19,325 INFO ]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:46:19,357 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:19,357 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:46:19,357 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:46:19,358 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:46:19,358 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:46:19,358 INFO ]: Start difference. First operand 22 states and 34 transitions. Second operand 12 states. [2018-06-22 11:46:20,008 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:20,008 INFO ]: Finished difference Result 26 states and 42 transitions. [2018-06-22 11:46:20,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:46:20,009 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-22 11:46:20,009 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:20,009 INFO ]: With dead ends: 26 [2018-06-22 11:46:20,009 INFO ]: Without dead ends: 25 [2018-06-22 11:46:20,010 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:46:20,010 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:46:20,011 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-06-22 11:46:20,011 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:46:20,012 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-06-22 11:46:20,012 INFO ]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 17 [2018-06-22 11:46:20,012 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:20,012 INFO ]: Abstraction has 21 states and 31 transitions. [2018-06-22 11:46:20,012 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:46:20,012 INFO ]: Start isEmpty. Operand 21 states and 31 transitions. [2018-06-22 11:46:20,012 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:20,012 INFO ]: Found error trace [2018-06-22 11:46:20,012 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:20,012 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:20,013 INFO ]: Analyzing trace with hash -1647553868, now seen corresponding path program 1 times [2018-06-22 11:46:20,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:20,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:20,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:20,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:20,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:20,024 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:20,342 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:20,342 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:20,342 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:46:20,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:20,360 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:20,362 INFO ]: Computing forward predicates... [2018-06-22 11:46:20,452 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:20,473 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:20,473 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:46:20,473 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:46:20,473 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:46:20,473 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:20,473 INFO ]: Start difference. First operand 21 states and 31 transitions. Second operand 10 states. [2018-06-22 11:46:20,809 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:20,809 INFO ]: Finished difference Result 25 states and 34 transitions. [2018-06-22 11:46:20,809 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:46:20,809 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-22 11:46:20,809 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:20,810 INFO ]: With dead ends: 25 [2018-06-22 11:46:20,810 INFO ]: Without dead ends: 22 [2018-06-22 11:46:20,810 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:46:20,810 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:46:20,812 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-06-22 11:46:20,812 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:46:20,812 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-22 11:46:20,812 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 17 [2018-06-22 11:46:20,812 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:20,812 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-22 11:46:20,812 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:46:20,812 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-22 11:46:20,812 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:46:20,812 INFO ]: Found error trace [2018-06-22 11:46:20,813 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:46:20,813 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:46:20,813 INFO ]: Analyzing trace with hash 1740955230, now seen corresponding path program 1 times [2018-06-22 11:46:20,813 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:46:20,813 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:46:20,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:20,813 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:20,813 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:46:20,819 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:20,997 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:20,998 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:46:20,998 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:21,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:46:21,017 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:46:21,019 INFO ]: Computing forward predicates... [2018-06-22 11:46:21,050 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:21,078 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:46:21,078 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-22 11:46:21,078 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:46:21,078 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:46:21,078 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:46:21,078 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 8 states. [2018-06-22 11:46:21,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:46:21,151 INFO ]: Finished difference Result 16 states and 21 transitions. [2018-06-22 11:46:21,151 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:46:21,151 INFO ]: Start accepts. Automaton has 8 states. Word has length 17 [2018-06-22 11:46:21,152 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:46:21,152 INFO ]: With dead ends: 16 [2018-06-22 11:46:21,152 INFO ]: Without dead ends: 0 [2018-06-22 11:46:21,152 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:46:21,152 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:46:21,152 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:46:21,152 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:46:21,152 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:46:21,152 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 11:46:21,152 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:46:21,152 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:46:21,152 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:46:21,152 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:46:21,152 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:46:21,157 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:46:21 BoogieIcfgContainer [2018-06-22 11:46:21,157 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:46:21,158 INFO ]: Toolchain (without parser) took 14166.85 ms. Allocated memory was 308.8 MB in the beginning and 405.3 MB in the end (delta: 96.5 MB). Free memory was 258.2 MB in the beginning and 350.6 MB in the end (delta: -92.4 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:21,159 INFO ]: SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:46:21,159 INFO ]: ChcToBoogie took 61.19 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:21,159 INFO ]: Boogie Preprocessor took 57.47 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:21,160 INFO ]: RCFGBuilder took 541.94 ms. Allocated memory is still 308.8 MB. Free memory was 254.2 MB in the beginning and 238.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:46:21,160 INFO ]: TraceAbstraction took 13498.13 ms. Allocated memory was 308.8 MB in the beginning and 405.3 MB in the end (delta: 96.5 MB). Free memory was 237.2 MB in the beginning and 350.6 MB in the end (delta: -113.4 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:46:21,163 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.10 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 61.19 ms. Allocated memory is still 308.8 MB. Free memory was 258.2 MB in the beginning and 256.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 57.47 ms. Allocated memory is still 308.8 MB. Free memory was 256.2 MB in the beginning and 254.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 541.94 ms. Allocated memory is still 308.8 MB. Free memory was 254.2 MB in the beginning and 238.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 13498.13 ms. Allocated memory was 308.8 MB in the beginning and 405.3 MB in the end (delta: 96.5 MB). Free memory was 237.2 MB in the beginning and 350.6 MB in the end (delta: -113.4 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. SAFE Result, 13.4s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 777 SDtfs, 77 SDslu, 1467 SDs, 0 SdLazy, 1788 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 158 SyntacticMatches, 27 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 86 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 448 ConstructedInterpolants, 8 QuantifiedInterpolants, 44628 SizeOfPredicates, 70 NumberOfNonLiveVariables, 923 ConjunctsInSsa, 274 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 86/138 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strncmp_3.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-46-21-262.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/libc__strncmp_3.array.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-46-21-262.csv Received shutdown request...