java -Xss4m -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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 08:58:39,955 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 08:58:39,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 08:58:39,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 08:58:39,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 08:58:39,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 08:58:39,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 08:58:39,975 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 08:58:39,976 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 08:58:39,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 08:58:39,978 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 08:58:39,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 08:58:39,979 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 08:58:39,980 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 08:58:39,984 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 08:58:39,985 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 08:58:39,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 08:58:39,990 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 08:58:39,991 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 08:58:39,992 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 08:58:39,997 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 08:58:39,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 08:58:40,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 08:58:40,000 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 08:58:40,001 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 08:58:40,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 08:58:40,002 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 08:58:40,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 08:58:40,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 08:58:40,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 08:58:40,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 08:58:40,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 08:58:40,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 08:58:40,006 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 08:58:40,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 08:58:40,007 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 08:58:40,020 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 08:58:40,020 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 08:58:40,020 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 08:58:40,021 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 08:58:40,022 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 08:58:40,022 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 08:58:40,022 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 08:58:40,022 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 08:58:40,022 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 08:58:40,023 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 08:58:40,023 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 08:58:40,023 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 08:58:40,023 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 08:58:40,023 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 08:58:40,024 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 08:58:40,024 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 08:58:40,024 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 08:58:40,024 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 08:58:40,024 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 08:58:40,024 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 08:58:40,025 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 08:58:40,026 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 08:58:40,026 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 08:58:40,078 INFO ]: Repository-Root is: /tmp [2018-06-25 08:58:40,090 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 08:58:40,094 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 08:58:40,095 INFO ]: Initializing SmtParser... [2018-06-25 08:58:40,095 INFO ]: SmtParser initialized [2018-06-25 08:58:40,096 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 [2018-06-25 08:58:40,097 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-25 08:58:40,189 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 unknown [2018-06-25 08:58:40,451 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_merged_safe.c-1.smt2 [2018-06-25 08:58:40,455 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 08:58:40,460 INFO ]: Walking toolchain with 4 elements. [2018-06-25 08:58:40,461 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 08:58:40,461 INFO ]: Initializing ChcToBoogie... [2018-06-25 08:58:40,461 INFO ]: ChcToBoogie initialized [2018-06-25 08:58:40,464 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:58:40" (1/1) ... [2018-06-25 08:58:40,517 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40 Unit [2018-06-25 08:58:40,517 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 08:58:40,518 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 08:58:40,518 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 08:58:40,518 INFO ]: Boogie Preprocessor initialized [2018-06-25 08:58:40,538 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40" (1/1) ... [2018-06-25 08:58:40,539 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40" (1/1) ... [2018-06-25 08:58:40,545 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40" (1/1) ... [2018-06-25 08:58:40,546 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40" (1/1) ... [2018-06-25 08:58:40,553 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40" (1/1) ... [2018-06-25 08:58:40,563 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40" (1/1) ... [2018-06-25 08:58:40,565 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40" (1/1) ... [2018-06-25 08:58:40,567 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 08:58:40,567 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 08:58:40,567 INFO ]: Initializing RCFGBuilder... [2018-06-25 08:58:40,567 INFO ]: RCFGBuilder initialized [2018-06-25 08:58:40,568 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40" (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-25 08:58:40,586 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 08:58:40,586 INFO ]: Found specification of procedure gotoProc [2018-06-25 08:58:40,587 INFO ]: Found implementation of procedure gotoProc [2018-06-25 08:58:40,587 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 08:58:40,587 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 08:58:40,587 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-25 08:58:40,912 INFO ]: Using library mode [2018-06-25 08:58:40,913 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:58:40 BoogieIcfgContainer [2018-06-25 08:58:40,913 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 08:58:40,914 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 08:58:40,914 INFO ]: Initializing TraceAbstraction... [2018-06-25 08:58:40,918 INFO ]: TraceAbstraction initialized [2018-06-25 08:58:40,918 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 08:58:40" (1/3) ... [2018-06-25 08:58:40,919 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a1ccff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 08:58:40, skipping insertion in model container [2018-06-25 08:58:40,919 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 08:58:40" (2/3) ... [2018-06-25 08:58:40,919 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a1ccff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 08:58:40, skipping insertion in model container [2018-06-25 08:58:40,919 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 08:58:40" (3/3) ... [2018-06-25 08:58:40,921 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 08:58:40,929 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 08:58:40,936 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 08:58:40,969 INFO ]: Using default assertion order modulation [2018-06-25 08:58:40,971 INFO ]: Interprodecural is true [2018-06-25 08:58:40,971 INFO ]: Hoare is false [2018-06-25 08:58:40,971 INFO ]: Compute interpolants for FPandBP [2018-06-25 08:58:40,971 INFO ]: Backedges is TWOTRACK [2018-06-25 08:58:40,971 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 08:58:40,971 INFO ]: Difference is false [2018-06-25 08:58:40,971 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 08:58:40,971 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 08:58:40,983 INFO ]: Start isEmpty. Operand 16 states. [2018-06-25 08:58:40,993 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 08:58:40,993 INFO ]: Found error trace [2018-06-25 08:58:40,997 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:40,997 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:41,001 INFO ]: Analyzing trace with hash 625171148, now seen corresponding path program 1 times [2018-06-25 08:58:41,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:41,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:41,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:41,040 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:41,040 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:41,083 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:41,146 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:41,148 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:41,148 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:58:41,150 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:58:41,161 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:58:41,162 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:58:41,163 INFO ]: Start difference. First operand 16 states. Second operand 3 states. [2018-06-25 08:58:41,213 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:41,213 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-25 08:58:41,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:58:41,215 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 08:58:41,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:41,220 INFO ]: With dead ends: 15 [2018-06-25 08:58:41,220 INFO ]: Without dead ends: 14 [2018-06-25 08:58:41,222 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:58:41,234 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 08:58:41,247 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 08:58:41,248 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 08:58:41,248 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2018-06-25 08:58:41,250 INFO ]: Start accepts. Automaton has 14 states and 21 transitions. Word has length 8 [2018-06-25 08:58:41,250 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:41,250 INFO ]: Abstraction has 14 states and 21 transitions. [2018-06-25 08:58:41,250 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:58:41,250 INFO ]: Start isEmpty. Operand 14 states and 21 transitions. [2018-06-25 08:58:41,250 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 08:58:41,250 INFO ]: Found error trace [2018-06-25 08:58:41,250 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:41,250 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:41,251 INFO ]: Analyzing trace with hash 880986465, now seen corresponding path program 1 times [2018-06-25 08:58:41,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:41,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:41,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:41,251 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:41,251 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:41,266 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:41,300 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:41,300 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:41,301 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 08:58:41,302 INFO ]: Interpolant automaton has 3 states [2018-06-25 08:58:41,302 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 08:58:41,302 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:58:41,302 INFO ]: Start difference. First operand 14 states and 21 transitions. Second operand 3 states. [2018-06-25 08:58:41,389 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:41,389 INFO ]: Finished difference Result 20 states and 29 transitions. [2018-06-25 08:58:41,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 08:58:41,391 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 08:58:41,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:41,394 INFO ]: With dead ends: 20 [2018-06-25 08:58:41,394 INFO ]: Without dead ends: 20 [2018-06-25 08:58:41,395 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 08:58:41,397 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 08:58:41,400 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-25 08:58:41,400 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 08:58:41,402 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-25 08:58:41,402 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 8 [2018-06-25 08:58:41,402 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:41,402 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-25 08:58:41,402 INFO ]: Interpolant automaton has 3 states. [2018-06-25 08:58:41,402 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-25 08:58:41,403 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 08:58:41,403 INFO ]: Found error trace [2018-06-25 08:58:41,403 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:41,403 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:41,403 INFO ]: Analyzing trace with hash 1789048072, now seen corresponding path program 1 times [2018-06-25 08:58:41,403 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:41,403 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:41,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:41,404 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:41,404 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:41,422 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:41,512 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:41,512 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:41,512 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 08:58:41,512 INFO ]: Interpolant automaton has 4 states [2018-06-25 08:58:41,512 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 08:58:41,512 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:58:41,512 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2018-06-25 08:58:41,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:41,737 INFO ]: Finished difference Result 29 states and 44 transitions. [2018-06-25 08:58:41,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:58:41,739 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-25 08:58:41,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:41,740 INFO ]: With dead ends: 29 [2018-06-25 08:58:41,740 INFO ]: Without dead ends: 29 [2018-06-25 08:58:41,741 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:58:41,741 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 08:58:41,744 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 16. [2018-06-25 08:58:41,744 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 08:58:41,745 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-25 08:58:41,745 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 9 [2018-06-25 08:58:41,745 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:41,745 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-25 08:58:41,745 INFO ]: Interpolant automaton has 4 states. [2018-06-25 08:58:41,745 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-25 08:58:41,745 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 08:58:41,745 INFO ]: Found error trace [2018-06-25 08:58:41,746 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:41,746 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:41,746 INFO ]: Analyzing trace with hash 1076016513, now seen corresponding path program 1 times [2018-06-25 08:58:41,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:41,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:41,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:41,747 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:41,747 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:41,759 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:41,967 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:41,967 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:41,967 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 08:58:41,968 INFO ]: Interpolant automaton has 4 states [2018-06-25 08:58:41,968 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 08:58:41,968 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:58:41,968 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 4 states. [2018-06-25 08:58:42,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:42,155 INFO ]: Finished difference Result 23 states and 35 transitions. [2018-06-25 08:58:42,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:58:42,155 INFO ]: Start accepts. Automaton has 4 states. Word has length 10 [2018-06-25 08:58:42,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:42,157 INFO ]: With dead ends: 23 [2018-06-25 08:58:42,157 INFO ]: Without dead ends: 23 [2018-06-25 08:58:42,157 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:58:42,157 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-25 08:58:42,159 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-25 08:58:42,159 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 08:58:42,160 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-25 08:58:42,160 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 10 [2018-06-25 08:58:42,160 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:42,160 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-25 08:58:42,160 INFO ]: Interpolant automaton has 4 states. [2018-06-25 08:58:42,160 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-25 08:58:42,160 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 08:58:42,160 INFO ]: Found error trace [2018-06-25 08:58:42,160 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:42,161 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:42,161 INFO ]: Analyzing trace with hash -1344229863, now seen corresponding path program 1 times [2018-06-25 08:58:42,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:42,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:42,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:42,162 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:42,162 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:42,179 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:42,428 WARN ]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-06-25 08:58:42,467 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:42,467 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:42,467 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:58:42,467 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:58:42,467 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:58:42,468 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:58:42,468 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 5 states. [2018-06-25 08:58:43,004 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-06-25 08:58:43,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:43,157 INFO ]: Finished difference Result 30 states and 46 transitions. [2018-06-25 08:58:43,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 08:58:43,158 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-25 08:58:43,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:43,159 INFO ]: With dead ends: 30 [2018-06-25 08:58:43,159 INFO ]: Without dead ends: 30 [2018-06-25 08:58:43,159 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-06-25 08:58:43,159 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-25 08:58:43,161 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-06-25 08:58:43,161 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 08:58:43,162 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-06-25 08:58:43,162 INFO ]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 10 [2018-06-25 08:58:43,162 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:43,162 INFO ]: Abstraction has 19 states and 28 transitions. [2018-06-25 08:58:43,162 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:58:43,162 INFO ]: Start isEmpty. Operand 19 states and 28 transitions. [2018-06-25 08:58:43,162 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 08:58:43,162 INFO ]: Found error trace [2018-06-25 08:58:43,162 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:43,162 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:43,163 INFO ]: Analyzing trace with hash 1566366099, now seen corresponding path program 1 times [2018-06-25 08:58:43,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:43,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:43,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:43,163 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:43,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:43,171 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:43,284 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:43,284 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:43,284 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:58:43,284 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:58:43,284 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:58:43,284 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:58:43,285 INFO ]: Start difference. First operand 19 states and 28 transitions. Second operand 5 states. [2018-06-25 08:58:43,324 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:43,324 INFO ]: Finished difference Result 35 states and 51 transitions. [2018-06-25 08:58:43,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:58:43,325 INFO ]: Start accepts. Automaton has 5 states. Word has length 10 [2018-06-25 08:58:43,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:43,326 INFO ]: With dead ends: 35 [2018-06-25 08:58:43,326 INFO ]: Without dead ends: 35 [2018-06-25 08:58:43,326 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:58:43,326 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 08:58:43,330 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 17. [2018-06-25 08:58:43,330 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 08:58:43,331 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-25 08:58:43,331 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 10 [2018-06-25 08:58:43,331 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:43,331 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-25 08:58:43,331 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:58:43,331 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-25 08:58:43,331 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 08:58:43,331 INFO ]: Found error trace [2018-06-25 08:58:43,331 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:43,331 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:43,332 INFO ]: Analyzing trace with hash -575386624, now seen corresponding path program 1 times [2018-06-25 08:58:43,332 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:43,332 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:43,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:43,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:43,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:43,352 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:43,411 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:43,411 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:43,411 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:58:43,412 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:58:43,412 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:58:43,412 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:58:43,412 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 5 states. [2018-06-25 08:58:43,544 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:43,544 INFO ]: Finished difference Result 31 states and 45 transitions. [2018-06-25 08:58:43,544 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 08:58:43,544 INFO ]: Start accepts. Automaton has 5 states. Word has length 11 [2018-06-25 08:58:43,544 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:43,545 INFO ]: With dead ends: 31 [2018-06-25 08:58:43,545 INFO ]: Without dead ends: 31 [2018-06-25 08:58:43,545 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-06-25 08:58:43,545 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 08:58:43,547 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-06-25 08:58:43,547 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 08:58:43,548 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-06-25 08:58:43,548 INFO ]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 11 [2018-06-25 08:58:43,548 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:43,548 INFO ]: Abstraction has 17 states and 24 transitions. [2018-06-25 08:58:43,548 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:58:43,548 INFO ]: Start isEmpty. Operand 17 states and 24 transitions. [2018-06-25 08:58:43,548 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 08:58:43,548 INFO ]: Found error trace [2018-06-25 08:58:43,548 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:43,549 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:43,549 INFO ]: Analyzing trace with hash 1396052537, now seen corresponding path program 1 times [2018-06-25 08:58:43,549 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:43,549 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:43,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:43,550 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:43,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:43,572 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:43,745 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:43,745 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:43,746 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 08:58:43,746 INFO ]: Interpolant automaton has 7 states [2018-06-25 08:58:43,746 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 08:58:43,746 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:58:43,746 INFO ]: Start difference. First operand 17 states and 24 transitions. Second operand 7 states. [2018-06-25 08:58:44,075 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:44,075 INFO ]: Finished difference Result 41 states and 62 transitions. [2018-06-25 08:58:44,076 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 08:58:44,076 INFO ]: Start accepts. Automaton has 7 states. Word has length 12 [2018-06-25 08:58:44,076 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:44,077 INFO ]: With dead ends: 41 [2018-06-25 08:58:44,077 INFO ]: Without dead ends: 41 [2018-06-25 08:58:44,077 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-06-25 08:58:44,077 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-25 08:58:44,080 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 19. [2018-06-25 08:58:44,080 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 08:58:44,080 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2018-06-25 08:58:44,080 INFO ]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 12 [2018-06-25 08:58:44,080 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:44,080 INFO ]: Abstraction has 19 states and 29 transitions. [2018-06-25 08:58:44,080 INFO ]: Interpolant automaton has 7 states. [2018-06-25 08:58:44,080 INFO ]: Start isEmpty. Operand 19 states and 29 transitions. [2018-06-25 08:58:44,081 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 08:58:44,081 INFO ]: Found error trace [2018-06-25 08:58:44,082 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:44,082 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:44,082 INFO ]: Analyzing trace with hash -883407663, now seen corresponding path program 1 times [2018-06-25 08:58:44,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:44,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:44,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:44,083 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:44,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:44,097 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:44,368 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:44,368 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:44,368 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-25 08:58:44,378 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:44,415 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:44,423 INFO ]: Computing forward predicates... [2018-06-25 08:58:44,549 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:44,571 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:44,571 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-25 08:58:44,571 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:58:44,571 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:58:44,571 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:58:44,571 INFO ]: Start difference. First operand 19 states and 29 transitions. Second operand 11 states. [2018-06-25 08:58:45,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:45,627 INFO ]: Finished difference Result 48 states and 74 transitions. [2018-06-25 08:58:45,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 08:58:45,627 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-25 08:58:45,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:45,628 INFO ]: With dead ends: 48 [2018-06-25 08:58:45,628 INFO ]: Without dead ends: 48 [2018-06-25 08:58:45,629 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2018-06-25 08:58:45,629 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 08:58:45,632 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 25. [2018-06-25 08:58:45,632 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 08:58:45,632 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 37 transitions. [2018-06-25 08:58:45,632 INFO ]: Start accepts. Automaton has 25 states and 37 transitions. Word has length 12 [2018-06-25 08:58:45,632 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:45,632 INFO ]: Abstraction has 25 states and 37 transitions. [2018-06-25 08:58:45,632 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:58:45,632 INFO ]: Start isEmpty. Operand 25 states and 37 transitions. [2018-06-25 08:58:45,633 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 08:58:45,633 INFO ]: Found error trace [2018-06-25 08:58:45,633 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:45,633 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:45,633 INFO ]: Analyzing trace with hash -1233784542, now seen corresponding path program 1 times [2018-06-25 08:58:45,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:45,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:45,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:45,634 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:45,634 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:45,649 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:45,722 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:45,722 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:45,722 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-25 08:58:45,722 INFO ]: Interpolant automaton has 7 states [2018-06-25 08:58:45,722 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 08:58:45,722 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 08:58:45,722 INFO ]: Start difference. First operand 25 states and 37 transitions. Second operand 7 states. [2018-06-25 08:58:45,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:45,833 INFO ]: Finished difference Result 51 states and 77 transitions. [2018-06-25 08:58:45,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 08:58:45,833 INFO ]: Start accepts. Automaton has 7 states. Word has length 13 [2018-06-25 08:58:45,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:45,834 INFO ]: With dead ends: 51 [2018-06-25 08:58:45,834 INFO ]: Without dead ends: 51 [2018-06-25 08:58:45,834 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:58:45,834 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-25 08:58:45,837 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 26. [2018-06-25 08:58:45,837 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 08:58:45,838 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2018-06-25 08:58:45,838 INFO ]: Start accepts. Automaton has 26 states and 39 transitions. Word has length 13 [2018-06-25 08:58:45,838 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:45,838 INFO ]: Abstraction has 26 states and 39 transitions. [2018-06-25 08:58:45,838 INFO ]: Interpolant automaton has 7 states. [2018-06-25 08:58:45,838 INFO ]: Start isEmpty. Operand 26 states and 39 transitions. [2018-06-25 08:58:45,838 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 08:58:45,838 INFO ]: Found error trace [2018-06-25 08:58:45,838 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:45,839 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:45,839 INFO ]: Analyzing trace with hash -553726172, now seen corresponding path program 1 times [2018-06-25 08:58:45,839 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:45,839 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:45,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:45,839 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:45,839 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:45,848 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:45,896 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:45,896 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:45,896 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 08:58:45,896 INFO ]: Interpolant automaton has 4 states [2018-06-25 08:58:45,896 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 08:58:45,896 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:58:45,897 INFO ]: Start difference. First operand 26 states and 39 transitions. Second operand 4 states. [2018-06-25 08:58:45,906 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:45,906 INFO ]: Finished difference Result 37 states and 54 transitions. [2018-06-25 08:58:45,906 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 08:58:45,906 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-25 08:58:45,906 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:45,907 INFO ]: With dead ends: 37 [2018-06-25 08:58:45,907 INFO ]: Without dead ends: 36 [2018-06-25 08:58:45,907 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-25 08:58:45,907 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-25 08:58:45,910 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 25. [2018-06-25 08:58:45,910 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 08:58:45,910 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-06-25 08:58:45,910 INFO ]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 13 [2018-06-25 08:58:45,910 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:45,910 INFO ]: Abstraction has 25 states and 35 transitions. [2018-06-25 08:58:45,910 INFO ]: Interpolant automaton has 4 states. [2018-06-25 08:58:45,910 INFO ]: Start isEmpty. Operand 25 states and 35 transitions. [2018-06-25 08:58:45,911 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 08:58:45,911 INFO ]: Found error trace [2018-06-25 08:58:45,911 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:45,911 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:45,911 INFO ]: Analyzing trace with hash -759429896, now seen corresponding path program 1 times [2018-06-25 08:58:45,911 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:45,911 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:45,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:45,912 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:45,912 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:45,920 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:45,965 INFO ]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 08:58:45,965 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:45,965 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-25 08:58:45,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:46,003 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:46,005 INFO ]: Computing forward predicates... [2018-06-25 08:58:46,133 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:46,165 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:58:46,165 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-06-25 08:58:46,165 INFO ]: Interpolant automaton has 11 states [2018-06-25 08:58:46,165 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-25 08:58:46,165 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-25 08:58:46,165 INFO ]: Start difference. First operand 25 states and 35 transitions. Second operand 11 states. [2018-06-25 08:58:46,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:46,267 INFO ]: Finished difference Result 34 states and 49 transitions. [2018-06-25 08:58:46,270 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 08:58:46,270 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-25 08:58:46,270 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:46,270 INFO ]: With dead ends: 34 [2018-06-25 08:58:46,270 INFO ]: Without dead ends: 25 [2018-06-25 08:58:46,270 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-06-25 08:58:46,271 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 08:58:46,272 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 08:58:46,272 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 08:58:46,273 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-06-25 08:58:46,273 INFO ]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2018-06-25 08:58:46,273 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:46,273 INFO ]: Abstraction has 25 states and 33 transitions. [2018-06-25 08:58:46,273 INFO ]: Interpolant automaton has 11 states. [2018-06-25 08:58:46,273 INFO ]: Start isEmpty. Operand 25 states and 33 transitions. [2018-06-25 08:58:46,273 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 08:58:46,273 INFO ]: Found error trace [2018-06-25 08:58:46,273 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:46,273 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:46,274 INFO ]: Analyzing trace with hash -1093100082, now seen corresponding path program 1 times [2018-06-25 08:58:46,274 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:46,274 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:46,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:46,274 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:46,274 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:46,281 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:46,322 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:46,322 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:46,322 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-25 08:58:46,322 INFO ]: Interpolant automaton has 8 states [2018-06-25 08:58:46,322 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 08:58:46,322 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 08:58:46,322 INFO ]: Start difference. First operand 25 states and 33 transitions. Second operand 8 states. [2018-06-25 08:58:46,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:46,501 INFO ]: Finished difference Result 42 states and 59 transitions. [2018-06-25 08:58:46,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 08:58:46,501 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-25 08:58:46,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:46,502 INFO ]: With dead ends: 42 [2018-06-25 08:58:46,502 INFO ]: Without dead ends: 42 [2018-06-25 08:58:46,502 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-06-25 08:58:46,502 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 08:58:46,505 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 27. [2018-06-25 08:58:46,505 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 08:58:46,505 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2018-06-25 08:58:46,505 INFO ]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 13 [2018-06-25 08:58:46,505 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:46,505 INFO ]: Abstraction has 27 states and 36 transitions. [2018-06-25 08:58:46,505 INFO ]: Interpolant automaton has 8 states. [2018-06-25 08:58:46,505 INFO ]: Start isEmpty. Operand 27 states and 36 transitions. [2018-06-25 08:58:46,506 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 08:58:46,506 INFO ]: Found error trace [2018-06-25 08:58:46,506 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:46,506 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:46,506 INFO ]: Analyzing trace with hash -286973711, now seen corresponding path program 1 times [2018-06-25 08:58:46,506 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:46,506 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:46,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:46,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:46,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:46,516 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:46,644 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:46,644 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:46,644 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-25 08:58:46,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:46,690 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:46,693 INFO ]: Computing forward predicates... [2018-06-25 08:58:47,202 INFO ]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:47,222 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 08:58:47,222 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 13 [2018-06-25 08:58:47,222 INFO ]: Interpolant automaton has 13 states [2018-06-25 08:58:47,222 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 08:58:47,222 INFO ]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-06-25 08:58:47,222 INFO ]: Start difference. First operand 27 states and 36 transitions. Second operand 13 states. [2018-06-25 08:58:47,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:47,612 INFO ]: Finished difference Result 45 states and 59 transitions. [2018-06-25 08:58:47,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 08:58:47,613 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-25 08:58:47,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:47,613 INFO ]: With dead ends: 45 [2018-06-25 08:58:47,613 INFO ]: Without dead ends: 29 [2018-06-25 08:58:47,613 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2018-06-25 08:58:47,613 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-25 08:58:47,615 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-25 08:58:47,615 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 08:58:47,616 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-06-25 08:58:47,616 INFO ]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 14 [2018-06-25 08:58:47,616 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:47,616 INFO ]: Abstraction has 29 states and 38 transitions. [2018-06-25 08:58:47,616 INFO ]: Interpolant automaton has 13 states. [2018-06-25 08:58:47,616 INFO ]: Start isEmpty. Operand 29 states and 38 transitions. [2018-06-25 08:58:47,616 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 08:58:47,616 INFO ]: Found error trace [2018-06-25 08:58:47,616 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:47,616 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:47,617 INFO ]: Analyzing trace with hash -2119636582, now seen corresponding path program 1 times [2018-06-25 08:58:47,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:47,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:47,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:47,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:47,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:47,633 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:47,981 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:47,981 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:47,981 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-25 08:58:47,987 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:48,017 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:48,021 INFO ]: Computing forward predicates... [2018-06-25 08:58:48,376 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:48,394 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:48,395 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-06-25 08:58:48,395 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:58:48,395 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:58:48,395 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:58:48,395 INFO ]: Start difference. First operand 29 states and 38 transitions. Second operand 15 states. [2018-06-25 08:58:49,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:49,588 INFO ]: Finished difference Result 73 states and 106 transitions. [2018-06-25 08:58:49,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 08:58:49,589 INFO ]: Start accepts. Automaton has 15 states. Word has length 15 [2018-06-25 08:58:49,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:49,589 INFO ]: With dead ends: 73 [2018-06-25 08:58:49,589 INFO ]: Without dead ends: 73 [2018-06-25 08:58:49,590 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=269, Invalid=1291, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 08:58:49,590 INFO ]: Start minimizeSevpa. Operand 73 states. [2018-06-25 08:58:49,593 INFO ]: Finished minimizeSevpa. Reduced states from 73 to 34. [2018-06-25 08:58:49,593 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 08:58:49,594 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2018-06-25 08:58:49,594 INFO ]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 15 [2018-06-25 08:58:49,594 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:49,594 INFO ]: Abstraction has 34 states and 45 transitions. [2018-06-25 08:58:49,594 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:58:49,594 INFO ]: Start isEmpty. Operand 34 states and 45 transitions. [2018-06-25 08:58:49,595 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 08:58:49,595 INFO ]: Found error trace [2018-06-25 08:58:49,595 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:49,595 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:49,595 INFO ]: Analyzing trace with hash 2035531917, now seen corresponding path program 1 times [2018-06-25 08:58:49,595 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:49,595 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:49,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:49,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:49,596 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:49,604 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:49,677 INFO ]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 08:58:49,678 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 08:58:49,678 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-25 08:58:49,678 INFO ]: Interpolant automaton has 5 states [2018-06-25 08:58:49,678 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 08:58:49,678 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 08:58:49,678 INFO ]: Start difference. First operand 34 states and 45 transitions. Second operand 5 states. [2018-06-25 08:58:49,711 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:49,711 INFO ]: Finished difference Result 41 states and 53 transitions. [2018-06-25 08:58:49,711 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 08:58:49,711 INFO ]: Start accepts. Automaton has 5 states. Word has length 15 [2018-06-25 08:58:49,711 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:49,711 INFO ]: With dead ends: 41 [2018-06-25 08:58:49,711 INFO ]: Without dead ends: 28 [2018-06-25 08:58:49,711 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-06-25 08:58:49,712 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 08:58:49,713 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-06-25 08:58:49,713 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 08:58:49,713 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-25 08:58:49,715 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2018-06-25 08:58:49,715 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:49,715 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-25 08:58:49,715 INFO ]: Interpolant automaton has 5 states. [2018-06-25 08:58:49,715 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-25 08:58:49,715 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 08:58:49,715 INFO ]: Found error trace [2018-06-25 08:58:49,715 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:49,715 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:49,715 INFO ]: Analyzing trace with hash 1197356561, now seen corresponding path program 2 times [2018-06-25 08:58:49,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:49,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:49,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:49,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:49,716 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:49,726 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:49,891 INFO ]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:49,891 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:49,891 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-25 08:58:49,897 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:58:49,921 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:58:49,921 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:49,923 INFO ]: Computing forward predicates... [2018-06-25 08:58:49,995 INFO ]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:50,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:50,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-06-25 08:58:50,026 INFO ]: Interpolant automaton has 15 states [2018-06-25 08:58:50,026 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-25 08:58:50,026 INFO ]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-06-25 08:58:50,026 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 15 states. [2018-06-25 08:58:50,167 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:50,167 INFO ]: Finished difference Result 42 states and 47 transitions. [2018-06-25 08:58:50,167 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 08:58:50,167 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-25 08:58:50,167 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:50,167 INFO ]: With dead ends: 42 [2018-06-25 08:58:50,167 INFO ]: Without dead ends: 42 [2018-06-25 08:58:50,168 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-06-25 08:58:50,168 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-25 08:58:50,170 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 21. [2018-06-25 08:58:50,170 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 08:58:50,170 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-25 08:58:50,170 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-06-25 08:58:50,170 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:50,170 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-25 08:58:50,170 INFO ]: Interpolant automaton has 15 states. [2018-06-25 08:58:50,170 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-25 08:58:50,171 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 08:58:50,171 INFO ]: Found error trace [2018-06-25 08:58:50,173 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:50,173 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:50,173 INFO ]: Analyzing trace with hash -1155364799, now seen corresponding path program 2 times [2018-06-25 08:58:50,173 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:50,173 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:50,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:50,174 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:58:50,174 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:50,191 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:50,366 INFO ]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:50,366 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:50,366 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-25 08:58:50,372 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:58:50,393 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:58:50,393 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:50,396 INFO ]: Computing forward predicates... [2018-06-25 08:58:50,646 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:50,666 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:50,666 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-06-25 08:58:50,666 INFO ]: Interpolant automaton has 19 states [2018-06-25 08:58:50,666 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-25 08:58:50,666 INFO ]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-06-25 08:58:50,666 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 19 states. [2018-06-25 08:58:50,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:50,984 INFO ]: Finished difference Result 30 states and 32 transitions. [2018-06-25 08:58:50,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 08:58:50,985 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-25 08:58:50,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:50,985 INFO ]: With dead ends: 30 [2018-06-25 08:58:50,985 INFO ]: Without dead ends: 18 [2018-06-25 08:58:50,985 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2018-06-25 08:58:50,985 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 08:58:50,986 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 08:58:50,986 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 08:58:50,986 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-25 08:58:50,986 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-25 08:58:50,986 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:50,986 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-25 08:58:50,986 INFO ]: Interpolant automaton has 19 states. [2018-06-25 08:58:50,986 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-25 08:58:50,987 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 08:58:50,987 INFO ]: Found error trace [2018-06-25 08:58:50,987 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:50,987 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:50,987 INFO ]: Analyzing trace with hash 1275044882, now seen corresponding path program 3 times [2018-06-25 08:58:50,987 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:50,987 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:50,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:50,988 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:58:50,988 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:50,997 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:51,217 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:51,217 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:51,217 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-25 08:58:51,224 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:58:51,248 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 08:58:51,248 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:51,250 INFO ]: Computing forward predicates... [2018-06-25 08:58:51,716 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:51,736 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:51,736 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-06-25 08:58:51,736 INFO ]: Interpolant automaton has 18 states [2018-06-25 08:58:51,737 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 08:58:51,737 INFO ]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-06-25 08:58:51,737 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 18 states. [2018-06-25 08:58:51,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:51,969 INFO ]: Finished difference Result 27 states and 29 transitions. [2018-06-25 08:58:51,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 08:58:51,970 INFO ]: Start accepts. Automaton has 18 states. Word has length 17 [2018-06-25 08:58:51,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:51,970 INFO ]: With dead ends: 27 [2018-06-25 08:58:51,970 INFO ]: Without dead ends: 19 [2018-06-25 08:58:51,971 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-06-25 08:58:51,971 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 08:58:51,972 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 08:58:51,972 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 08:58:51,972 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-25 08:58:51,972 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-25 08:58:51,972 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:51,972 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-25 08:58:51,972 INFO ]: Interpolant automaton has 18 states. [2018-06-25 08:58:51,972 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-25 08:58:51,972 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 08:58:51,972 INFO ]: Found error trace [2018-06-25 08:58:51,972 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:51,973 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:51,973 INFO ]: Analyzing trace with hash 2039721673, now seen corresponding path program 4 times [2018-06-25 08:58:51,973 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:51,973 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:51,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:51,973 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:58:51,973 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:51,985 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:52,384 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:52,384 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:52,384 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-25 08:58:52,392 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:58:52,422 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:58:52,422 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:52,425 INFO ]: Computing forward predicates... [2018-06-25 08:58:52,679 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:52,698 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:52,698 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-25 08:58:52,699 INFO ]: Interpolant automaton has 20 states [2018-06-25 08:58:52,699 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 08:58:52,699 INFO ]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-06-25 08:58:52,699 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-25 08:58:53,649 WARN ]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-06-25 08:58:53,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:53,833 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-25 08:58:53,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-25 08:58:53,833 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-25 08:58:53,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:53,833 INFO ]: With dead ends: 33 [2018-06-25 08:58:53,833 INFO ]: Without dead ends: 33 [2018-06-25 08:58:53,833 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 08:58:53,834 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-25 08:58:53,835 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 23. [2018-06-25 08:58:53,835 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-25 08:58:53,835 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-25 08:58:53,835 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2018-06-25 08:58:53,835 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:53,835 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-25 08:58:53,835 INFO ]: Interpolant automaton has 20 states. [2018-06-25 08:58:53,835 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-25 08:58:53,835 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 08:58:53,835 INFO ]: Found error trace [2018-06-25 08:58:53,835 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:53,836 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:53,836 INFO ]: Analyzing trace with hash -25101582, now seen corresponding path program 5 times [2018-06-25 08:58:53,836 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:53,836 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:53,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:53,836 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:58:53,836 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:53,849 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:54,100 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:54,101 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:54,101 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-25 08:58:54,106 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:58:54,135 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-25 08:58:54,135 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:54,138 INFO ]: Computing forward predicates... [2018-06-25 08:58:54,259 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:54,279 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:54,279 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2018-06-25 08:58:54,279 INFO ]: Interpolant automaton has 20 states [2018-06-25 08:58:54,279 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 08:58:54,279 INFO ]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-06-25 08:58:54,280 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 20 states. [2018-06-25 08:58:54,445 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:54,445 INFO ]: Finished difference Result 35 states and 38 transitions. [2018-06-25 08:58:54,446 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 08:58:54,446 INFO ]: Start accepts. Automaton has 20 states. Word has length 19 [2018-06-25 08:58:54,446 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:54,446 INFO ]: With dead ends: 35 [2018-06-25 08:58:54,446 INFO ]: Without dead ends: 35 [2018-06-25 08:58:54,447 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:58:54,447 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-25 08:58:54,448 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-06-25 08:58:54,448 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-25 08:58:54,448 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-25 08:58:54,448 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-06-25 08:58:54,448 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:54,448 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-25 08:58:54,448 INFO ]: Interpolant automaton has 20 states. [2018-06-25 08:58:54,448 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-25 08:58:54,448 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 08:58:54,448 INFO ]: Found error trace [2018-06-25 08:58:54,448 INFO ]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:54,448 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:54,449 INFO ]: Analyzing trace with hash -196224639, now seen corresponding path program 6 times [2018-06-25 08:58:54,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:54,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:54,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:54,449 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:58:54,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:54,461 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:54,743 INFO ]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:54,743 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:54,743 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-25 08:58:54,758 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:58:54,792 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 08:58:54,792 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:54,795 INFO ]: Computing forward predicates... [2018-06-25 08:58:54,961 INFO ]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:54,982 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:54,982 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-06-25 08:58:54,982 INFO ]: Interpolant automaton has 23 states [2018-06-25 08:58:54,982 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-25 08:58:54,983 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-25 08:58:54,983 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 23 states. [2018-06-25 08:58:55,315 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:55,315 INFO ]: Finished difference Result 32 states and 34 transitions. [2018-06-25 08:58:55,316 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-25 08:58:55,317 INFO ]: Start accepts. Automaton has 23 states. Word has length 20 [2018-06-25 08:58:55,317 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:55,317 INFO ]: With dead ends: 32 [2018-06-25 08:58:55,317 INFO ]: Without dead ends: 22 [2018-06-25 08:58:55,317 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=750, Unknown=0, NotChecked=0, Total=992 [2018-06-25 08:58:55,317 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-25 08:58:55,318 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-25 08:58:55,318 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-25 08:58:55,319 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-25 08:58:55,319 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-25 08:58:55,319 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:55,319 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-25 08:58:55,319 INFO ]: Interpolant automaton has 23 states. [2018-06-25 08:58:55,319 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-25 08:58:55,319 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-25 08:58:55,319 INFO ]: Found error trace [2018-06-25 08:58:55,319 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:55,319 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:55,320 INFO ]: Analyzing trace with hash -216481942, now seen corresponding path program 7 times [2018-06-25 08:58:55,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:55,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:55,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:55,320 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:58:55,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:55,335 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:55,610 INFO ]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:55,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:55,610 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-25 08:58:55,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:55,656 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:55,661 INFO ]: Computing forward predicates... [2018-06-25 08:58:56,282 WARN ]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-25 08:58:56,369 INFO ]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:56,393 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:56,393 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-25 08:58:56,393 INFO ]: Interpolant automaton has 25 states [2018-06-25 08:58:56,394 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 08:58:56,394 INFO ]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-06-25 08:58:56,394 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 25 states. [2018-06-25 08:58:57,719 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:57,719 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-25 08:58:57,719 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 08:58:57,719 INFO ]: Start accepts. Automaton has 25 states. Word has length 21 [2018-06-25 08:58:57,719 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:57,720 INFO ]: With dead ends: 38 [2018-06-25 08:58:57,720 INFO ]: Without dead ends: 38 [2018-06-25 08:58:57,720 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=201, Invalid=1439, Unknown=0, NotChecked=0, Total=1640 [2018-06-25 08:58:57,720 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-25 08:58:57,722 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 26. [2018-06-25 08:58:57,722 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-25 08:58:57,722 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-25 08:58:57,723 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-06-25 08:58:57,723 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:57,723 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-25 08:58:57,723 INFO ]: Interpolant automaton has 25 states. [2018-06-25 08:58:57,723 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-25 08:58:57,723 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-25 08:58:57,723 INFO ]: Found error trace [2018-06-25 08:58:57,723 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:57,723 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:57,723 INFO ]: Analyzing trace with hash -844458335, now seen corresponding path program 8 times [2018-06-25 08:58:57,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:57,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:57,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:57,724 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:58:57,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:57,735 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:58,697 INFO ]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:58,697 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:58,697 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-25 08:58:58,703 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:58:58,762 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:58:58,762 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:58,766 INFO ]: Computing forward predicates... [2018-06-25 08:58:58,892 INFO ]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:58,911 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:58:58,911 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 25 [2018-06-25 08:58:58,911 INFO ]: Interpolant automaton has 25 states [2018-06-25 08:58:58,911 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-25 08:58:58,911 INFO ]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-06-25 08:58:58,911 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 25 states. [2018-06-25 08:58:59,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:58:59,275 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-25 08:58:59,275 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-25 08:58:59,275 INFO ]: Start accepts. Automaton has 25 states. Word has length 22 [2018-06-25 08:58:59,275 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:58:59,276 INFO ]: With dead ends: 40 [2018-06-25 08:58:59,276 INFO ]: Without dead ends: 40 [2018-06-25 08:58:59,276 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 08:58:59,276 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 08:58:59,277 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 24. [2018-06-25 08:58:59,277 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-25 08:58:59,277 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-25 08:58:59,278 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-25 08:58:59,278 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:58:59,278 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-25 08:58:59,278 INFO ]: Interpolant automaton has 25 states. [2018-06-25 08:58:59,278 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-25 08:58:59,278 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-25 08:58:59,278 INFO ]: Found error trace [2018-06-25 08:58:59,278 INFO ]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:58:59,278 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:58:59,278 INFO ]: Analyzing trace with hash 550585826, now seen corresponding path program 9 times [2018-06-25 08:58:59,278 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:58:59,278 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:58:59,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:59,283 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:58:59,283 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:58:59,295 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:59,765 INFO ]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:58:59,765 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:58:59,765 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-25 08:58:59,770 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:58:59,809 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-25 08:58:59,809 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:58:59,813 INFO ]: Computing forward predicates... [2018-06-25 08:59:00,189 INFO ]: Checked inductivity of 26 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:00,221 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:00,221 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 28 [2018-06-25 08:59:00,221 INFO ]: Interpolant automaton has 28 states [2018-06-25 08:59:00,222 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-25 08:59:00,222 INFO ]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2018-06-25 08:59:00,222 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 28 states. [2018-06-25 08:59:00,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:00,434 INFO ]: Finished difference Result 37 states and 39 transitions. [2018-06-25 08:59:00,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-25 08:59:00,434 INFO ]: Start accepts. Automaton has 28 states. Word has length 23 [2018-06-25 08:59:00,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:00,434 INFO ]: With dead ends: 37 [2018-06-25 08:59:00,434 INFO ]: Without dead ends: 25 [2018-06-25 08:59:00,435 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=350, Invalid=1132, Unknown=0, NotChecked=0, Total=1482 [2018-06-25 08:59:00,435 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-25 08:59:00,436 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-25 08:59:00,436 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-25 08:59:00,436 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-25 08:59:00,436 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-06-25 08:59:00,436 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:00,436 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-25 08:59:00,436 INFO ]: Interpolant automaton has 28 states. [2018-06-25 08:59:00,436 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-25 08:59:00,436 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-25 08:59:00,436 INFO ]: Found error trace [2018-06-25 08:59:00,436 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:00,437 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:00,437 INFO ]: Analyzing trace with hash -1639306407, now seen corresponding path program 10 times [2018-06-25 08:59:00,437 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:00,437 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:00,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:00,437 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:00,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:00,464 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:00,911 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:00,911 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:00,911 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-25 08:59:00,916 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:59:00,952 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:59:00,952 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:00,956 INFO ]: Computing forward predicates... [2018-06-25 08:59:01,350 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:01,372 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:01,372 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-06-25 08:59:01,372 INFO ]: Interpolant automaton has 30 states [2018-06-25 08:59:01,372 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 08:59:01,372 INFO ]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2018-06-25 08:59:01,373 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 30 states. [2018-06-25 08:59:02,314 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:02,314 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-25 08:59:02,314 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-25 08:59:02,314 INFO ]: Start accepts. Automaton has 30 states. Word has length 24 [2018-06-25 08:59:02,314 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:02,315 INFO ]: With dead ends: 43 [2018-06-25 08:59:02,315 INFO ]: Without dead ends: 43 [2018-06-25 08:59:02,315 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=243, Invalid=2109, Unknown=0, NotChecked=0, Total=2352 [2018-06-25 08:59:02,315 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 08:59:02,317 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 29. [2018-06-25 08:59:02,317 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-25 08:59:02,317 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-25 08:59:02,317 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2018-06-25 08:59:02,317 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:02,317 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-25 08:59:02,317 INFO ]: Interpolant automaton has 30 states. [2018-06-25 08:59:02,317 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-25 08:59:02,318 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-25 08:59:02,318 INFO ]: Found error trace [2018-06-25 08:59:02,318 INFO ]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:02,318 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:02,318 INFO ]: Analyzing trace with hash -806488894, now seen corresponding path program 11 times [2018-06-25 08:59:02,318 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:02,318 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:02,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:02,319 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:02,319 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:02,333 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:02,631 INFO ]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:02,631 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:02,631 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-25 08:59:02,638 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:59:02,680 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-25 08:59:02,680 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:02,684 INFO ]: Computing forward predicates... [2018-06-25 08:59:02,866 INFO ]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:02,885 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:02,886 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 30 [2018-06-25 08:59:02,886 INFO ]: Interpolant automaton has 30 states [2018-06-25 08:59:02,886 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-25 08:59:02,886 INFO ]: CoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2018-06-25 08:59:02,886 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 30 states. [2018-06-25 08:59:03,211 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:03,211 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-25 08:59:03,212 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-25 08:59:03,212 INFO ]: Start accepts. Automaton has 30 states. Word has length 25 [2018-06-25 08:59:03,212 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:03,212 INFO ]: With dead ends: 45 [2018-06-25 08:59:03,212 INFO ]: Without dead ends: 45 [2018-06-25 08:59:03,213 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=440, Invalid=1282, Unknown=0, NotChecked=0, Total=1722 [2018-06-25 08:59:03,213 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-25 08:59:03,214 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 27. [2018-06-25 08:59:03,214 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-25 08:59:03,215 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-25 08:59:03,215 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-25 08:59:03,215 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:03,215 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-25 08:59:03,215 INFO ]: Interpolant automaton has 30 states. [2018-06-25 08:59:03,215 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-25 08:59:03,215 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-25 08:59:03,215 INFO ]: Found error trace [2018-06-25 08:59:03,215 INFO ]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:03,215 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:03,215 INFO ]: Analyzing trace with hash -984124911, now seen corresponding path program 12 times [2018-06-25 08:59:03,215 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:03,215 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:03,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:03,216 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:03,216 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:03,229 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:03,537 INFO ]: Checked inductivity of 40 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:03,537 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:03,537 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-25 08:59:03,545 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:59:03,588 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-25 08:59:03,588 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:03,591 INFO ]: Computing forward predicates... [2018-06-25 08:59:04,078 INFO ]: Checked inductivity of 40 backedges. 30 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:04,109 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:04,109 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 33 [2018-06-25 08:59:04,109 INFO ]: Interpolant automaton has 33 states [2018-06-25 08:59:04,109 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-25 08:59:04,110 INFO ]: CoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2018-06-25 08:59:04,110 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 33 states. [2018-06-25 08:59:04,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:04,504 INFO ]: Finished difference Result 42 states and 44 transitions. [2018-06-25 08:59:04,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-25 08:59:04,504 INFO ]: Start accepts. Automaton has 33 states. Word has length 26 [2018-06-25 08:59:04,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:04,504 INFO ]: With dead ends: 42 [2018-06-25 08:59:04,504 INFO ]: Without dead ends: 28 [2018-06-25 08:59:04,505 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=475, Invalid=1595, Unknown=0, NotChecked=0, Total=2070 [2018-06-25 08:59:04,505 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-25 08:59:04,506 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-25 08:59:04,506 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-25 08:59:04,506 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-25 08:59:04,506 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-25 08:59:04,506 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:04,506 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-25 08:59:04,506 INFO ]: Interpolant automaton has 33 states. [2018-06-25 08:59:04,506 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-25 08:59:04,507 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-25 08:59:04,507 INFO ]: Found error trace [2018-06-25 08:59:04,507 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:04,507 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:04,507 INFO ]: Analyzing trace with hash 489588026, now seen corresponding path program 13 times [2018-06-25 08:59:04,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:04,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:04,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:04,507 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:04,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:04,525 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:04,936 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:04,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:04,936 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-25 08:59:04,942 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:04,998 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:05,004 INFO ]: Computing forward predicates... [2018-06-25 08:59:06,410 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:06,429 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:06,429 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 35 [2018-06-25 08:59:06,429 INFO ]: Interpolant automaton has 35 states [2018-06-25 08:59:06,429 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 08:59:06,430 INFO ]: CoverageRelationStatistics Valid=78, Invalid=1112, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 08:59:06,430 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 35 states. [2018-06-25 08:59:07,649 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:07,649 INFO ]: Finished difference Result 48 states and 51 transitions. [2018-06-25 08:59:07,649 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-25 08:59:07,649 INFO ]: Start accepts. Automaton has 35 states. Word has length 27 [2018-06-25 08:59:07,649 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:07,649 INFO ]: With dead ends: 48 [2018-06-25 08:59:07,649 INFO ]: Without dead ends: 48 [2018-06-25 08:59:07,650 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=285, Invalid=2907, Unknown=0, NotChecked=0, Total=3192 [2018-06-25 08:59:07,650 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-25 08:59:07,652 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 32. [2018-06-25 08:59:07,652 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-25 08:59:07,652 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-25 08:59:07,652 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2018-06-25 08:59:07,652 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:07,652 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-25 08:59:07,652 INFO ]: Interpolant automaton has 35 states. [2018-06-25 08:59:07,652 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-25 08:59:07,652 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 08:59:07,652 INFO ]: Found error trace [2018-06-25 08:59:07,652 INFO ]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:07,653 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:07,653 INFO ]: Analyzing trace with hash -1069951183, now seen corresponding path program 14 times [2018-06-25 08:59:07,653 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:07,653 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:07,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:07,653 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:07,653 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:07,666 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:08,053 INFO ]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:08,053 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:08,053 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-25 08:59:08,059 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:59:08,117 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:59:08,117 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:08,121 INFO ]: Computing forward predicates... [2018-06-25 08:59:08,589 INFO ]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:08,621 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:08,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 35 [2018-06-25 08:59:08,621 INFO ]: Interpolant automaton has 35 states [2018-06-25 08:59:08,621 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-25 08:59:08,622 INFO ]: CoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2018-06-25 08:59:08,622 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 35 states. [2018-06-25 08:59:09,101 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:09,101 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-25 08:59:09,101 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-25 08:59:09,101 INFO ]: Start accepts. Automaton has 35 states. Word has length 28 [2018-06-25 08:59:09,102 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:09,102 INFO ]: With dead ends: 50 [2018-06-25 08:59:09,102 INFO ]: Without dead ends: 50 [2018-06-25 08:59:09,103 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=593, Invalid=1759, Unknown=0, NotChecked=0, Total=2352 [2018-06-25 08:59:09,103 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-25 08:59:09,104 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 30. [2018-06-25 08:59:09,104 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-25 08:59:09,104 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-25 08:59:09,104 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-25 08:59:09,104 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:09,104 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-25 08:59:09,104 INFO ]: Interpolant automaton has 35 states. [2018-06-25 08:59:09,104 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-25 08:59:09,104 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 08:59:09,104 INFO ]: Found error trace [2018-06-25 08:59:09,105 INFO ]: trace histogram [7, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:09,105 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:09,105 INFO ]: Analyzing trace with hash 478992306, now seen corresponding path program 15 times [2018-06-25 08:59:09,105 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:09,105 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:09,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:09,105 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:09,105 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:09,118 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:09,417 INFO ]: Checked inductivity of 57 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:09,417 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:09,417 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-25 08:59:09,425 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:59:09,490 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-25 08:59:09,490 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:09,494 INFO ]: Computing forward predicates... [2018-06-25 08:59:09,810 INFO ]: Checked inductivity of 57 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:09,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:09,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 38 [2018-06-25 08:59:09,831 INFO ]: Interpolant automaton has 38 states [2018-06-25 08:59:09,831 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-25 08:59:09,831 INFO ]: CoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2018-06-25 08:59:09,831 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 38 states. [2018-06-25 08:59:10,279 WARN ]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-25 08:59:10,668 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:10,668 INFO ]: Finished difference Result 47 states and 49 transitions. [2018-06-25 08:59:10,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-25 08:59:10,669 INFO ]: Start accepts. Automaton has 38 states. Word has length 29 [2018-06-25 08:59:10,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:10,669 INFO ]: With dead ends: 47 [2018-06-25 08:59:10,669 INFO ]: Without dead ends: 31 [2018-06-25 08:59:10,670 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=619, Invalid=2137, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 08:59:10,670 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-25 08:59:10,670 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-25 08:59:10,671 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-25 08:59:10,671 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-25 08:59:10,671 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-06-25 08:59:10,671 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:10,671 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-25 08:59:10,671 INFO ]: Interpolant automaton has 38 states. [2018-06-25 08:59:10,671 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-25 08:59:10,671 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-25 08:59:10,671 INFO ]: Found error trace [2018-06-25 08:59:10,671 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:10,671 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:10,671 INFO ]: Analyzing trace with hash 705398761, now seen corresponding path program 16 times [2018-06-25 08:59:10,671 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:10,671 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:10,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:10,672 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:10,672 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:10,692 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:11,553 INFO ]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:11,553 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:11,553 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-25 08:59:11,558 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:59:11,620 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:59:11,620 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:11,625 INFO ]: Computing forward predicates... [2018-06-25 08:59:12,208 INFO ]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:12,231 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:12,231 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 40 [2018-06-25 08:59:12,231 INFO ]: Interpolant automaton has 40 states [2018-06-25 08:59:12,231 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 08:59:12,231 INFO ]: CoverageRelationStatistics Valid=90, Invalid=1470, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 08:59:12,231 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 40 states. [2018-06-25 08:59:13,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:13,720 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-25 08:59:13,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-25 08:59:13,720 INFO ]: Start accepts. Automaton has 40 states. Word has length 30 [2018-06-25 08:59:13,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:13,720 INFO ]: With dead ends: 53 [2018-06-25 08:59:13,720 INFO ]: Without dead ends: 53 [2018-06-25 08:59:13,721 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=327, Invalid=3833, Unknown=0, NotChecked=0, Total=4160 [2018-06-25 08:59:13,721 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-25 08:59:13,722 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-06-25 08:59:13,722 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-25 08:59:13,723 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-25 08:59:13,723 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2018-06-25 08:59:13,723 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:13,723 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-25 08:59:13,723 INFO ]: Interpolant automaton has 40 states. [2018-06-25 08:59:13,723 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-25 08:59:13,723 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-25 08:59:13,723 INFO ]: Found error trace [2018-06-25 08:59:13,723 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:13,723 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:13,723 INFO ]: Analyzing trace with hash -865935726, now seen corresponding path program 17 times [2018-06-25 08:59:13,723 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:13,723 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:13,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:13,724 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:13,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:13,736 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:14,063 INFO ]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:14,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:14,064 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-25 08:59:14,080 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:59:14,133 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 08:59:14,133 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:14,137 INFO ]: Computing forward predicates... [2018-06-25 08:59:14,574 INFO ]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:14,594 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:14,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 40 [2018-06-25 08:59:14,602 INFO ]: Interpolant automaton has 40 states [2018-06-25 08:59:14,602 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 08:59:14,602 INFO ]: CoverageRelationStatistics Valid=246, Invalid=1314, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 08:59:14,602 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 40 states. [2018-06-25 08:59:15,020 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:15,020 INFO ]: Finished difference Result 55 states and 58 transitions. [2018-06-25 08:59:15,020 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-25 08:59:15,020 INFO ]: Start accepts. Automaton has 40 states. Word has length 31 [2018-06-25 08:59:15,020 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:15,021 INFO ]: With dead ends: 55 [2018-06-25 08:59:15,021 INFO ]: Without dead ends: 55 [2018-06-25 08:59:15,022 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=769, Invalid=2311, Unknown=0, NotChecked=0, Total=3080 [2018-06-25 08:59:15,022 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-25 08:59:15,023 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 33. [2018-06-25 08:59:15,023 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-25 08:59:15,023 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-25 08:59:15,023 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-06-25 08:59:15,023 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:15,023 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-25 08:59:15,023 INFO ]: Interpolant automaton has 40 states. [2018-06-25 08:59:15,023 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-25 08:59:15,023 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-25 08:59:15,023 INFO ]: Found error trace [2018-06-25 08:59:15,023 INFO ]: trace histogram [8, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:15,023 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:15,023 INFO ]: Analyzing trace with hash 1714678433, now seen corresponding path program 18 times [2018-06-25 08:59:15,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:15,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:15,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:15,024 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:15,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:15,038 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:15,431 INFO ]: Checked inductivity of 77 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:15,432 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:15,432 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-25 08:59:15,437 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 08:59:15,495 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-25 08:59:15,495 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:15,500 INFO ]: Computing forward predicates... [2018-06-25 08:59:15,964 INFO ]: Checked inductivity of 77 backedges. 56 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:15,984 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:15,984 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 43 [2018-06-25 08:59:15,984 INFO ]: Interpolant automaton has 43 states [2018-06-25 08:59:15,984 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-25 08:59:15,985 INFO ]: CoverageRelationStatistics Valid=289, Invalid=1517, Unknown=0, NotChecked=0, Total=1806 [2018-06-25 08:59:15,985 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 43 states. [2018-06-25 08:59:16,373 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:16,373 INFO ]: Finished difference Result 52 states and 54 transitions. [2018-06-25 08:59:16,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-25 08:59:16,374 INFO ]: Start accepts. Automaton has 43 states. Word has length 32 [2018-06-25 08:59:16,374 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:16,374 INFO ]: With dead ends: 52 [2018-06-25 08:59:16,374 INFO ]: Without dead ends: 34 [2018-06-25 08:59:16,375 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=782, Invalid=2758, Unknown=0, NotChecked=0, Total=3540 [2018-06-25 08:59:16,375 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-25 08:59:16,376 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-25 08:59:16,376 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-25 08:59:16,376 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-25 08:59:16,376 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-25 08:59:16,376 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:16,376 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-25 08:59:16,376 INFO ]: Interpolant automaton has 43 states. [2018-06-25 08:59:16,376 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-25 08:59:16,376 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-25 08:59:16,376 INFO ]: Found error trace [2018-06-25 08:59:16,376 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:16,376 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:16,376 INFO ]: Analyzing trace with hash -804242678, now seen corresponding path program 19 times [2018-06-25 08:59:16,376 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:16,376 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:16,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:16,377 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:16,377 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:16,402 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:17,032 INFO ]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:17,032 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:17,032 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-25 08:59:17,038 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:17,089 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:17,095 INFO ]: Computing forward predicates... [2018-06-25 08:59:17,820 INFO ]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:17,839 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:17,839 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 45 [2018-06-25 08:59:17,839 INFO ]: Interpolant automaton has 45 states [2018-06-25 08:59:17,840 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-25 08:59:17,840 INFO ]: CoverageRelationStatistics Valid=102, Invalid=1878, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 08:59:17,840 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 45 states. [2018-06-25 08:59:19,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:19,720 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-25 08:59:19,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-25 08:59:19,720 INFO ]: Start accepts. Automaton has 45 states. Word has length 33 [2018-06-25 08:59:19,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:19,721 INFO ]: With dead ends: 58 [2018-06-25 08:59:19,721 INFO ]: Without dead ends: 58 [2018-06-25 08:59:19,722 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=369, Invalid=4887, Unknown=0, NotChecked=0, Total=5256 [2018-06-25 08:59:19,722 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-25 08:59:19,723 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 38. [2018-06-25 08:59:19,723 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-25 08:59:19,723 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-25 08:59:19,723 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2018-06-25 08:59:19,723 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:19,723 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-25 08:59:19,723 INFO ]: Interpolant automaton has 45 states. [2018-06-25 08:59:19,723 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-25 08:59:19,724 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-25 08:59:19,724 INFO ]: Found error trace [2018-06-25 08:59:19,724 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:19,724 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:19,724 INFO ]: Analyzing trace with hash -1581385791, now seen corresponding path program 20 times [2018-06-25 08:59:19,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:19,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:19,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:19,724 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:19,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:19,740 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:20,918 INFO ]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:20,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:20,918 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-25 08:59:20,924 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:59:20,978 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:59:20,978 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:20,982 INFO ]: Computing forward predicates... [2018-06-25 08:59:21,285 INFO ]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:21,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:21,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 45 [2018-06-25 08:59:21,304 INFO ]: Interpolant automaton has 45 states [2018-06-25 08:59:21,305 INFO ]: Constructing interpolant automaton starting with 45 interpolants. [2018-06-25 08:59:21,305 INFO ]: CoverageRelationStatistics Valid=308, Invalid=1672, Unknown=0, NotChecked=0, Total=1980 [2018-06-25 08:59:21,305 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 45 states. [2018-06-25 08:59:21,814 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:21,814 INFO ]: Finished difference Result 60 states and 63 transitions. [2018-06-25 08:59:21,814 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-25 08:59:21,814 INFO ]: Start accepts. Automaton has 45 states. Word has length 34 [2018-06-25 08:59:21,814 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:21,815 INFO ]: With dead ends: 60 [2018-06-25 08:59:21,815 INFO ]: Without dead ends: 60 [2018-06-25 08:59:21,815 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=968, Invalid=2938, Unknown=0, NotChecked=0, Total=3906 [2018-06-25 08:59:21,815 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-25 08:59:21,816 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 36. [2018-06-25 08:59:21,816 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-25 08:59:21,817 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-25 08:59:21,817 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-25 08:59:21,817 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:21,817 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-25 08:59:21,817 INFO ]: Interpolant automaton has 45 states. [2018-06-25 08:59:21,817 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-25 08:59:21,817 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-25 08:59:21,817 INFO ]: Found error trace [2018-06-25 08:59:21,817 INFO ]: trace histogram [9, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:21,817 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:21,818 INFO ]: Analyzing trace with hash -1646765694, now seen corresponding path program 21 times [2018-06-25 08:59:21,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:21,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:21,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:21,818 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:21,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:21,833 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:22,314 INFO ]: Checked inductivity of 100 backedges. 72 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:22,315 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:22,315 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-25 08:59:22,328 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:59:22,397 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 08:59:22,397 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:22,401 INFO ]: Computing forward predicates... [2018-06-25 08:59:23,427 INFO ]: Checked inductivity of 100 backedges. 72 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:23,446 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:23,446 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 48 [2018-06-25 08:59:23,446 INFO ]: Interpolant automaton has 48 states [2018-06-25 08:59:23,447 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-25 08:59:23,447 INFO ]: CoverageRelationStatistics Valid=356, Invalid=1900, Unknown=0, NotChecked=0, Total=2256 [2018-06-25 08:59:23,447 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 48 states. [2018-06-25 08:59:24,057 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:24,057 INFO ]: Finished difference Result 57 states and 59 transitions. [2018-06-25 08:59:24,057 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 08:59:24,057 INFO ]: Start accepts. Automaton has 48 states. Word has length 35 [2018-06-25 08:59:24,057 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:24,057 INFO ]: With dead ends: 57 [2018-06-25 08:59:24,057 INFO ]: Without dead ends: 37 [2018-06-25 08:59:24,057 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=964, Invalid=3458, Unknown=0, NotChecked=0, Total=4422 [2018-06-25 08:59:24,058 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-25 08:59:24,058 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-25 08:59:24,058 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-25 08:59:24,058 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-25 08:59:24,058 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-06-25 08:59:24,058 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:24,058 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-25 08:59:24,058 INFO ]: Interpolant automaton has 48 states. [2018-06-25 08:59:24,058 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-25 08:59:24,059 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-25 08:59:24,059 INFO ]: Found error trace [2018-06-25 08:59:24,059 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:24,059 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:24,059 INFO ]: Analyzing trace with hash -1156987783, now seen corresponding path program 22 times [2018-06-25 08:59:24,059 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:24,059 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:24,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:24,060 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:24,060 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:24,091 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:24,834 INFO ]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:24,834 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:24,834 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:59:24,840 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 08:59:24,899 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 08:59:24,899 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:24,905 INFO ]: Computing forward predicates... [2018-06-25 08:59:26,033 INFO ]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:26,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:26,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 50 [2018-06-25 08:59:26,053 INFO ]: Interpolant automaton has 50 states [2018-06-25 08:59:26,053 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-25 08:59:26,053 INFO ]: CoverageRelationStatistics Valid=114, Invalid=2336, Unknown=0, NotChecked=0, Total=2450 [2018-06-25 08:59:26,053 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 50 states. [2018-06-25 08:59:28,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:28,031 INFO ]: Finished difference Result 63 states and 66 transitions. [2018-06-25 08:59:28,031 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-25 08:59:28,031 INFO ]: Start accepts. Automaton has 50 states. Word has length 36 [2018-06-25 08:59:28,031 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:28,031 INFO ]: With dead ends: 63 [2018-06-25 08:59:28,031 INFO ]: Without dead ends: 63 [2018-06-25 08:59:28,032 INFO ]: 0 DeclaredPredicates, 97 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=411, Invalid=6069, Unknown=0, NotChecked=0, Total=6480 [2018-06-25 08:59:28,032 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-25 08:59:28,034 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 41. [2018-06-25 08:59:28,034 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-25 08:59:28,034 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-25 08:59:28,034 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 36 [2018-06-25 08:59:28,034 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:28,034 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-25 08:59:28,034 INFO ]: Interpolant automaton has 50 states. [2018-06-25 08:59:28,034 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-25 08:59:28,035 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-25 08:59:28,035 INFO ]: Found error trace [2018-06-25 08:59:28,035 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:28,035 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:28,035 INFO ]: Analyzing trace with hash 1141225570, now seen corresponding path program 23 times [2018-06-25 08:59:28,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:28,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:28,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:28,035 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:28,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:28,052 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:28,517 INFO ]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:28,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:28,517 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-25 08:59:28,523 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 08:59:28,589 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-25 08:59:28,589 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:28,595 INFO ]: Computing forward predicates... [2018-06-25 08:59:28,960 INFO ]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:28,979 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:28,979 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2018-06-25 08:59:28,979 INFO ]: Interpolant automaton has 50 states [2018-06-25 08:59:28,979 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-25 08:59:28,979 INFO ]: CoverageRelationStatistics Valid=377, Invalid=2073, Unknown=0, NotChecked=0, Total=2450 [2018-06-25 08:59:28,979 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 50 states. [2018-06-25 08:59:29,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:29,524 INFO ]: Finished difference Result 65 states and 68 transitions. [2018-06-25 08:59:29,525 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-25 08:59:29,525 INFO ]: Start accepts. Automaton has 50 states. Word has length 37 [2018-06-25 08:59:29,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:29,526 INFO ]: With dead ends: 65 [2018-06-25 08:59:29,526 INFO ]: Without dead ends: 65 [2018-06-25 08:59:29,526 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1190, Invalid=3640, Unknown=0, NotChecked=0, Total=4830 [2018-06-25 08:59:29,526 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-25 08:59:29,527 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 39. [2018-06-25 08:59:29,527 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-25 08:59:29,528 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-25 08:59:29,528 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2018-06-25 08:59:29,528 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:29,528 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-25 08:59:29,528 INFO ]: Interpolant automaton has 50 states. [2018-06-25 08:59:29,528 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-25 08:59:29,528 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-25 08:59:29,528 INFO ]: Found error trace [2018-06-25 08:59:29,528 INFO ]: trace histogram [10, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:29,528 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:29,528 INFO ]: Analyzing trace with hash -1332395215, now seen corresponding path program 24 times [2018-06-25 08:59:29,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:29,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:29,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:29,529 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:29,529 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:29,543 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:30,014 INFO ]: Checked inductivity of 126 backedges. 90 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:30,014 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:30,035 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) [2018-06-25 08:59:30,044 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 08:59:30,126 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-25 08:59:30,126 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:30,130 INFO ]: Computing forward predicates... [2018-06-25 08:59:30,686 INFO ]: Checked inductivity of 126 backedges. 90 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:30,705 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:30,705 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 53 [2018-06-25 08:59:30,705 INFO ]: Interpolant automaton has 53 states [2018-06-25 08:59:30,705 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-25 08:59:30,705 INFO ]: CoverageRelationStatistics Valid=430, Invalid=2326, Unknown=0, NotChecked=0, Total=2756 [2018-06-25 08:59:30,705 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 53 states. [2018-06-25 08:59:31,217 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:31,217 INFO ]: Finished difference Result 62 states and 64 transitions. [2018-06-25 08:59:31,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-25 08:59:31,219 INFO ]: Start accepts. Automaton has 53 states. Word has length 38 [2018-06-25 08:59:31,219 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:31,219 INFO ]: With dead ends: 62 [2018-06-25 08:59:31,219 INFO ]: Without dead ends: 40 [2018-06-25 08:59:31,219 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1165, Invalid=4237, Unknown=0, NotChecked=0, Total=5402 [2018-06-25 08:59:31,219 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-25 08:59:31,220 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-25 08:59:31,220 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-25 08:59:31,220 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-25 08:59:31,220 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-25 08:59:31,220 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:31,220 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-25 08:59:31,220 INFO ]: Interpolant automaton has 53 states. [2018-06-25 08:59:31,220 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-25 08:59:31,220 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-25 08:59:31,220 INFO ]: Found error trace [2018-06-25 08:59:31,220 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:31,220 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:31,221 INFO ]: Analyzing trace with hash -362553126, now seen corresponding path program 25 times [2018-06-25 08:59:31,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:31,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:31,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:31,221 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:31,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:31,259 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:32,063 INFO ]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:32,063 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:32,063 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-25 08:59:32,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:32,133 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:32,139 INFO ]: Computing forward predicates... [2018-06-25 08:59:33,207 INFO ]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:33,226 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:33,226 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 55 [2018-06-25 08:59:33,227 INFO ]: Interpolant automaton has 55 states [2018-06-25 08:59:33,227 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-25 08:59:33,227 INFO ]: CoverageRelationStatistics Valid=126, Invalid=2844, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 08:59:33,227 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 55 states. [2018-06-25 08:59:35,909 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:35,909 INFO ]: Finished difference Result 68 states and 71 transitions. [2018-06-25 08:59:35,909 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-25 08:59:35,909 INFO ]: Start accepts. Automaton has 55 states. Word has length 39 [2018-06-25 08:59:35,909 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:35,909 INFO ]: With dead ends: 68 [2018-06-25 08:59:35,909 INFO ]: Without dead ends: 68 [2018-06-25 08:59:35,910 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=453, Invalid=7379, Unknown=0, NotChecked=0, Total=7832 [2018-06-25 08:59:35,910 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-25 08:59:35,912 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 44. [2018-06-25 08:59:35,912 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-25 08:59:35,912 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-25 08:59:35,912 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 39 [2018-06-25 08:59:35,912 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:35,912 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-25 08:59:35,912 INFO ]: Interpolant automaton has 55 states. [2018-06-25 08:59:35,912 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-25 08:59:35,912 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-25 08:59:35,912 INFO ]: Found error trace [2018-06-25 08:59:35,913 INFO ]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:35,913 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:35,913 INFO ]: Analyzing trace with hash -362219439, now seen corresponding path program 26 times [2018-06-25 08:59:35,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:35,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:35,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:35,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 08:59:35,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:35,928 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:36,457 INFO ]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:36,458 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:36,458 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-25 08:59:36,463 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 08:59:36,542 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 08:59:36,542 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:36,547 INFO ]: Computing forward predicates... [2018-06-25 08:59:36,950 INFO ]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:36,969 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:36,969 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 55 [2018-06-25 08:59:36,969 INFO ]: Interpolant automaton has 55 states [2018-06-25 08:59:36,970 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-25 08:59:36,970 INFO ]: CoverageRelationStatistics Valid=453, Invalid=2517, Unknown=0, NotChecked=0, Total=2970 [2018-06-25 08:59:36,970 INFO ]: Start difference. First operand 44 states and 46 transitions. Second operand 55 states. [2018-06-25 08:59:37,750 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:37,751 INFO ]: Finished difference Result 70 states and 73 transitions. [2018-06-25 08:59:37,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-25 08:59:37,752 INFO ]: Start accepts. Automaton has 55 states. Word has length 40 [2018-06-25 08:59:37,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:37,752 INFO ]: With dead ends: 70 [2018-06-25 08:59:37,752 INFO ]: Without dead ends: 70 [2018-06-25 08:59:37,753 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1435, Invalid=4417, Unknown=0, NotChecked=0, Total=5852 [2018-06-25 08:59:37,753 INFO ]: Start minimizeSevpa. Operand 70 states. [2018-06-25 08:59:37,754 INFO ]: Finished minimizeSevpa. Reduced states from 70 to 42. [2018-06-25 08:59:37,755 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-25 08:59:37,755 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-06-25 08:59:37,755 INFO ]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-06-25 08:59:37,755 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:37,755 INFO ]: Abstraction has 42 states and 43 transitions. [2018-06-25 08:59:37,755 INFO ]: Interpolant automaton has 55 states. [2018-06-25 08:59:37,755 INFO ]: Start isEmpty. Operand 42 states and 43 transitions. [2018-06-25 08:59:37,755 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-25 08:59:37,755 INFO ]: Found error trace [2018-06-25 08:59:37,755 INFO ]: trace histogram [11, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:37,755 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:37,755 INFO ]: Analyzing trace with hash 1910098770, now seen corresponding path program 27 times [2018-06-25 08:59:37,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:37,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:37,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:37,758 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:37,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:37,785 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:38,288 INFO ]: Checked inductivity of 155 backedges. 110 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:38,288 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 08:59:38,288 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-25 08:59:38,293 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 08:59:38,377 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-25 08:59:38,377 INFO ]: Conjunction of SSA is unsat [2018-06-25 08:59:38,383 INFO ]: Computing forward predicates... [2018-06-25 08:59:39,093 INFO ]: Checked inductivity of 155 backedges. 110 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 08:59:39,112 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 08:59:39,112 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 58 [2018-06-25 08:59:39,112 INFO ]: Interpolant automaton has 58 states [2018-06-25 08:59:39,113 INFO ]: Constructing interpolant automaton starting with 58 interpolants. [2018-06-25 08:59:39,113 INFO ]: CoverageRelationStatistics Valid=511, Invalid=2795, Unknown=0, NotChecked=0, Total=3306 [2018-06-25 08:59:39,113 INFO ]: Start difference. First operand 42 states and 43 transitions. Second operand 58 states. [2018-06-25 08:59:39,692 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 08:59:39,692 INFO ]: Finished difference Result 67 states and 69 transitions. [2018-06-25 08:59:39,692 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-25 08:59:39,692 INFO ]: Start accepts. Automaton has 58 states. Word has length 41 [2018-06-25 08:59:39,693 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 08:59:39,693 INFO ]: With dead ends: 67 [2018-06-25 08:59:39,693 INFO ]: Without dead ends: 43 [2018-06-25 08:59:39,693 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1385, Invalid=5095, Unknown=0, NotChecked=0, Total=6480 [2018-06-25 08:59:39,693 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-25 08:59:39,694 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-06-25 08:59:39,694 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-25 08:59:39,694 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-06-25 08:59:39,694 INFO ]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-06-25 08:59:39,694 INFO ]: Finished accepts. word is rejected. [2018-06-25 08:59:39,695 INFO ]: Abstraction has 43 states and 44 transitions. [2018-06-25 08:59:39,695 INFO ]: Interpolant automaton has 58 states. [2018-06-25 08:59:39,695 INFO ]: Start isEmpty. Operand 43 states and 44 transitions. [2018-06-25 08:59:39,695 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-25 08:59:39,695 INFO ]: Found error trace [2018-06-25 08:59:39,695 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 08:59:39,695 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 08:59:39,695 INFO ]: Analyzing trace with hash -2064195319, now seen corresponding path program 28 times [2018-06-25 08:59:39,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 08:59:39,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 08:59:39,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:39,695 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 08:59:39,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 08:59:39,738 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-25 08:59:40,203 WARN ]: Removed 2 from assertion stack [2018-06-25 08:59:40,236 WARN ]: Verification canceled [2018-06-25 08:59:40,338 WARN ]: Timeout [2018-06-25 08:59:40,338 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 08:59:40 BoogieIcfgContainer [2018-06-25 08:59:40,338 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 08:59:40,339 INFO ]: Toolchain (without parser) took 59883.38 ms. Allocated memory was 306.7 MB in the beginning and 793.8 MB in the end (delta: 487.1 MB). Free memory was 257.1 MB in the beginning and 766.0 MB in the end (delta: -508.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 3.6 GB. [2018-06-25 08:59:40,339 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 08:59:40,340 INFO ]: ChcToBoogie took 56.51 ms. Allocated memory is still 306.7 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:59:40,340 INFO ]: Boogie Preprocessor took 48.77 ms. Allocated memory is still 306.7 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:59:40,340 INFO ]: RCFGBuilder took 345.77 ms. Allocated memory is still 306.7 MB. Free memory was 253.1 MB in the beginning and 237.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. [2018-06-25 08:59:40,340 INFO ]: TraceAbstraction took 59423.78 ms. Allocated memory was 306.7 MB in the beginning and 793.8 MB in the end (delta: 487.1 MB). Free memory was 237.2 MB in the beginning and 766.0 MB in the end (delta: -528.9 MB). Peak memory consumption was 85.9 MB. Max. memory is 3.6 GB. [2018-06-25 08:59:40,343 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 306.7 MB. Free memory is still 269.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.51 ms. Allocated memory is still 306.7 MB. Free memory was 257.1 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.77 ms. Allocated memory is still 306.7 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 345.77 ms. Allocated memory is still 306.7 MB. Free memory was 253.1 MB in the beginning and 237.2 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 59423.78 ms. Allocated memory was 306.7 MB in the beginning and 793.8 MB in the end (delta: 487.1 MB). Free memory was 237.2 MB in the beginning and 766.0 MB in the end (delta: -528.9 MB). Peak memory consumption was 85.9 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 19. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. TIMEOUT Result, 59.3s OverallTime, 44 OverallIterations, 11 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 720 SDtfs, 1385 SDslu, 7241 SDs, 0 SdLazy, 11320 SolverSat, 1327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2018 GetRequests, 456 SyntacticMatches, 22 SemanticMatches, 1540 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17789 ImplicationChecksByTransitivity, 44.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 533 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 1754 NumberOfCodeBlocks, 1754 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 1680 ConstructedInterpolants, 0 QuantifiedInterpolants, 457562 SizeOfPredicates, 1817 NumberOfNonLiveVariables, 12860 ConjunctsInSsa, 3449 ConjunctsInUnsatCore, 74 InterpolantComputations, 14 PerfectInterpolantSequences, 1334/3341 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_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_08-59-40-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_08-59-40-351.csv Completed graceful shutdown