java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:03:04,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:03:04,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:03:04,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:03:04,721 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:03:04,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:03:04,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:03:04,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:03:04,727 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:03:04,728 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:03:04,729 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:03:04,729 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:03:04,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:03:04,732 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:03:04,733 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:03:04,733 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:03:04,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:03:04,738 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:03:04,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:03:04,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:03:04,742 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:03:04,744 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:03:04,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:03:04,745 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:03:04,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:03:04,747 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:03:04,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:03:04,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:03:04,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:03:04,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:03:04,751 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:03:04,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:03:04,752 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:03:04,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:03:04,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:03:04,753 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:03:04,767 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:03:04,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:03:04,768 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:03:04,768 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:03:04,769 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:03:04,769 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:03:04,770 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:03:04,770 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:03:04,770 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:03:04,770 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:03:04,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:03:04,771 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:03:04,771 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:03:04,771 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:03:04,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:03:04,772 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:03:04,772 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:03:04,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:03:04,772 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:03:04,774 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:03:04,774 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:03:04,823 INFO ]: Repository-Root is: /tmp [2018-06-22 11:03:04,838 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:03:04,842 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:03:04,843 INFO ]: Initializing SmtParser... [2018-06-22 11:03:04,843 INFO ]: SmtParser initialized [2018-06-22 11:03:04,845 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 [2018-06-22 11:03:04,846 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:03:04,931 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 unknown [2018-06-22 11:03:05,099 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 [2018-06-22 11:03:05,104 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:03:05,110 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:03:05,110 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:03:05,110 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:03:05,111 INFO ]: ChcToBoogie initialized [2018-06-22 11:03:05,117 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:03:05" (1/1) ... [2018-06-22 11:03:05,166 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05 Unit [2018-06-22 11:03:05,167 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:03:05,167 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:03:05,167 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:03:05,167 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:03:05,190 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05" (1/1) ... [2018-06-22 11:03:05,190 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05" (1/1) ... [2018-06-22 11:03:05,197 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05" (1/1) ... [2018-06-22 11:03:05,198 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05" (1/1) ... [2018-06-22 11:03:05,201 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05" (1/1) ... [2018-06-22 11:03:05,202 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05" (1/1) ... [2018-06-22 11:03:05,204 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05" (1/1) ... [2018-06-22 11:03:05,206 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:03:05,206 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:03:05,206 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:03:05,206 INFO ]: RCFGBuilder initialized [2018-06-22 11:03:05,207 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05" (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:03:05,225 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:03:05,225 INFO ]: Found specification of procedure False [2018-06-22 11:03:05,225 INFO ]: Found implementation of procedure False [2018-06-22 11:03:05,225 INFO ]: Specification and implementation of procedure inv_main39 given in one single declaration [2018-06-22 11:03:05,225 INFO ]: Found specification of procedure inv_main39 [2018-06-22 11:03:05,225 INFO ]: Found implementation of procedure inv_main39 [2018-06-22 11:03:05,225 INFO ]: Specification and implementation of procedure inv_main15 given in one single declaration [2018-06-22 11:03:05,225 INFO ]: Found specification of procedure inv_main15 [2018-06-22 11:03:05,225 INFO ]: Found implementation of procedure inv_main15 [2018-06-22 11:03:05,225 INFO ]: Specification and implementation of procedure inv_main33 given in one single declaration [2018-06-22 11:03:05,225 INFO ]: Found specification of procedure inv_main33 [2018-06-22 11:03:05,225 INFO ]: Found implementation of procedure inv_main33 [2018-06-22 11:03:05,225 INFO ]: Specification and implementation of procedure inv_main3 given in one single declaration [2018-06-22 11:03:05,225 INFO ]: Found specification of procedure inv_main3 [2018-06-22 11:03:05,225 INFO ]: Found implementation of procedure inv_main3 [2018-06-22 11:03:05,225 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:03:05,225 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:03:05,225 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:03:05,673 INFO ]: Using library mode [2018-06-22 11:03:05,674 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:03:05 BoogieIcfgContainer [2018-06-22 11:03:05,674 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:03:05,675 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:03:05,675 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:03:05,679 INFO ]: TraceAbstraction initialized [2018-06-22 11:03:05,679 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:03:05" (1/3) ... [2018-06-22 11:03:05,680 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b47e5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:03:05, skipping insertion in model container [2018-06-22 11:03:05,680 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:03:05" (2/3) ... [2018-06-22 11:03:05,680 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b47e5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:03:05, skipping insertion in model container [2018-06-22 11:03:05,680 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:03:05" (3/3) ... [2018-06-22 11:03:05,682 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:03:05,691 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:03:05,698 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:03:05,746 INFO ]: Using default assertion order modulation [2018-06-22 11:03:05,746 INFO ]: Interprodecural is true [2018-06-22 11:03:05,746 INFO ]: Hoare is false [2018-06-22 11:03:05,746 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:03:05,747 INFO ]: Backedges is TWOTRACK [2018-06-22 11:03:05,747 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:03:05,747 INFO ]: Difference is false [2018-06-22 11:03:05,747 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:03:05,747 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:03:05,764 INFO ]: Start isEmpty. Operand 30 states. [2018-06-22 11:03:05,775 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:03:05,775 INFO ]: Found error trace [2018-06-22 11:03:05,776 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:03:05,776 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:05,786 INFO ]: Analyzing trace with hash 92542626, now seen corresponding path program 1 times [2018-06-22 11:03:05,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:05,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:05,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:05,819 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:05,819 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:05,833 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:05,858 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:03:05,860 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:03:05,860 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:03:05,862 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:03:05,876 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:03:05,877 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:03:05,878 INFO ]: Start difference. First operand 30 states. Second operand 2 states. [2018-06-22 11:03:05,900 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:05,900 INFO ]: Finished difference Result 28 states and 39 transitions. [2018-06-22 11:03:05,900 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:03:05,901 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:03:05,901 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:05,912 INFO ]: With dead ends: 28 [2018-06-22 11:03:05,912 INFO ]: Without dead ends: 28 [2018-06-22 11:03:05,914 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:03:05,928 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-22 11:03:05,950 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-22 11:03:05,951 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-22 11:03:05,954 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-06-22 11:03:05,956 INFO ]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 5 [2018-06-22 11:03:05,956 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:05,956 INFO ]: Abstraction has 28 states and 39 transitions. [2018-06-22 11:03:05,956 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:03:05,956 INFO ]: Start isEmpty. Operand 28 states and 39 transitions. [2018-06-22 11:03:05,960 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:03:05,960 INFO ]: Found error trace [2018-06-22 11:03:05,960 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:05,960 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:05,960 INFO ]: Analyzing trace with hash -912159902, now seen corresponding path program 1 times [2018-06-22 11:03:05,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:05,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:05,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:05,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:05,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:05,983 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:06,020 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:03:06,021 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:03:06,021 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:03:06,023 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:03:06,023 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:03:06,023 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:03:06,023 INFO ]: Start difference. First operand 28 states and 39 transitions. Second operand 4 states. [2018-06-22 11:03:06,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:06,053 INFO ]: Finished difference Result 30 states and 40 transitions. [2018-06-22 11:03:06,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:03:06,055 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:03:06,056 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:06,057 INFO ]: With dead ends: 30 [2018-06-22 11:03:06,057 INFO ]: Without dead ends: 27 [2018-06-22 11:03:06,057 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:03:06,057 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:03:06,062 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 11:03:06,062 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:03:06,064 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-06-22 11:03:06,064 INFO ]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 13 [2018-06-22 11:03:06,065 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:06,065 INFO ]: Abstraction has 27 states and 36 transitions. [2018-06-22 11:03:06,065 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:03:06,065 INFO ]: Start isEmpty. Operand 27 states and 36 transitions. [2018-06-22 11:03:06,065 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:03:06,065 INFO ]: Found error trace [2018-06-22 11:03:06,065 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:06,065 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:06,066 INFO ]: Analyzing trace with hash -778564012, now seen corresponding path program 1 times [2018-06-22 11:03:06,066 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:06,066 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:06,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:06,066 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:06,066 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:06,078 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:06,149 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:03:06,149 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:03:06,149 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:03:06,149 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:03:06,150 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:03:06,150 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:03:06,150 INFO ]: Start difference. First operand 27 states and 36 transitions. Second operand 4 states. [2018-06-22 11:03:06,226 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:06,226 INFO ]: Finished difference Result 27 states and 35 transitions. [2018-06-22 11:03:06,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:03:06,227 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-22 11:03:06,227 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:06,228 INFO ]: With dead ends: 27 [2018-06-22 11:03:06,228 INFO ]: Without dead ends: 26 [2018-06-22 11:03:06,228 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:03:06,228 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:03:06,232 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-22 11:03:06,232 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-22 11:03:06,233 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-06-22 11:03:06,233 INFO ]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2018-06-22 11:03:06,233 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:06,233 INFO ]: Abstraction has 26 states and 33 transitions. [2018-06-22 11:03:06,233 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:03:06,233 INFO ]: Start isEmpty. Operand 26 states and 33 transitions. [2018-06-22 11:03:06,234 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:03:06,234 INFO ]: Found error trace [2018-06-22 11:03:06,234 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:06,234 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:06,234 INFO ]: Analyzing trace with hash 651256601, now seen corresponding path program 1 times [2018-06-22 11:03:06,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:06,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:06,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:06,235 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:06,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:06,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:06,419 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:03:06,420 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:03:06,420 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 11:03:06,420 INFO ]: Interpolant automaton has 7 states [2018-06-22 11:03:06,420 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 11:03:06,420 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:03:06,420 INFO ]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2018-06-22 11:03:06,982 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:06,982 INFO ]: Finished difference Result 34 states and 46 transitions. [2018-06-22 11:03:06,983 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:03:06,983 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 11:03:06,983 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:06,984 INFO ]: With dead ends: 34 [2018-06-22 11:03:06,984 INFO ]: Without dead ends: 32 [2018-06-22 11:03:06,985 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:03:06,985 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:03:06,991 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:03:06,991 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:03:06,993 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2018-06-22 11:03:06,993 INFO ]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 21 [2018-06-22 11:03:06,993 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:06,993 INFO ]: Abstraction has 30 states and 40 transitions. [2018-06-22 11:03:06,993 INFO ]: Interpolant automaton has 7 states. [2018-06-22 11:03:06,993 INFO ]: Start isEmpty. Operand 30 states and 40 transitions. [2018-06-22 11:03:06,994 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:03:06,994 INFO ]: Found error trace [2018-06-22 11:03:06,994 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:06,995 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:06,995 INFO ]: Analyzing trace with hash -1103047045, now seen corresponding path program 1 times [2018-06-22 11:03:06,995 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:06,995 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:06,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:06,995 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:06,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:07,009 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:07,199 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:03:07,199 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:03:07,199 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 11:03:07,199 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:03:07,200 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:03:07,200 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:03:07,200 INFO ]: Start difference. First operand 30 states and 40 transitions. Second operand 6 states. [2018-06-22 11:03:07,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:07,321 INFO ]: Finished difference Result 34 states and 47 transitions. [2018-06-22 11:03:07,322 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:03:07,322 INFO ]: Start accepts. Automaton has 6 states. Word has length 25 [2018-06-22 11:03:07,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:07,323 INFO ]: With dead ends: 34 [2018-06-22 11:03:07,323 INFO ]: Without dead ends: 34 [2018-06-22 11:03:07,323 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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:03:07,323 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:03:07,331 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-06-22 11:03:07,331 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:03:07,332 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-06-22 11:03:07,332 INFO ]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 25 [2018-06-22 11:03:07,332 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:07,332 INFO ]: Abstraction has 30 states and 39 transitions. [2018-06-22 11:03:07,332 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:03:07,332 INFO ]: Start isEmpty. Operand 30 states and 39 transitions. [2018-06-22 11:03:07,334 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:03:07,334 INFO ]: Found error trace [2018-06-22 11:03:07,334 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:07,334 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:07,334 INFO ]: Analyzing trace with hash -1673251298, now seen corresponding path program 1 times [2018-06-22 11:03:07,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:07,334 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:07,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:07,335 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:07,335 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:07,369 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:07,463 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:03:07,463 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:03:07,463 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:03:07,463 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:03:07,463 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:03:07,463 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:03:07,464 INFO ]: Start difference. First operand 30 states and 39 transitions. Second operand 4 states. [2018-06-22 11:03:07,513 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:07,513 INFO ]: Finished difference Result 34 states and 45 transitions. [2018-06-22 11:03:07,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:03:07,513 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 11:03:07,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:07,514 INFO ]: With dead ends: 34 [2018-06-22 11:03:07,514 INFO ]: Without dead ends: 32 [2018-06-22 11:03:07,514 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:03:07,515 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:03:07,519 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-22 11:03:07,519 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:03:07,520 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-06-22 11:03:07,520 INFO ]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 25 [2018-06-22 11:03:07,520 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:07,520 INFO ]: Abstraction has 30 states and 39 transitions. [2018-06-22 11:03:07,520 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:03:07,520 INFO ]: Start isEmpty. Operand 30 states and 39 transitions. [2018-06-22 11:03:07,521 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:03:07,521 INFO ]: Found error trace [2018-06-22 11:03:07,521 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:07,522 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:07,522 INFO ]: Analyzing trace with hash -619556130, now seen corresponding path program 1 times [2018-06-22 11:03:07,522 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:07,522 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:07,522 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:07,523 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:07,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:07,533 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:07,621 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:03:07,621 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:07,621 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:03:07,641 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:07,679 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:07,688 INFO ]: Computing forward predicates... [2018-06-22 11:03:08,257 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:03:08,282 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:03:08,282 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2018-06-22 11:03:08,283 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:03:08,283 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:03:08,283 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:03:08,283 INFO ]: Start difference. First operand 30 states and 39 transitions. Second operand 13 states. [2018-06-22 11:03:08,963 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:08,963 INFO ]: Finished difference Result 36 states and 49 transitions. [2018-06-22 11:03:08,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:03:08,964 INFO ]: Start accepts. Automaton has 13 states. Word has length 25 [2018-06-22 11:03:08,964 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:08,965 INFO ]: With dead ends: 36 [2018-06-22 11:03:08,965 INFO ]: Without dead ends: 36 [2018-06-22 11:03:08,965 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:03:08,965 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:03:08,970 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-06-22 11:03:08,970 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:03:08,971 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2018-06-22 11:03:08,971 INFO ]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 25 [2018-06-22 11:03:08,971 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:08,971 INFO ]: Abstraction has 34 states and 45 transitions. [2018-06-22 11:03:08,971 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:03:08,972 INFO ]: Start isEmpty. Operand 34 states and 45 transitions. [2018-06-22 11:03:08,972 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:03:08,973 INFO ]: Found error trace [2018-06-22 11:03:08,973 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:08,973 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:08,973 INFO ]: Analyzing trace with hash -1297180805, now seen corresponding path program 1 times [2018-06-22 11:03:08,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:08,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:08,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:08,974 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:08,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:08,989 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:09,081 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:03:09,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:09,081 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:03:09,087 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:09,100 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:09,102 INFO ]: Computing forward predicates... [2018-06-22 11:03:09,185 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:03:09,205 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:03:09,205 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-22 11:03:09,206 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:03:09,206 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:03:09,206 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:03:09,206 INFO ]: Start difference. First operand 34 states and 45 transitions. Second operand 10 states. [2018-06-22 11:03:09,326 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:09,326 INFO ]: Finished difference Result 30 states and 37 transitions. [2018-06-22 11:03:09,327 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:03:09,327 INFO ]: Start accepts. Automaton has 10 states. Word has length 25 [2018-06-22 11:03:09,327 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:09,328 INFO ]: With dead ends: 30 [2018-06-22 11:03:09,328 INFO ]: Without dead ends: 30 [2018-06-22 11:03:09,328 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:03:09,328 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:03:09,333 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:03:09,333 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:03:09,333 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-06-22 11:03:09,333 INFO ]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 25 [2018-06-22 11:03:09,334 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:09,334 INFO ]: Abstraction has 30 states and 37 transitions. [2018-06-22 11:03:09,334 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:03:09,334 INFO ]: Start isEmpty. Operand 30 states and 37 transitions. [2018-06-22 11:03:09,335 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:03:09,335 INFO ]: Found error trace [2018-06-22 11:03:09,335 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:09,335 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:09,335 INFO ]: Analyzing trace with hash -1623958272, now seen corresponding path program 1 times [2018-06-22 11:03:09,335 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:09,335 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:09,336 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:09,337 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:09,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:09,348 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:09,590 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:03:09,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:09,590 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:03:09,597 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:09,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:09,619 INFO ]: Computing forward predicates... [2018-06-22 11:03:09,754 INFO ]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 11:03:09,785 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:09,785 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-22 11:03:09,785 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:03:09,785 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:03:09,785 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:03:09,785 INFO ]: Start difference. First operand 30 states and 37 transitions. Second operand 11 states. [2018-06-22 11:03:09,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:09,931 INFO ]: Finished difference Result 42 states and 56 transitions. [2018-06-22 11:03:09,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:03:09,932 INFO ]: Start accepts. Automaton has 11 states. Word has length 29 [2018-06-22 11:03:09,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:09,933 INFO ]: With dead ends: 42 [2018-06-22 11:03:09,933 INFO ]: Without dead ends: 40 [2018-06-22 11:03:09,933 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:03:09,933 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:03:09,939 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-06-22 11:03:09,939 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:03:09,940 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2018-06-22 11:03:09,940 INFO ]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 29 [2018-06-22 11:03:09,940 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:09,940 INFO ]: Abstraction has 36 states and 46 transitions. [2018-06-22 11:03:09,940 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:03:09,940 INFO ]: Start isEmpty. Operand 36 states and 46 transitions. [2018-06-22 11:03:09,941 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:03:09,941 INFO ]: Found error trace [2018-06-22 11:03:09,941 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:09,941 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:09,942 INFO ]: Analyzing trace with hash 742417861, now seen corresponding path program 2 times [2018-06-22 11:03:09,942 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:09,942 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:09,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:09,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:09,942 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:09,963 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:10,072 INFO ]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:03:10,072 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:10,072 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:10,079 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:10,113 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:10,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:10,116 INFO ]: Computing forward predicates... [2018-06-22 11:03:10,354 INFO ]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:03:10,373 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:10,373 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2018-06-22 11:03:10,373 INFO ]: Interpolant automaton has 18 states [2018-06-22 11:03:10,373 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 11:03:10,374 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:03:10,374 INFO ]: Start difference. First operand 36 states and 46 transitions. Second operand 18 states. [2018-06-22 11:03:10,981 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:10,981 INFO ]: Finished difference Result 48 states and 65 transitions. [2018-06-22 11:03:10,982 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:03:10,982 INFO ]: Start accepts. Automaton has 18 states. Word has length 33 [2018-06-22 11:03:10,982 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:10,983 INFO ]: With dead ends: 48 [2018-06-22 11:03:10,983 INFO ]: Without dead ends: 48 [2018-06-22 11:03:10,984 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:03:10,984 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:03:10,989 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-06-22 11:03:10,989 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:03:10,991 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-06-22 11:03:10,991 INFO ]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 33 [2018-06-22 11:03:10,991 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:10,992 INFO ]: Abstraction has 38 states and 50 transitions. [2018-06-22 11:03:10,992 INFO ]: Interpolant automaton has 18 states. [2018-06-22 11:03:10,992 INFO ]: Start isEmpty. Operand 38 states and 50 transitions. [2018-06-22 11:03:10,993 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:03:10,993 INFO ]: Found error trace [2018-06-22 11:03:10,993 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:10,993 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:10,993 INFO ]: Analyzing trace with hash -1005875294, now seen corresponding path program 1 times [2018-06-22 11:03:10,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:10,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:10,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:10,995 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:10,995 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:11,008 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:11,031 INFO ]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:03:11,031 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:03:11,031 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:03:11,032 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:03:11,032 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:03:11,032 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:03:11,032 INFO ]: Start difference. First operand 38 states and 50 transitions. Second operand 4 states. [2018-06-22 11:03:11,066 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:11,066 INFO ]: Finished difference Result 36 states and 46 transitions. [2018-06-22 11:03:11,067 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:03:11,067 INFO ]: Start accepts. Automaton has 4 states. Word has length 33 [2018-06-22 11:03:11,067 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:11,068 INFO ]: With dead ends: 36 [2018-06-22 11:03:11,068 INFO ]: Without dead ends: 34 [2018-06-22 11:03:11,068 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:03:11,068 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:03:11,071 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-06-22 11:03:11,071 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:03:11,072 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-06-22 11:03:11,072 INFO ]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 33 [2018-06-22 11:03:11,072 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:11,072 INFO ]: Abstraction has 31 states and 37 transitions. [2018-06-22 11:03:11,072 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:03:11,072 INFO ]: Start isEmpty. Operand 31 states and 37 transitions. [2018-06-22 11:03:11,073 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:03:11,073 INFO ]: Found error trace [2018-06-22 11:03:11,074 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:11,074 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:11,074 INFO ]: Analyzing trace with hash 981092677, now seen corresponding path program 1 times [2018-06-22 11:03:11,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:11,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:11,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:11,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:11,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:11,083 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:11,109 INFO ]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:03:11,109 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:03:11,109 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:03:11,109 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:03:11,110 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:03:11,110 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:03:11,110 INFO ]: Start difference. First operand 31 states and 37 transitions. Second operand 4 states. [2018-06-22 11:03:11,137 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:11,137 INFO ]: Finished difference Result 31 states and 35 transitions. [2018-06-22 11:03:11,137 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:03:11,137 INFO ]: Start accepts. Automaton has 4 states. Word has length 33 [2018-06-22 11:03:11,137 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:11,137 INFO ]: With dead ends: 31 [2018-06-22 11:03:11,137 INFO ]: Without dead ends: 30 [2018-06-22 11:03:11,138 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:03:11,138 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-22 11:03:11,141 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-22 11:03:11,141 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-22 11:03:11,142 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-06-22 11:03:11,142 INFO ]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 33 [2018-06-22 11:03:11,142 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:11,142 INFO ]: Abstraction has 30 states and 33 transitions. [2018-06-22 11:03:11,142 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:03:11,142 INFO ]: Start isEmpty. Operand 30 states and 33 transitions. [2018-06-22 11:03:11,142 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:03:11,142 INFO ]: Found error trace [2018-06-22 11:03:11,143 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:11,143 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:11,143 INFO ]: Analyzing trace with hash 1330764450, now seen corresponding path program 3 times [2018-06-22 11:03:11,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:11,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:11,143 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:11,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:11,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:11,152 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:11,236 INFO ]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:03:11,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:11,236 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:03:11,245 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:03:11,301 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 11:03:11,301 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:11,304 INFO ]: Computing forward predicates... [2018-06-22 11:03:11,674 INFO ]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:03:11,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:11,699 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-06-22 11:03:11,699 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:03:11,699 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:03:11,700 INFO ]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:03:11,700 INFO ]: Start difference. First operand 30 states and 33 transitions. Second operand 17 states. [2018-06-22 11:03:11,992 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:11,992 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-22 11:03:11,992 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:03:11,992 INFO ]: Start accepts. Automaton has 17 states. Word has length 33 [2018-06-22 11:03:11,993 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:11,993 INFO ]: With dead ends: 36 [2018-06-22 11:03:11,993 INFO ]: Without dead ends: 32 [2018-06-22 11:03:11,994 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:03:11,994 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-22 11:03:11,997 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-22 11:03:11,997 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-22 11:03:11,997 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-22 11:03:11,997 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 33 [2018-06-22 11:03:11,998 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:11,998 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-22 11:03:11,998 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:03:11,998 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-22 11:03:11,998 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:03:11,998 INFO ]: Found error trace [2018-06-22 11:03:11,998 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:11,998 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:11,999 INFO ]: Analyzing trace with hash 1710897703, now seen corresponding path program 4 times [2018-06-22 11:03:11,999 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:11,999 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:11,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:11,999 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:11,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:12,010 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:12,198 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:03:12,198 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:12,198 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:03:12,204 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:03:12,224 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:03:12,224 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:12,227 INFO ]: Computing forward predicates... [2018-06-22 11:03:12,425 INFO ]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:03:12,444 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:12,444 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-22 11:03:12,445 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:03:12,445 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:03:12,445 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:03:12,445 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 13 states. [2018-06-22 11:03:12,606 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:12,606 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-22 11:03:12,606 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:03:12,606 INFO ]: Start accepts. Automaton has 13 states. Word has length 37 [2018-06-22 11:03:12,607 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:12,607 INFO ]: With dead ends: 42 [2018-06-22 11:03:12,607 INFO ]: Without dead ends: 40 [2018-06-22 11:03:12,607 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 11:03:12,608 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:03:12,611 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-06-22 11:03:12,611 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:03:12,612 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-22 11:03:12,612 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2018-06-22 11:03:12,612 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:12,612 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-22 11:03:12,612 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:03:12,612 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-22 11:03:12,613 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:03:12,613 INFO ]: Found error trace [2018-06-22 11:03:12,613 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:12,613 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:12,613 INFO ]: Analyzing trace with hash 1647440393, now seen corresponding path program 5 times [2018-06-22 11:03:12,614 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:12,614 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:12,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:12,614 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:12,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:12,624 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:12,818 INFO ]: Checked inductivity of 31 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:03:12,818 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:12,818 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:03:12,824 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:03:12,843 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-22 11:03:12,843 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:12,846 INFO ]: Computing forward predicates... [2018-06-22 11:03:12,997 INFO ]: Checked inductivity of 31 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:03:13,016 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:13,016 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-22 11:03:13,016 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:03:13,016 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:03:13,016 INFO ]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:03:13,016 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 19 states. [2018-06-22 11:03:13,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:13,190 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-22 11:03:13,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:03:13,191 INFO ]: Start accepts. Automaton has 19 states. Word has length 41 [2018-06-22 11:03:13,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:13,191 INFO ]: With dead ends: 40 [2018-06-22 11:03:13,191 INFO ]: Without dead ends: 34 [2018-06-22 11:03:13,192 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:03:13,192 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-22 11:03:13,194 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-22 11:03:13,194 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-22 11:03:13,195 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-22 11:03:13,195 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 41 [2018-06-22 11:03:13,195 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:13,195 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-22 11:03:13,195 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:03:13,196 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-22 11:03:13,196 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:03:13,196 INFO ]: Found error trace [2018-06-22 11:03:13,196 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:13,196 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:13,197 INFO ]: Analyzing trace with hash -1246610452, now seen corresponding path program 6 times [2018-06-22 11:03:13,197 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:13,197 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:13,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:13,197 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:13,197 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:13,211 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:13,636 INFO ]: Checked inductivity of 31 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:03:13,636 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:13,636 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:03:13,642 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:03:13,661 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-22 11:03:13,661 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:13,664 INFO ]: Computing forward predicates... [2018-06-22 11:03:13,944 INFO ]: Checked inductivity of 31 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-22 11:03:13,963 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:13,963 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2018-06-22 11:03:13,963 INFO ]: Interpolant automaton has 22 states [2018-06-22 11:03:13,963 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-22 11:03:13,963 INFO ]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:03:13,964 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 22 states. [2018-06-22 11:03:14,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:14,252 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-22 11:03:14,252 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:03:14,252 INFO ]: Start accepts. Automaton has 22 states. Word has length 41 [2018-06-22 11:03:14,252 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:14,252 INFO ]: With dead ends: 36 [2018-06-22 11:03:14,252 INFO ]: Without dead ends: 36 [2018-06-22 11:03:14,253 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:03:14,253 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-22 11:03:14,256 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-22 11:03:14,256 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-22 11:03:14,256 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-06-22 11:03:14,256 INFO ]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 41 [2018-06-22 11:03:14,256 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:14,256 INFO ]: Abstraction has 36 states and 39 transitions. [2018-06-22 11:03:14,256 INFO ]: Interpolant automaton has 22 states. [2018-06-22 11:03:14,256 INFO ]: Start isEmpty. Operand 36 states and 39 transitions. [2018-06-22 11:03:14,257 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:03:14,257 INFO ]: Found error trace [2018-06-22 11:03:14,257 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:14,257 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:14,257 INFO ]: Analyzing trace with hash -1749546354, now seen corresponding path program 7 times [2018-06-22 11:03:14,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:14,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:14,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:14,258 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:14,258 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:14,269 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:14,648 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:03:14,648 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:14,648 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:03:14,653 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:14,672 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:14,676 INFO ]: Computing forward predicates... [2018-06-22 11:03:14,791 INFO ]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:03:14,811 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:14,811 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-22 11:03:14,811 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:03:14,812 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:03:14,812 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:03:14,812 INFO ]: Start difference. First operand 36 states and 39 transitions. Second operand 15 states. [2018-06-22 11:03:14,974 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:14,974 INFO ]: Finished difference Result 48 states and 52 transitions. [2018-06-22 11:03:14,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:03:14,974 INFO ]: Start accepts. Automaton has 15 states. Word has length 45 [2018-06-22 11:03:14,974 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:14,975 INFO ]: With dead ends: 48 [2018-06-22 11:03:14,975 INFO ]: Without dead ends: 46 [2018-06-22 11:03:14,975 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 15 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:03:14,975 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:03:14,980 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-06-22 11:03:14,980 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:03:14,981 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-22 11:03:14,981 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 45 [2018-06-22 11:03:14,981 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:14,981 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-22 11:03:14,981 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:03:14,981 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-22 11:03:14,982 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:03:14,982 INFO ]: Found error trace [2018-06-22 11:03:14,982 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:14,982 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:14,982 INFO ]: Analyzing trace with hash 712125616, now seen corresponding path program 8 times [2018-06-22 11:03:14,982 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:14,982 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:14,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:14,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:14,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:14,994 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:15,803 INFO ]: Checked inductivity of 57 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:03:15,803 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:15,803 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:03:15,814 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:15,845 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:15,845 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:15,847 INFO ]: Computing forward predicates... [2018-06-22 11:03:16,118 INFO ]: Checked inductivity of 57 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:03:16,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:16,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-06-22 11:03:16,137 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:03:16,138 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:03:16,138 INFO ]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:03:16,138 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 23 states. [2018-06-22 11:03:16,340 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:16,341 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-22 11:03:16,341 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:03:16,341 INFO ]: Start accepts. Automaton has 23 states. Word has length 49 [2018-06-22 11:03:16,341 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:16,341 INFO ]: With dead ends: 46 [2018-06-22 11:03:16,342 INFO ]: Without dead ends: 38 [2018-06-22 11:03:16,342 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:03:16,342 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-22 11:03:16,344 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-22 11:03:16,344 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-22 11:03:16,344 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-22 11:03:16,344 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 49 [2018-06-22 11:03:16,345 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:16,345 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-22 11:03:16,345 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:03:16,345 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-22 11:03:16,345 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:03:16,345 INFO ]: Found error trace [2018-06-22 11:03:16,345 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:16,345 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:16,346 INFO ]: Analyzing trace with hash 1694819667, now seen corresponding path program 9 times [2018-06-22 11:03:16,346 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:16,346 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:16,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:16,346 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:16,346 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:16,355 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:16,688 INFO ]: Checked inductivity of 57 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:03:16,688 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:16,713 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:16,718 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:03:16,742 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-22 11:03:16,742 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:16,746 INFO ]: Computing forward predicates... [2018-06-22 11:03:16,941 INFO ]: Checked inductivity of 57 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:03:16,960 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:16,960 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2018-06-22 11:03:16,961 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:03:16,961 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:03:16,961 INFO ]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:03:16,961 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 26 states. [2018-06-22 11:03:17,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:17,400 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-22 11:03:17,400 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:03:17,400 INFO ]: Start accepts. Automaton has 26 states. Word has length 49 [2018-06-22 11:03:17,400 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:17,400 INFO ]: With dead ends: 40 [2018-06-22 11:03:17,400 INFO ]: Without dead ends: 40 [2018-06-22 11:03:17,401 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:03:17,401 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-22 11:03:17,403 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-22 11:03:17,403 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-22 11:03:17,404 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-22 11:03:17,404 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 49 [2018-06-22 11:03:17,404 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:17,404 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-22 11:03:17,404 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:03:17,404 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-22 11:03:17,405 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:03:17,405 INFO ]: Found error trace [2018-06-22 11:03:17,405 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:17,405 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:17,405 INFO ]: Analyzing trace with hash 386326069, now seen corresponding path program 10 times [2018-06-22 11:03:17,405 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:17,405 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:17,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:17,406 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:17,406 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:17,417 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:17,648 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:03:17,649 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:17,649 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:17,654 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:03:17,680 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:03:17,680 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:17,684 INFO ]: Computing forward predicates... [2018-06-22 11:03:17,887 INFO ]: Checked inductivity of 72 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 11:03:17,907 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:17,907 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-22 11:03:17,907 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:03:17,908 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:03:17,908 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:03:17,908 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 17 states. [2018-06-22 11:03:18,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:18,172 INFO ]: Finished difference Result 54 states and 58 transitions. [2018-06-22 11:03:18,172 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:03:18,172 INFO ]: Start accepts. Automaton has 17 states. Word has length 53 [2018-06-22 11:03:18,172 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:18,172 INFO ]: With dead ends: 54 [2018-06-22 11:03:18,172 INFO ]: Without dead ends: 52 [2018-06-22 11:03:18,173 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 19 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:03:18,173 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:03:18,179 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-06-22 11:03:18,179 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:03:18,180 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-06-22 11:03:18,180 INFO ]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 53 [2018-06-22 11:03:18,180 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:18,180 INFO ]: Abstraction has 44 states and 48 transitions. [2018-06-22 11:03:18,180 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:03:18,180 INFO ]: Start isEmpty. Operand 44 states and 48 transitions. [2018-06-22 11:03:18,181 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:03:18,181 INFO ]: Found error trace [2018-06-22 11:03:18,181 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:18,181 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:18,181 INFO ]: Analyzing trace with hash 816290455, now seen corresponding path program 11 times [2018-06-22 11:03:18,181 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:18,181 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:18,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:18,182 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:18,182 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:18,193 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:18,735 INFO ]: Checked inductivity of 91 backedges. 22 proven. 32 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:03:18,735 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:18,735 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:18,753 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:03:18,782 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:03:18,782 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:18,785 INFO ]: Computing forward predicates... [2018-06-22 11:03:19,062 INFO ]: Checked inductivity of 91 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:03:19,081 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:19,081 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-06-22 11:03:19,081 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:03:19,081 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:03:19,081 INFO ]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:03:19,081 INFO ]: Start difference. First operand 44 states and 48 transitions. Second operand 27 states. [2018-06-22 11:03:19,395 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:19,395 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-22 11:03:19,395 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:03:19,395 INFO ]: Start accepts. Automaton has 27 states. Word has length 57 [2018-06-22 11:03:19,395 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:19,395 INFO ]: With dead ends: 52 [2018-06-22 11:03:19,396 INFO ]: Without dead ends: 42 [2018-06-22 11:03:19,396 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=1183, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:03:19,396 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-22 11:03:19,398 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-22 11:03:19,398 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-22 11:03:19,399 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-06-22 11:03:19,399 INFO ]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 57 [2018-06-22 11:03:19,399 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:19,399 INFO ]: Abstraction has 42 states and 45 transitions. [2018-06-22 11:03:19,399 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:03:19,399 INFO ]: Start isEmpty. Operand 42 states and 45 transitions. [2018-06-22 11:03:19,400 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:03:19,400 INFO ]: Found error trace [2018-06-22 11:03:19,400 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:19,400 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:19,400 INFO ]: Analyzing trace with hash -270962182, now seen corresponding path program 12 times [2018-06-22 11:03:19,400 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:19,400 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:19,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:19,400 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:19,400 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:19,410 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:19,829 INFO ]: Checked inductivity of 91 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:03:19,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:19,829 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:19,835 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:03:19,862 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-22 11:03:19,862 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:19,864 INFO ]: Computing forward predicates... [2018-06-22 11:03:20,104 INFO ]: Checked inductivity of 91 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 11:03:20,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:20,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2018-06-22 11:03:20,123 INFO ]: Interpolant automaton has 30 states [2018-06-22 11:03:20,123 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-22 11:03:20,123 INFO ]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:03:20,123 INFO ]: Start difference. First operand 42 states and 45 transitions. Second operand 30 states. [2018-06-22 11:03:20,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:20,486 INFO ]: Finished difference Result 44 states and 47 transitions. [2018-06-22 11:03:20,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:03:20,487 INFO ]: Start accepts. Automaton has 30 states. Word has length 57 [2018-06-22 11:03:20,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:20,488 INFO ]: With dead ends: 44 [2018-06-22 11:03:20,488 INFO ]: Without dead ends: 44 [2018-06-22 11:03:20,488 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:03:20,488 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 11:03:20,492 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 11:03:20,492 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 11:03:20,493 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-22 11:03:20,493 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 57 [2018-06-22 11:03:20,493 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:20,493 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-22 11:03:20,493 INFO ]: Interpolant automaton has 30 states. [2018-06-22 11:03:20,493 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-22 11:03:20,494 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:03:20,494 INFO ]: Found error trace [2018-06-22 11:03:20,494 INFO ]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:20,494 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:20,494 INFO ]: Analyzing trace with hash -1652308708, now seen corresponding path program 13 times [2018-06-22 11:03:20,494 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:20,494 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:20,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:20,495 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:20,495 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:20,506 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:20,952 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:03:20,952 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:20,952 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:20,957 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:20,985 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:20,989 INFO ]: Computing forward predicates... [2018-06-22 11:03:21,153 INFO ]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 11:03:21,172 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:21,172 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-22 11:03:21,173 INFO ]: Interpolant automaton has 19 states [2018-06-22 11:03:21,173 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-22 11:03:21,173 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-22 11:03:21,173 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 19 states. [2018-06-22 11:03:21,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:21,660 INFO ]: Finished difference Result 60 states and 64 transitions. [2018-06-22 11:03:21,661 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:03:21,661 INFO ]: Start accepts. Automaton has 19 states. Word has length 61 [2018-06-22 11:03:21,661 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:21,662 INFO ]: With dead ends: 60 [2018-06-22 11:03:21,662 INFO ]: Without dead ends: 58 [2018-06-22 11:03:21,662 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 23 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:03:21,662 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:03:21,676 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-06-22 11:03:21,676 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:03:21,676 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-06-22 11:03:21,676 INFO ]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 61 [2018-06-22 11:03:21,677 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:21,677 INFO ]: Abstraction has 48 states and 52 transitions. [2018-06-22 11:03:21,677 INFO ]: Interpolant automaton has 19 states. [2018-06-22 11:03:21,677 INFO ]: Start isEmpty. Operand 48 states and 52 transitions. [2018-06-22 11:03:21,680 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:03:21,680 INFO ]: Found error trace [2018-06-22 11:03:21,680 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:21,680 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:21,680 INFO ]: Analyzing trace with hash 594234302, now seen corresponding path program 14 times [2018-06-22 11:03:21,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:21,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:21,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:21,681 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:21,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:21,691 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:21,893 INFO ]: Checked inductivity of 133 backedges. 32 proven. 45 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:03:21,893 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:21,893 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:21,898 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:21,926 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:21,926 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:21,930 INFO ]: Computing forward predicates... [2018-06-22 11:03:22,173 INFO ]: Checked inductivity of 133 backedges. 42 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:03:22,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:22,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-06-22 11:03:22,193 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:03:22,193 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:03:22,193 INFO ]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:03:22,193 INFO ]: Start difference. First operand 48 states and 52 transitions. Second operand 31 states. [2018-06-22 11:03:22,615 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:22,615 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-22 11:03:22,615 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-22 11:03:22,615 INFO ]: Start accepts. Automaton has 31 states. Word has length 65 [2018-06-22 11:03:22,616 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:22,616 INFO ]: With dead ends: 58 [2018-06-22 11:03:22,616 INFO ]: Without dead ends: 46 [2018-06-22 11:03:22,617 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1592, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:03:22,617 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 11:03:22,620 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-22 11:03:22,620 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 11:03:22,620 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-06-22 11:03:22,620 INFO ]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 65 [2018-06-22 11:03:22,620 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:22,620 INFO ]: Abstraction has 46 states and 49 transitions. [2018-06-22 11:03:22,620 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:03:22,620 INFO ]: Start isEmpty. Operand 46 states and 49 transitions. [2018-06-22 11:03:22,621 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:03:22,621 INFO ]: Found error trace [2018-06-22 11:03:22,621 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:22,621 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:22,621 INFO ]: Analyzing trace with hash 1691677153, now seen corresponding path program 15 times [2018-06-22 11:03:22,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:22,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:22,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:22,621 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:22,622 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:22,633 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:22,865 INFO ]: Checked inductivity of 133 backedges. 20 proven. 57 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:03:22,865 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:22,865 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:22,884 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:03:22,916 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-22 11:03:22,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:22,920 INFO ]: Computing forward predicates... [2018-06-22 11:03:23,185 INFO ]: Checked inductivity of 133 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-06-22 11:03:23,204 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:23,204 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2018-06-22 11:03:23,204 INFO ]: Interpolant automaton has 34 states [2018-06-22 11:03:23,204 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 11:03:23,205 INFO ]: CoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:03:23,205 INFO ]: Start difference. First operand 46 states and 49 transitions. Second operand 34 states. [2018-06-22 11:03:23,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:23,875 INFO ]: Finished difference Result 48 states and 51 transitions. [2018-06-22 11:03:23,875 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:03:23,875 INFO ]: Start accepts. Automaton has 34 states. Word has length 65 [2018-06-22 11:03:23,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:23,876 INFO ]: With dead ends: 48 [2018-06-22 11:03:23,876 INFO ]: Without dead ends: 48 [2018-06-22 11:03:23,877 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=352, Invalid=1904, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:03:23,877 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 11:03:23,879 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-22 11:03:23,880 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 11:03:23,883 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-06-22 11:03:23,883 INFO ]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 65 [2018-06-22 11:03:23,883 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:23,883 INFO ]: Abstraction has 48 states and 51 transitions. [2018-06-22 11:03:23,883 INFO ]: Interpolant automaton has 34 states. [2018-06-22 11:03:23,883 INFO ]: Start isEmpty. Operand 48 states and 51 transitions. [2018-06-22 11:03:23,883 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 11:03:23,883 INFO ]: Found error trace [2018-06-22 11:03:23,883 INFO ]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:23,884 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:23,884 INFO ]: Analyzing trace with hash 214945603, now seen corresponding path program 16 times [2018-06-22 11:03:23,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:23,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:23,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:23,884 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:23,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:23,901 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:24,211 INFO ]: Checked inductivity of 156 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:03:24,211 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:24,211 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:24,217 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:03:24,249 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:03:24,249 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:24,255 INFO ]: Computing forward predicates... [2018-06-22 11:03:24,814 INFO ]: Checked inductivity of 156 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-06-22 11:03:24,832 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:24,832 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-22 11:03:24,832 INFO ]: Interpolant automaton has 21 states [2018-06-22 11:03:24,832 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-22 11:03:24,832 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:03:24,833 INFO ]: Start difference. First operand 48 states and 51 transitions. Second operand 21 states. [2018-06-22 11:03:25,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:25,198 INFO ]: Finished difference Result 66 states and 70 transitions. [2018-06-22 11:03:25,199 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:03:25,199 INFO ]: Start accepts. Automaton has 21 states. Word has length 69 [2018-06-22 11:03:25,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:25,199 INFO ]: With dead ends: 66 [2018-06-22 11:03:25,199 INFO ]: Without dead ends: 64 [2018-06-22 11:03:25,200 INFO ]: 0 DeclaredPredicates, 112 GetRequests, 53 SyntacticMatches, 27 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=1031, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 11:03:25,200 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:03:25,203 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 52. [2018-06-22 11:03:25,203 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:03:25,204 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-06-22 11:03:25,204 INFO ]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 69 [2018-06-22 11:03:25,204 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:25,204 INFO ]: Abstraction has 52 states and 56 transitions. [2018-06-22 11:03:25,204 INFO ]: Interpolant automaton has 21 states. [2018-06-22 11:03:25,204 INFO ]: Start isEmpty. Operand 52 states and 56 transitions. [2018-06-22 11:03:25,204 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:03:25,204 INFO ]: Found error trace [2018-06-22 11:03:25,205 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:25,205 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:25,205 INFO ]: Analyzing trace with hash -396734427, now seen corresponding path program 17 times [2018-06-22 11:03:25,205 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:25,205 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:25,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:25,205 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:25,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:25,218 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:25,829 INFO ]: Checked inductivity of 183 backedges. 44 proven. 60 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:03:25,829 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:25,829 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:25,834 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:03:25,878 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-22 11:03:25,878 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:25,881 INFO ]: Computing forward predicates... [2018-06-22 11:03:26,674 INFO ]: Checked inductivity of 183 backedges. 56 proven. 48 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:03:26,693 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:26,693 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-06-22 11:03:26,694 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:03:26,694 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:03:26,694 INFO ]: CoverageRelationStatistics Valid=200, Invalid=990, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:03:26,694 INFO ]: Start difference. First operand 52 states and 56 transitions. Second operand 35 states. [2018-06-22 11:03:27,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:27,224 INFO ]: Finished difference Result 64 states and 67 transitions. [2018-06-22 11:03:27,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:03:27,224 INFO ]: Start accepts. Automaton has 35 states. Word has length 73 [2018-06-22 11:03:27,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:27,225 INFO ]: With dead ends: 64 [2018-06-22 11:03:27,225 INFO ]: Without dead ends: 50 [2018-06-22 11:03:27,225 INFO ]: 0 DeclaredPredicates, 117 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=389, Invalid=2061, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:03:27,225 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 11:03:27,228 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-22 11:03:27,228 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-22 11:03:27,228 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-06-22 11:03:27,228 INFO ]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 73 [2018-06-22 11:03:27,228 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:27,228 INFO ]: Abstraction has 50 states and 53 transitions. [2018-06-22 11:03:27,228 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:03:27,228 INFO ]: Start isEmpty. Operand 50 states and 53 transitions. [2018-06-22 11:03:27,229 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 11:03:27,229 INFO ]: Found error trace [2018-06-22 11:03:27,229 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:27,229 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:27,229 INFO ]: Analyzing trace with hash -56593144, now seen corresponding path program 18 times [2018-06-22 11:03:27,229 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:27,229 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:27,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:27,230 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:27,230 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:27,241 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:27,622 INFO ]: Checked inductivity of 183 backedges. 30 proven. 74 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-06-22 11:03:27,622 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:27,622 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:27,638 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:03:27,702 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-22 11:03:27,702 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:27,712 INFO ]: Computing forward predicates... [2018-06-22 11:03:28,959 INFO ]: Checked inductivity of 183 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 11:03:28,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:28,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 38 [2018-06-22 11:03:28,979 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:03:28,979 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:03:28,979 INFO ]: CoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:03:28,979 INFO ]: Start difference. First operand 50 states and 53 transitions. Second operand 38 states. [2018-06-22 11:03:29,405 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:29,405 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-22 11:03:29,405 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:03:29,405 INFO ]: Start accepts. Automaton has 38 states. Word has length 73 [2018-06-22 11:03:29,405 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:29,406 INFO ]: With dead ends: 52 [2018-06-22 11:03:29,406 INFO ]: Without dead ends: 52 [2018-06-22 11:03:29,406 INFO ]: 0 DeclaredPredicates, 120 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=448, Invalid=2414, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:03:29,407 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 11:03:29,409 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-06-22 11:03:29,409 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 11:03:29,410 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-06-22 11:03:29,410 INFO ]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 73 [2018-06-22 11:03:29,410 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:29,410 INFO ]: Abstraction has 52 states and 55 transitions. [2018-06-22 11:03:29,410 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:03:29,410 INFO ]: Start isEmpty. Operand 52 states and 55 transitions. [2018-06-22 11:03:29,410 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:03:29,410 INFO ]: Found error trace [2018-06-22 11:03:29,410 INFO ]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:29,411 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:29,411 INFO ]: Analyzing trace with hash -7336790, now seen corresponding path program 19 times [2018-06-22 11:03:29,411 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:29,411 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:29,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:29,411 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:29,411 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:29,426 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:29,852 INFO ]: Checked inductivity of 210 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 11:03:29,852 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:29,852 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:29,858 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:29,895 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:29,899 INFO ]: Computing forward predicates... [2018-06-22 11:03:30,589 INFO ]: Checked inductivity of 210 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-06-22 11:03:30,608 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:30,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-22 11:03:30,608 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:03:30,608 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:03:30,609 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:03:30,609 INFO ]: Start difference. First operand 52 states and 55 transitions. Second operand 23 states. [2018-06-22 11:03:31,097 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:31,097 INFO ]: Finished difference Result 72 states and 76 transitions. [2018-06-22 11:03:31,097 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:03:31,097 INFO ]: Start accepts. Automaton has 23 states. Word has length 77 [2018-06-22 11:03:31,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:31,098 INFO ]: With dead ends: 72 [2018-06-22 11:03:31,098 INFO ]: Without dead ends: 70 [2018-06-22 11:03:31,098 INFO ]: 0 DeclaredPredicates, 126 GetRequests, 59 SyntacticMatches, 31 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=1303, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:03:31,098 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:03:31,101 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 56. [2018-06-22 11:03:31,101 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:03:31,102 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-06-22 11:03:31,102 INFO ]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 77 [2018-06-22 11:03:31,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:31,102 INFO ]: Abstraction has 56 states and 60 transitions. [2018-06-22 11:03:31,102 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:03:31,102 INFO ]: Start isEmpty. Operand 56 states and 60 transitions. [2018-06-22 11:03:31,103 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:03:31,103 INFO ]: Found error trace [2018-06-22 11:03:31,103 INFO ]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:31,103 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:31,103 INFO ]: Analyzing trace with hash 719915887, now seen corresponding path program 20 times [2018-06-22 11:03:31,103 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:31,103 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:31,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:31,104 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:31,104 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:31,116 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:31,446 INFO ]: Checked inductivity of 241 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 11:03:31,446 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:31,446 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:31,454 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:31,493 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:31,493 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:31,497 INFO ]: Computing forward predicates... [2018-06-22 11:03:32,021 INFO ]: Checked inductivity of 241 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-22 11:03:32,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:32,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 42 [2018-06-22 11:03:32,041 INFO ]: Interpolant automaton has 42 states [2018-06-22 11:03:32,041 INFO ]: Constructing interpolant automaton starting with 42 interpolants. [2018-06-22 11:03:32,041 INFO ]: CoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:03:32,041 INFO ]: Start difference. First operand 56 states and 60 transitions. Second operand 42 states. [2018-06-22 11:03:33,320 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:33,320 INFO ]: Finished difference Result 72 states and 76 transitions. [2018-06-22 11:03:33,320 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-22 11:03:33,320 INFO ]: Start accepts. Automaton has 42 states. Word has length 81 [2018-06-22 11:03:33,321 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:33,321 INFO ]: With dead ends: 72 [2018-06-22 11:03:33,321 INFO ]: Without dead ends: 72 [2018-06-22 11:03:33,322 INFO ]: 0 DeclaredPredicates, 141 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=663, Invalid=3759, Unknown=0, NotChecked=0, Total=4422 [2018-06-22 11:03:33,323 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:03:33,329 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 54. [2018-06-22 11:03:33,329 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 11:03:33,329 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-06-22 11:03:33,329 INFO ]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 81 [2018-06-22 11:03:33,330 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:33,330 INFO ]: Abstraction has 54 states and 57 transitions. [2018-06-22 11:03:33,330 INFO ]: Interpolant automaton has 42 states. [2018-06-22 11:03:33,330 INFO ]: Start isEmpty. Operand 54 states and 57 transitions. [2018-06-22 11:03:33,330 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-22 11:03:33,330 INFO ]: Found error trace [2018-06-22 11:03:33,330 INFO ]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:33,330 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:33,331 INFO ]: Analyzing trace with hash -317343796, now seen corresponding path program 21 times [2018-06-22 11:03:33,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:33,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:33,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:33,331 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:33,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:33,343 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:34,152 INFO ]: Checked inductivity of 241 backedges. 58 proven. 77 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-06-22 11:03:34,152 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:34,152 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:34,158 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:03:34,329 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-22 11:03:34,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:34,334 INFO ]: Computing forward predicates... [2018-06-22 11:03:35,002 INFO ]: Checked inductivity of 241 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-06-22 11:03:35,022 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:35,022 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2018-06-22 11:03:35,023 INFO ]: Interpolant automaton has 41 states [2018-06-22 11:03:35,023 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-22 11:03:35,023 INFO ]: CoverageRelationStatistics Valid=270, Invalid=1370, Unknown=0, NotChecked=0, Total=1640 [2018-06-22 11:03:35,023 INFO ]: Start difference. First operand 54 states and 57 transitions. Second operand 41 states. [2018-06-22 11:03:35,676 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:35,676 INFO ]: Finished difference Result 72 states and 75 transitions. [2018-06-22 11:03:35,676 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-22 11:03:35,676 INFO ]: Start accepts. Automaton has 41 states. Word has length 81 [2018-06-22 11:03:35,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:35,677 INFO ]: With dead ends: 72 [2018-06-22 11:03:35,677 INFO ]: Without dead ends: 56 [2018-06-22 11:03:35,678 INFO ]: 0 DeclaredPredicates, 131 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=509, Invalid=2797, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 11:03:35,678 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 11:03:35,680 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 11:03:35,681 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 11:03:35,681 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-06-22 11:03:35,681 INFO ]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 81 [2018-06-22 11:03:35,681 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:35,681 INFO ]: Abstraction has 56 states and 59 transitions. [2018-06-22 11:03:35,681 INFO ]: Interpolant automaton has 41 states. [2018-06-22 11:03:35,681 INFO ]: Start isEmpty. Operand 56 states and 59 transitions. [2018-06-22 11:03:35,682 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:03:35,682 INFO ]: Found error trace [2018-06-22 11:03:35,682 INFO ]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:35,682 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:35,682 INFO ]: Analyzing trace with hash -1704096431, now seen corresponding path program 22 times [2018-06-22 11:03:35,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:35,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:35,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:35,683 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:35,683 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:35,699 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:36,662 INFO ]: Checked inductivity of 272 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-06-22 11:03:36,662 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:36,662 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:36,668 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:03:36,706 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:03:36,706 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:36,711 INFO ]: Computing forward predicates... [2018-06-22 11:03:36,979 INFO ]: Checked inductivity of 272 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-06-22 11:03:36,999 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:36,999 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-22 11:03:36,999 INFO ]: Interpolant automaton has 25 states [2018-06-22 11:03:36,999 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-22 11:03:37,000 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-22 11:03:37,000 INFO ]: Start difference. First operand 56 states and 59 transitions. Second operand 25 states. [2018-06-22 11:03:37,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:37,571 INFO ]: Finished difference Result 78 states and 82 transitions. [2018-06-22 11:03:37,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:03:37,572 INFO ]: Start accepts. Automaton has 25 states. Word has length 85 [2018-06-22 11:03:37,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:37,572 INFO ]: With dead ends: 78 [2018-06-22 11:03:37,572 INFO ]: Without dead ends: 76 [2018-06-22 11:03:37,573 INFO ]: 0 DeclaredPredicates, 140 GetRequests, 65 SyntacticMatches, 35 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=1607, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:03:37,573 INFO ]: Start minimizeSevpa. Operand 76 states. [2018-06-22 11:03:37,577 INFO ]: Finished minimizeSevpa. Reduced states from 76 to 60. [2018-06-22 11:03:37,577 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:03:37,578 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-06-22 11:03:37,578 INFO ]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 85 [2018-06-22 11:03:37,578 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:37,578 INFO ]: Abstraction has 60 states and 64 transitions. [2018-06-22 11:03:37,578 INFO ]: Interpolant automaton has 25 states. [2018-06-22 11:03:37,578 INFO ]: Start isEmpty. Operand 60 states and 64 transitions. [2018-06-22 11:03:37,579 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:03:37,579 INFO ]: Found error trace [2018-06-22 11:03:37,579 INFO ]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:37,579 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:37,579 INFO ]: Analyzing trace with hash -1203596621, now seen corresponding path program 23 times [2018-06-22 11:03:37,579 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:37,579 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:37,579 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:37,580 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:37,580 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:37,594 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:38,049 INFO ]: Checked inductivity of 307 backedges. 74 proven. 96 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-22 11:03:38,049 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:38,049 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:38,055 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:03:38,108 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-22 11:03:38,108 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:38,112 INFO ]: Computing forward predicates... [2018-06-22 11:03:38,726 INFO ]: Checked inductivity of 307 backedges. 90 proven. 80 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-22 11:03:38,746 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:38,746 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2018-06-22 11:03:38,746 INFO ]: Interpolant automaton has 43 states [2018-06-22 11:03:38,746 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-22 11:03:38,746 INFO ]: CoverageRelationStatistics Valid=308, Invalid=1498, Unknown=0, NotChecked=0, Total=1806 [2018-06-22 11:03:38,746 INFO ]: Start difference. First operand 60 states and 64 transitions. Second operand 43 states. [2018-06-22 11:03:39,299 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:39,299 INFO ]: Finished difference Result 76 states and 79 transitions. [2018-06-22 11:03:39,299 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-22 11:03:39,299 INFO ]: Start accepts. Automaton has 43 states. Word has length 89 [2018-06-22 11:03:39,300 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:39,300 INFO ]: With dead ends: 76 [2018-06-22 11:03:39,300 INFO ]: Without dead ends: 58 [2018-06-22 11:03:39,301 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=603, Invalid=3179, Unknown=0, NotChecked=0, Total=3782 [2018-06-22 11:03:39,301 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-22 11:03:39,304 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-06-22 11:03:39,304 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-22 11:03:39,304 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-06-22 11:03:39,304 INFO ]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 89 [2018-06-22 11:03:39,304 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:39,304 INFO ]: Abstraction has 58 states and 61 transitions. [2018-06-22 11:03:39,304 INFO ]: Interpolant automaton has 43 states. [2018-06-22 11:03:39,304 INFO ]: Start isEmpty. Operand 58 states and 61 transitions. [2018-06-22 11:03:39,305 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 11:03:39,305 INFO ]: Found error trace [2018-06-22 11:03:39,305 INFO ]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:39,305 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:39,305 INFO ]: Analyzing trace with hash -278936298, now seen corresponding path program 24 times [2018-06-22 11:03:39,305 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:39,305 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:39,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:39,306 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:39,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:39,320 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:39,770 INFO ]: Checked inductivity of 307 backedges. 56 proven. 114 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-06-22 11:03:39,770 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:39,770 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-22 11:03:39,780 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:39,829 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-22 11:03:39,829 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:39,839 INFO ]: Computing forward predicates... [2018-06-22 11:03:40,381 INFO ]: Checked inductivity of 307 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-06-22 11:03:40,401 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:40,401 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 46 [2018-06-22 11:03:40,402 INFO ]: Interpolant automaton has 46 states [2018-06-22 11:03:40,402 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-22 11:03:40,402 INFO ]: CoverageRelationStatistics Valid=323, Invalid=1747, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:03:40,402 INFO ]: Start difference. First operand 58 states and 61 transitions. Second operand 46 states. [2018-06-22 11:03:41,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:41,677 INFO ]: Finished difference Result 60 states and 63 transitions. [2018-06-22 11:03:41,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:03:41,678 INFO ]: Start accepts. Automaton has 46 states. Word has length 89 [2018-06-22 11:03:41,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:41,678 INFO ]: With dead ends: 60 [2018-06-22 11:03:41,678 INFO ]: Without dead ends: 60 [2018-06-22 11:03:41,679 INFO ]: 0 DeclaredPredicates, 148 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=676, Invalid=3614, Unknown=0, NotChecked=0, Total=4290 [2018-06-22 11:03:41,679 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-22 11:03:41,682 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-22 11:03:41,682 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-22 11:03:41,683 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-06-22 11:03:41,683 INFO ]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 89 [2018-06-22 11:03:41,683 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:41,683 INFO ]: Abstraction has 60 states and 63 transitions. [2018-06-22 11:03:41,683 INFO ]: Interpolant automaton has 46 states. [2018-06-22 11:03:41,683 INFO ]: Start isEmpty. Operand 60 states and 63 transitions. [2018-06-22 11:03:41,683 INFO ]: Finished isEmpty. Found accepting run of length 94 [2018-06-22 11:03:41,683 INFO ]: Found error trace [2018-06-22 11:03:41,684 INFO ]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:41,684 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:41,684 INFO ]: Analyzing trace with hash -1659543240, now seen corresponding path program 25 times [2018-06-22 11:03:41,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:41,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:41,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:41,684 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:41,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:41,700 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:42,483 INFO ]: Checked inductivity of 342 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-22 11:03:42,483 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:42,483 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:42,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:42,540 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:42,547 INFO ]: Computing forward predicates... [2018-06-22 11:03:42,833 INFO ]: Checked inductivity of 342 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-06-22 11:03:42,852 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:42,852 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-22 11:03:42,853 INFO ]: Interpolant automaton has 27 states [2018-06-22 11:03:42,853 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-22 11:03:42,853 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-22 11:03:42,853 INFO ]: Start difference. First operand 60 states and 63 transitions. Second operand 27 states. [2018-06-22 11:03:43,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:43,703 INFO ]: Finished difference Result 84 states and 88 transitions. [2018-06-22 11:03:43,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:03:43,724 INFO ]: Start accepts. Automaton has 27 states. Word has length 93 [2018-06-22 11:03:43,724 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:43,725 INFO ]: With dead ends: 84 [2018-06-22 11:03:43,725 INFO ]: Without dead ends: 82 [2018-06-22 11:03:43,725 INFO ]: 0 DeclaredPredicates, 154 GetRequests, 71 SyntacticMatches, 39 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=127, Invalid=1943, Unknown=0, NotChecked=0, Total=2070 [2018-06-22 11:03:43,725 INFO ]: Start minimizeSevpa. Operand 82 states. [2018-06-22 11:03:43,727 INFO ]: Finished minimizeSevpa. Reduced states from 82 to 64. [2018-06-22 11:03:43,727 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:03:43,728 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-06-22 11:03:43,728 INFO ]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 93 [2018-06-22 11:03:43,728 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:43,728 INFO ]: Abstraction has 64 states and 68 transitions. [2018-06-22 11:03:43,728 INFO ]: Interpolant automaton has 27 states. [2018-06-22 11:03:43,728 INFO ]: Start isEmpty. Operand 64 states and 68 transitions. [2018-06-22 11:03:43,729 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:03:43,729 INFO ]: Found error trace [2018-06-22 11:03:43,729 INFO ]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:43,729 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:43,729 INFO ]: Analyzing trace with hash -1165365030, now seen corresponding path program 26 times [2018-06-22 11:03:43,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:43,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:43,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:43,730 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:43,730 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:43,743 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:44,880 INFO ]: Checked inductivity of 381 backedges. 92 proven. 117 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-06-22 11:03:44,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:44,880 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:44,895 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:44,940 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:44,940 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:44,944 INFO ]: Computing forward predicates... [2018-06-22 11:03:45,422 INFO ]: Checked inductivity of 381 backedges. 110 proven. 99 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-06-22 11:03:45,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:45,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2018-06-22 11:03:45,443 INFO ]: Interpolant automaton has 47 states [2018-06-22 11:03:45,443 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-22 11:03:45,444 INFO ]: CoverageRelationStatistics Valid=371, Invalid=1791, Unknown=0, NotChecked=0, Total=2162 [2018-06-22 11:03:45,444 INFO ]: Start difference. First operand 64 states and 68 transitions. Second operand 47 states. [2018-06-22 11:03:45,958 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:45,958 INFO ]: Finished difference Result 82 states and 85 transitions. [2018-06-22 11:03:45,958 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 11:03:45,958 INFO ]: Start accepts. Automaton has 47 states. Word has length 97 [2018-06-22 11:03:45,959 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:45,959 INFO ]: With dead ends: 82 [2018-06-22 11:03:45,959 INFO ]: Without dead ends: 62 [2018-06-22 11:03:45,959 INFO ]: 0 DeclaredPredicates, 159 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=728, Invalid=3828, Unknown=0, NotChecked=0, Total=4556 [2018-06-22 11:03:45,959 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-22 11:03:45,961 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-06-22 11:03:45,961 INFO ]: Start removeUnreachable. Operand 62 states. [2018-06-22 11:03:45,962 INFO ]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-06-22 11:03:45,962 INFO ]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 97 [2018-06-22 11:03:45,962 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:45,962 INFO ]: Abstraction has 62 states and 65 transitions. [2018-06-22 11:03:45,962 INFO ]: Interpolant automaton has 47 states. [2018-06-22 11:03:45,962 INFO ]: Start isEmpty. Operand 62 states and 65 transitions. [2018-06-22 11:03:45,963 INFO ]: Finished isEmpty. Found accepting run of length 98 [2018-06-22 11:03:45,963 INFO ]: Found error trace [2018-06-22 11:03:45,963 INFO ]: trace histogram [11, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:45,963 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:45,963 INFO ]: Analyzing trace with hash 1723445757, now seen corresponding path program 27 times [2018-06-22 11:03:45,963 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:45,963 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:45,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:45,963 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:45,963 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:45,977 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:46,353 INFO ]: Checked inductivity of 381 backedges. 72 proven. 137 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-06-22 11:03:46,353 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:46,353 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:46,358 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:03:46,568 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-22 11:03:46,568 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:46,574 INFO ]: Computing forward predicates... [2018-06-22 11:03:47,222 INFO ]: Checked inductivity of 381 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-06-22 11:03:47,242 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:47,242 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 50 [2018-06-22 11:03:47,243 INFO ]: Interpolant automaton has 50 states [2018-06-22 11:03:47,243 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-22 11:03:47,243 INFO ]: CoverageRelationStatistics Valid=387, Invalid=2063, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:03:47,243 INFO ]: Start difference. First operand 62 states and 65 transitions. Second operand 50 states. [2018-06-22 11:03:48,677 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:48,677 INFO ]: Finished difference Result 64 states and 67 transitions. [2018-06-22 11:03:48,677 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:03:48,677 INFO ]: Start accepts. Automaton has 50 states. Word has length 97 [2018-06-22 11:03:48,677 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:48,677 INFO ]: With dead ends: 64 [2018-06-22 11:03:48,677 INFO ]: Without dead ends: 64 [2018-06-22 11:03:48,678 INFO ]: 0 DeclaredPredicates, 162 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=808, Invalid=4304, Unknown=0, NotChecked=0, Total=5112 [2018-06-22 11:03:48,678 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-22 11:03:48,680 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-06-22 11:03:48,680 INFO ]: Start removeUnreachable. Operand 64 states. [2018-06-22 11:03:48,681 INFO ]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-06-22 11:03:48,681 INFO ]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 97 [2018-06-22 11:03:48,681 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:48,681 INFO ]: Abstraction has 64 states and 67 transitions. [2018-06-22 11:03:48,681 INFO ]: Interpolant automaton has 50 states. [2018-06-22 11:03:48,681 INFO ]: Start isEmpty. Operand 64 states and 67 transitions. [2018-06-22 11:03:48,681 INFO ]: Finished isEmpty. Found accepting run of length 102 [2018-06-22 11:03:48,681 INFO ]: Found error trace [2018-06-22 11:03:48,682 INFO ]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:48,682 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:48,682 INFO ]: Analyzing trace with hash -1288136609, now seen corresponding path program 28 times [2018-06-22 11:03:48,682 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:48,682 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:48,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:48,682 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:48,682 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:48,696 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:49,300 INFO ]: Checked inductivity of 420 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-06-22 11:03:49,300 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:49,300 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:49,305 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:03:49,352 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:03:49,352 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:49,357 INFO ]: Computing forward predicates... [2018-06-22 11:03:49,914 INFO ]: Checked inductivity of 420 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-06-22 11:03:49,935 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:49,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-22 11:03:49,935 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:03:49,935 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:03:49,935 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:03:49,935 INFO ]: Start difference. First operand 64 states and 67 transitions. Second operand 29 states. [2018-06-22 11:03:50,691 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:50,691 INFO ]: Finished difference Result 90 states and 94 transitions. [2018-06-22 11:03:50,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:03:50,691 INFO ]: Start accepts. Automaton has 29 states. Word has length 101 [2018-06-22 11:03:50,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:50,692 INFO ]: With dead ends: 90 [2018-06-22 11:03:50,692 INFO ]: Without dead ends: 88 [2018-06-22 11:03:50,692 INFO ]: 0 DeclaredPredicates, 168 GetRequests, 77 SyntacticMatches, 43 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=139, Invalid=2311, Unknown=0, NotChecked=0, Total=2450 [2018-06-22 11:03:50,692 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-22 11:03:50,696 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 68. [2018-06-22 11:03:50,696 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:03:50,696 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-06-22 11:03:50,696 INFO ]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 101 [2018-06-22 11:03:50,697 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:50,697 INFO ]: Abstraction has 68 states and 72 transitions. [2018-06-22 11:03:50,697 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:03:50,697 INFO ]: Start isEmpty. Operand 68 states and 72 transitions. [2018-06-22 11:03:50,697 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:03:50,697 INFO ]: Found error trace [2018-06-22 11:03:50,697 INFO ]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:50,697 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:50,697 INFO ]: Analyzing trace with hash 1603854913, now seen corresponding path program 29 times [2018-06-22 11:03:50,697 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:50,697 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:50,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:50,698 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:50,698 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:50,711 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:51,142 INFO ]: Checked inductivity of 463 backedges. 112 proven. 140 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-06-22 11:03:51,142 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:51,142 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:51,147 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:03:51,203 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 11:03:51,203 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:51,208 INFO ]: Computing forward predicates... [2018-06-22 11:03:51,770 INFO ]: Checked inductivity of 463 backedges. 132 proven. 120 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-06-22 11:03:51,790 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:51,790 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 51 [2018-06-22 11:03:51,790 INFO ]: Interpolant automaton has 51 states [2018-06-22 11:03:51,790 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-22 11:03:51,791 INFO ]: CoverageRelationStatistics Valid=440, Invalid=2110, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:03:51,791 INFO ]: Start difference. First operand 68 states and 72 transitions. Second operand 51 states. [2018-06-22 11:03:52,477 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:52,477 INFO ]: Finished difference Result 88 states and 91 transitions. [2018-06-22 11:03:52,478 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:03:52,478 INFO ]: Start accepts. Automaton has 51 states. Word has length 105 [2018-06-22 11:03:52,478 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:52,478 INFO ]: With dead ends: 88 [2018-06-22 11:03:52,478 INFO ]: Without dead ends: 66 [2018-06-22 11:03:52,479 INFO ]: 0 DeclaredPredicates, 173 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=865, Invalid=4537, Unknown=0, NotChecked=0, Total=5402 [2018-06-22 11:03:52,479 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-22 11:03:52,481 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-06-22 11:03:52,481 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-22 11:03:52,481 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-06-22 11:03:52,481 INFO ]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 105 [2018-06-22 11:03:52,482 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:52,482 INFO ]: Abstraction has 66 states and 69 transitions. [2018-06-22 11:03:52,482 INFO ]: Interpolant automaton has 51 states. [2018-06-22 11:03:52,482 INFO ]: Start isEmpty. Operand 66 states and 69 transitions. [2018-06-22 11:03:52,483 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 11:03:52,483 INFO ]: Found error trace [2018-06-22 11:03:52,483 INFO ]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:52,484 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:52,484 INFO ]: Analyzing trace with hash -1682972124, now seen corresponding path program 30 times [2018-06-22 11:03:52,484 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:52,484 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:52,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:52,484 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:52,484 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:52,498 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:53,330 INFO ]: Checked inductivity of 463 backedges. 90 proven. 162 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2018-06-22 11:03:53,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:53,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:53,335 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-22 11:03:53,405 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-22 11:03:53,405 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:53,412 INFO ]: Computing forward predicates... [2018-06-22 11:03:54,041 WARN ]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-06-22 11:03:55,089 INFO ]: Checked inductivity of 463 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-06-22 11:03:55,117 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:55,117 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 54 [2018-06-22 11:03:55,117 INFO ]: Interpolant automaton has 54 states [2018-06-22 11:03:55,118 INFO ]: Constructing interpolant automaton starting with 54 interpolants. [2018-06-22 11:03:55,118 INFO ]: CoverageRelationStatistics Valid=457, Invalid=2405, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:03:55,118 INFO ]: Start difference. First operand 66 states and 69 transitions. Second operand 54 states. [2018-06-22 11:03:55,659 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-22 11:03:56,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:56,036 INFO ]: Finished difference Result 68 states and 71 transitions. [2018-06-22 11:03:56,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:03:56,036 INFO ]: Start accepts. Automaton has 54 states. Word has length 105 [2018-06-22 11:03:56,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:56,037 INFO ]: With dead ends: 68 [2018-06-22 11:03:56,037 INFO ]: Without dead ends: 68 [2018-06-22 11:03:56,037 INFO ]: 0 DeclaredPredicates, 176 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=952, Invalid=5054, Unknown=0, NotChecked=0, Total=6006 [2018-06-22 11:03:56,037 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-22 11:03:56,040 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-06-22 11:03:56,040 INFO ]: Start removeUnreachable. Operand 68 states. [2018-06-22 11:03:56,041 INFO ]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-06-22 11:03:56,041 INFO ]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 105 [2018-06-22 11:03:56,041 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:56,041 INFO ]: Abstraction has 68 states and 71 transitions. [2018-06-22 11:03:56,041 INFO ]: Interpolant automaton has 54 states. [2018-06-22 11:03:56,041 INFO ]: Start isEmpty. Operand 68 states and 71 transitions. [2018-06-22 11:03:56,042 INFO ]: Finished isEmpty. Found accepting run of length 110 [2018-06-22 11:03:56,042 INFO ]: Found error trace [2018-06-22 11:03:56,042 INFO ]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:56,042 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:56,042 INFO ]: Analyzing trace with hash 93078214, now seen corresponding path program 31 times [2018-06-22 11:03:56,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:56,042 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:56,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:56,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:03:56,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:56,060 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:56,695 INFO ]: Checked inductivity of 506 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-06-22 11:03:56,695 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:56,695 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:56,701 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:56,750 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:56,757 INFO ]: Computing forward predicates... [2018-06-22 11:03:57,160 INFO ]: Checked inductivity of 506 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-06-22 11:03:57,180 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:57,180 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-22 11:03:57,180 INFO ]: Interpolant automaton has 31 states [2018-06-22 11:03:57,180 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-22 11:03:57,180 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:03:57,180 INFO ]: Start difference. First operand 68 states and 71 transitions. Second operand 31 states. [2018-06-22 11:03:58,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:03:58,026 INFO ]: Finished difference Result 96 states and 100 transitions. [2018-06-22 11:03:58,026 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:03:58,026 INFO ]: Start accepts. Automaton has 31 states. Word has length 109 [2018-06-22 11:03:58,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:03:58,027 INFO ]: With dead ends: 96 [2018-06-22 11:03:58,027 INFO ]: Without dead ends: 94 [2018-06-22 11:03:58,028 INFO ]: 0 DeclaredPredicates, 182 GetRequests, 84 SyntacticMatches, 46 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=151, Invalid=2711, Unknown=0, NotChecked=0, Total=2862 [2018-06-22 11:03:58,028 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:03:58,032 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 72. [2018-06-22 11:03:58,032 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:03:58,032 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-06-22 11:03:58,032 INFO ]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 109 [2018-06-22 11:03:58,032 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:03:58,032 INFO ]: Abstraction has 72 states and 76 transitions. [2018-06-22 11:03:58,032 INFO ]: Interpolant automaton has 31 states. [2018-06-22 11:03:58,032 INFO ]: Start isEmpty. Operand 72 states and 76 transitions. [2018-06-22 11:03:58,033 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:03:58,033 INFO ]: Found error trace [2018-06-22 11:03:58,033 INFO ]: trace histogram [13, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:03:58,033 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:03:58,033 INFO ]: Analyzing trace with hash 1595963112, now seen corresponding path program 32 times [2018-06-22 11:03:58,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:03:58,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:03:58,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:58,034 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:03:58,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:03:58,061 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:58,526 INFO ]: Checked inductivity of 553 backedges. 134 proven. 165 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-06-22 11:03:58,526 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:03:58,526 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:03:58,531 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:03:58,584 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:03:58,584 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:03:58,589 INFO ]: Computing forward predicates... [2018-06-22 11:03:59,517 INFO ]: Checked inductivity of 553 backedges. 156 proven. 143 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-06-22 11:03:59,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:03:59,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 55 [2018-06-22 11:03:59,537 INFO ]: Interpolant automaton has 55 states [2018-06-22 11:03:59,537 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-22 11:03:59,537 INFO ]: CoverageRelationStatistics Valid=515, Invalid=2455, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 11:03:59,537 INFO ]: Start difference. First operand 72 states and 76 transitions. Second operand 55 states. [2018-06-22 11:04:00,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:00,259 INFO ]: Finished difference Result 94 states and 97 transitions. [2018-06-22 11:04:00,259 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:04:00,259 INFO ]: Start accepts. Automaton has 55 states. Word has length 113 [2018-06-22 11:04:00,259 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:00,260 INFO ]: With dead ends: 94 [2018-06-22 11:04:00,260 INFO ]: Without dead ends: 70 [2018-06-22 11:04:00,261 INFO ]: 0 DeclaredPredicates, 187 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1858 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1014, Invalid=5306, Unknown=0, NotChecked=0, Total=6320 [2018-06-22 11:04:00,261 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-22 11:04:00,263 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-06-22 11:04:00,263 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-22 11:04:00,264 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-06-22 11:04:00,264 INFO ]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 113 [2018-06-22 11:04:00,264 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:00,264 INFO ]: Abstraction has 70 states and 73 transitions. [2018-06-22 11:04:00,264 INFO ]: Interpolant automaton has 55 states. [2018-06-22 11:04:00,264 INFO ]: Start isEmpty. Operand 70 states and 73 transitions. [2018-06-22 11:04:00,265 INFO ]: Finished isEmpty. Found accepting run of length 114 [2018-06-22 11:04:00,265 INFO ]: Found error trace [2018-06-22 11:04:00,265 INFO ]: trace histogram [13, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:00,265 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:00,265 INFO ]: Analyzing trace with hash -1744870005, now seen corresponding path program 33 times [2018-06-22 11:04:00,265 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:00,265 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:00,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:00,266 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:00,266 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:00,280 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:00,758 INFO ]: Checked inductivity of 553 backedges. 110 proven. 189 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-06-22 11:04:00,758 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:00,758 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:04:00,765 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:04:00,832 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-06-22 11:04:00,832 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:00,836 INFO ]: Computing forward predicates... [2018-06-22 11:04:01,588 INFO ]: Checked inductivity of 553 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-06-22 11:04:01,608 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:01,608 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 58 [2018-06-22 11:04:01,609 INFO ]: Interpolant automaton has 58 states [2018-06-22 11:04:01,609 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-22 11:04:01,609 INFO ]: CoverageRelationStatistics Valid=533, Invalid=2773, Unknown=0, NotChecked=0, Total=3306 [2018-06-22 11:04:01,609 INFO ]: Start difference. First operand 70 states and 73 transitions. Second operand 58 states. [2018-06-22 11:04:02,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:04:02,325 INFO ]: Finished difference Result 72 states and 75 transitions. [2018-06-22 11:04:02,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-22 11:04:02,328 INFO ]: Start accepts. Automaton has 58 states. Word has length 113 [2018-06-22 11:04:02,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:04:02,329 INFO ]: With dead ends: 72 [2018-06-22 11:04:02,329 INFO ]: Without dead ends: 72 [2018-06-22 11:04:02,330 INFO ]: 0 DeclaredPredicates, 190 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1108, Invalid=5864, Unknown=0, NotChecked=0, Total=6972 [2018-06-22 11:04:02,330 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-22 11:04:02,334 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-22 11:04:02,335 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-22 11:04:02,335 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-06-22 11:04:02,335 INFO ]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 113 [2018-06-22 11:04:02,335 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:04:02,335 INFO ]: Abstraction has 72 states and 75 transitions. [2018-06-22 11:04:02,335 INFO ]: Interpolant automaton has 58 states. [2018-06-22 11:04:02,335 INFO ]: Start isEmpty. Operand 72 states and 75 transitions. [2018-06-22 11:04:02,336 INFO ]: Finished isEmpty. Found accepting run of length 118 [2018-06-22 11:04:02,336 INFO ]: Found error trace [2018-06-22 11:04:02,336 INFO ]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:04:02,336 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:04:02,336 INFO ]: Analyzing trace with hash 180973677, now seen corresponding path program 34 times [2018-06-22 11:04:02,336 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:04:02,336 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:04:02,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:02,337 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:04:02,337 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:04:02,357 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:03,100 INFO ]: Checked inductivity of 600 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-06-22 11:04:03,100 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:04:03,100 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:04:03,106 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:04:03,162 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:04:03,162 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:04:03,167 INFO ]: Computing forward predicates... [2018-06-22 11:04:03,547 INFO ]: Checked inductivity of 600 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-06-22 11:04:03,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:04:03,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-22 11:04:03,567 INFO ]: Interpolant automaton has 33 states [2018-06-22 11:04:03,567 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-22 11:04:03,567 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-22 11:04:03,567 INFO ]: Start difference. First operand 72 states and 75 transitions. Second operand 33 states. Received shutdown request... [2018-06-22 11:04:03,724 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:04:03,725 WARN ]: Verification canceled [2018-06-22 11:04:03,827 WARN ]: Timeout [2018-06-22 11:04:03,828 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:04:03 BoogieIcfgContainer [2018-06-22 11:04:03,828 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:04:03,829 INFO ]: Toolchain (without parser) took 58724.27 ms. Allocated memory was 308.8 MB in the beginning and 683.1 MB in the end (delta: 374.3 MB). Free memory was 264.2 MB in the beginning and 655.3 MB in the end (delta: -391.1 MB). Peak memory consumption was 427.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:04:03,830 INFO ]: SmtParser took 0.08 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:04:03,830 INFO ]: ChcToBoogie took 56.58 ms. Allocated memory is still 308.8 MB. Free memory was 264.2 MB in the beginning and 262.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:04:03,831 INFO ]: Boogie Preprocessor took 38.37 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.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:04:03,831 INFO ]: RCFGBuilder took 467.87 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 251.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:04:03,831 INFO ]: TraceAbstraction took 58152.24 ms. Allocated memory was 308.8 MB in the beginning and 683.1 MB in the end (delta: 374.3 MB). Free memory was 250.2 MB in the beginning and 655.3 MB in the end (delta: -405.1 MB). Peak memory consumption was 413.2 MB. Max. memory is 3.6 GB. [2018-06-22 11:04:03,833 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.58 ms. Allocated memory is still 308.8 MB. Free memory was 264.2 MB in the beginning and 262.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 38.37 ms. Allocated memory is still 308.8 MB. Free memory was 262.2 MB in the beginning and 260.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 467.87 ms. Allocated memory is still 308.8 MB. Free memory was 260.2 MB in the beginning and 251.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58152.24 ms. Allocated memory was 308.8 MB in the beginning and 683.1 MB in the end (delta: 374.3 MB). Free memory was 250.2 MB in the beginning and 655.3 MB in the end (delta: -405.1 MB). Peak memory consumption was 413.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (72states) and interpolant automaton (currently 9 states, 33 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 35 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. TIMEOUT Result, 58.0s OverallTime, 44 OverallIterations, 13 TraceHistogramMax, 20.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1389 SDtfs, 474 SDslu, 17468 SDs, 0 SdLazy, 11405 SolverSat, 378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4132 GetRequests, 2225 SyntacticMatches, 358 SemanticMatches, 1548 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17677 ImplicationChecksByTransitivity, 41.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 175 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 33.3s InterpolantComputationTime, 5236 NumberOfCodeBlocks, 5236 NumberOfCodeBlocksAsserted, 198 NumberOfCheckSat, 5156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801056 SizeOfPredicates, 565 NumberOfNonLiveVariables, 12129 ConjunctsInSsa, 2380 ConjunctsInUnsatCore, 80 InterpolantComputations, 10 PerfectInterpolantSequences, 9554/15366 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-04-03-843.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-04-03-843.csv Completed graceful shutdown