java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i '/storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:55:06,043 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:55:06,045 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:55:06,057 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:55:06,058 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:55:06,059 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:55:06,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:55:06,061 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:55:06,063 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:55:06,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:55:06,067 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:55:06,067 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:55:06,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:55:06,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:55:06,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:55:06,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:55:06,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:55:06,077 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:55:06,079 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:55:06,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:55:06,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:55:06,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:55:06,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:55:06,083 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:55:06,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:55:06,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:55:06,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:55:06,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:55:06,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:55:06,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:55:06,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:55:06,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:55:06,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:55:06,090 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:55:06,090 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:55:06,091 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:55:06,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:55:06,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:55:06,112 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:55:06,112 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:55:06,113 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:55:06,113 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:55:06,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:55:06,118 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:55:06,118 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:55:06,118 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:55:06,118 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:55:06,119 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:55:06,119 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:55:06,119 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:55:06,119 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:55:06,119 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:55:06,119 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:55:06,120 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:55:06,120 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:55:06,122 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:55:06,122 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:55:06,181 INFO ]: Repository-Root is: /tmp [2018-06-22 11:55:06,194 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:55:06,197 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:55:06,199 INFO ]: Initializing SmtParser... [2018-06-22 11:55:06,199 INFO ]: SmtParser initialized [2018-06-22 11:55:06,200 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2 [2018-06-22 11:55:06,201 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-22 11:55:06,298 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@2cb66b4a [2018-06-22 11:55:06,681 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__ackermann!.smt2 [2018-06-22 11:55:06,685 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:55:06,695 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:55:06,695 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:55:06,695 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:55:06,695 INFO ]: ChcToBoogie initialized [2018-06-22 11:55:06,699 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:55:06" (1/1) ... [2018-06-22 11:55:06,760 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06 Unit [2018-06-22 11:55:06,760 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:55:06,761 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:55:06,761 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:55:06,761 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:55:06,785 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06" (1/1) ... [2018-06-22 11:55:06,785 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06" (1/1) ... [2018-06-22 11:55:06,796 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06" (1/1) ... [2018-06-22 11:55:06,796 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06" (1/1) ... [2018-06-22 11:55:06,821 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06" (1/1) ... [2018-06-22 11:55:06,826 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06" (1/1) ... [2018-06-22 11:55:06,837 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06" (1/1) ... [2018-06-22 11:55:06,840 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:55:06,841 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:55:06,841 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:55:06,841 INFO ]: RCFGBuilder initialized [2018-06-22 11:55:06,842 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:55:06,870 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:55:06,870 INFO ]: Found specification of procedure False [2018-06-22 11:55:06,870 INFO ]: Found implementation of procedure False [2018-06-22 11:55:06,870 INFO ]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration [2018-06-22 11:55:06,870 INFO ]: Found specification of procedure INV_REC_f__1 [2018-06-22 11:55:06,870 INFO ]: Found implementation of procedure INV_REC_f__1 [2018-06-22 11:55:06,870 INFO ]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration [2018-06-22 11:55:06,870 INFO ]: Found specification of procedure INV_REC_f__1_PRE [2018-06-22 11:55:06,870 INFO ]: Found implementation of procedure INV_REC_f__1_PRE [2018-06-22 11:55:06,870 INFO ]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration [2018-06-22 11:55:06,870 INFO ]: Found specification of procedure INV_REC_f^f_PRE [2018-06-22 11:55:06,870 INFO ]: Found implementation of procedure INV_REC_f^f_PRE [2018-06-22 11:55:06,870 INFO ]: Specification and implementation of procedure INV_REC_f^f given in one single declaration [2018-06-22 11:55:06,871 INFO ]: Found specification of procedure INV_REC_f^f [2018-06-22 11:55:06,871 INFO ]: Found implementation of procedure INV_REC_f^f [2018-06-22 11:55:06,871 INFO ]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration [2018-06-22 11:55:06,871 INFO ]: Found specification of procedure INV_REC_f__2 [2018-06-22 11:55:06,871 INFO ]: Found implementation of procedure INV_REC_f__2 [2018-06-22 11:55:06,871 INFO ]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration [2018-06-22 11:55:06,871 INFO ]: Found specification of procedure INV_REC_f__2_PRE [2018-06-22 11:55:06,871 INFO ]: Found implementation of procedure INV_REC_f__2_PRE [2018-06-22 11:55:06,871 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:55:06,871 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:55:06,871 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:55:07,905 INFO ]: Using library mode [2018-06-22 11:55:07,905 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:55:07 BoogieIcfgContainer [2018-06-22 11:55:07,905 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:55:07,907 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:55:07,907 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:55:07,910 INFO ]: TraceAbstraction initialized [2018-06-22 11:55:07,910 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:55:06" (1/3) ... [2018-06-22 11:55:07,911 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4290ca25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:55:07, skipping insertion in model container [2018-06-22 11:55:07,911 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:06" (2/3) ... [2018-06-22 11:55:07,911 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4290ca25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:55:07, skipping insertion in model container [2018-06-22 11:55:07,912 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:55:07" (3/3) ... [2018-06-22 11:55:07,916 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:55:07,924 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:55:07,932 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:55:07,977 INFO ]: Using default assertion order modulation [2018-06-22 11:55:07,977 INFO ]: Interprodecural is true [2018-06-22 11:55:07,977 INFO ]: Hoare is false [2018-06-22 11:55:07,977 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:55:07,977 INFO ]: Backedges is TWOTRACK [2018-06-22 11:55:07,977 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:55:07,977 INFO ]: Difference is false [2018-06-22 11:55:07,977 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:55:07,977 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:55:07,993 INFO ]: Start isEmpty. Operand 104 states. [2018-06-22 11:55:08,016 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 11:55:08,016 INFO ]: Found error trace [2018-06-22 11:55:08,017 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 11:55:08,018 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:08,021 INFO ]: Analyzing trace with hash 367384381, now seen corresponding path program 1 times [2018-06-22 11:55:08,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:08,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:08,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:08,057 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:08,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:08,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:08,092 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:08,095 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:08,095 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 11:55:08,097 INFO ]: Interpolant automaton has 2 states [2018-06-22 11:55:08,112 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 11:55:08,113 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:55:08,115 INFO ]: Start difference. First operand 104 states. Second operand 2 states. [2018-06-22 11:55:08,152 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:08,153 INFO ]: Finished difference Result 94 states and 195 transitions. [2018-06-22 11:55:08,153 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 11:55:08,154 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 11:55:08,154 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:08,172 INFO ]: With dead ends: 94 [2018-06-22 11:55:08,172 INFO ]: Without dead ends: 94 [2018-06-22 11:55:08,174 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 11:55:08,191 INFO ]: Start minimizeSevpa. Operand 94 states. [2018-06-22 11:55:08,246 INFO ]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-06-22 11:55:08,247 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-22 11:55:08,252 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 195 transitions. [2018-06-22 11:55:08,254 INFO ]: Start accepts. Automaton has 94 states and 195 transitions. Word has length 5 [2018-06-22 11:55:08,255 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:08,255 INFO ]: Abstraction has 94 states and 195 transitions. [2018-06-22 11:55:08,255 INFO ]: Interpolant automaton has 2 states. [2018-06-22 11:55:08,255 INFO ]: Start isEmpty. Operand 94 states and 195 transitions. [2018-06-22 11:55:08,264 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:08,264 INFO ]: Found error trace [2018-06-22 11:55:08,264 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:08,264 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:08,264 INFO ]: Analyzing trace with hash 1383256593, now seen corresponding path program 1 times [2018-06-22 11:55:08,264 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:08,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:08,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:08,265 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:08,265 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:08,300 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:08,526 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:08,526 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:08,526 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:08,528 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:08,528 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:08,528 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:08,528 INFO ]: Start difference. First operand 94 states and 195 transitions. Second operand 4 states. [2018-06-22 11:55:09,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:09,347 INFO ]: Finished difference Result 107 states and 255 transitions. [2018-06-22 11:55:09,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:09,347 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:09,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:09,356 INFO ]: With dead ends: 107 [2018-06-22 11:55:09,356 INFO ]: Without dead ends: 107 [2018-06-22 11:55:09,357 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:09,357 INFO ]: Start minimizeSevpa. Operand 107 states. [2018-06-22 11:55:09,383 INFO ]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-06-22 11:55:09,383 INFO ]: Start removeUnreachable. Operand 105 states. [2018-06-22 11:55:09,387 INFO ]: Finished removeUnreachable. Reduced from 105 states to 105 states and 242 transitions. [2018-06-22 11:55:09,387 INFO ]: Start accepts. Automaton has 105 states and 242 transitions. Word has length 13 [2018-06-22 11:55:09,387 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:09,387 INFO ]: Abstraction has 105 states and 242 transitions. [2018-06-22 11:55:09,387 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:09,387 INFO ]: Start isEmpty. Operand 105 states and 242 transitions. [2018-06-22 11:55:09,393 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:09,393 INFO ]: Found error trace [2018-06-22 11:55:09,393 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:09,393 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:09,393 INFO ]: Analyzing trace with hash 1010905344, now seen corresponding path program 1 times [2018-06-22 11:55:09,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:09,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:09,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:09,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:09,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:09,412 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:09,450 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:09,450 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:09,450 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:09,450 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:09,451 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:09,451 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:09,451 INFO ]: Start difference. First operand 105 states and 242 transitions. Second operand 4 states. [2018-06-22 11:55:09,911 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:09,912 INFO ]: Finished difference Result 125 states and 299 transitions. [2018-06-22 11:55:09,912 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:09,912 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:09,912 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:09,920 INFO ]: With dead ends: 125 [2018-06-22 11:55:09,920 INFO ]: Without dead ends: 125 [2018-06-22 11:55:09,920 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:09,921 INFO ]: Start minimizeSevpa. Operand 125 states. [2018-06-22 11:55:09,953 INFO ]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-06-22 11:55:09,953 INFO ]: Start removeUnreachable. Operand 125 states. [2018-06-22 11:55:09,960 INFO ]: Finished removeUnreachable. Reduced from 125 states to 125 states and 299 transitions. [2018-06-22 11:55:09,960 INFO ]: Start accepts. Automaton has 125 states and 299 transitions. Word has length 13 [2018-06-22 11:55:09,961 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:09,963 INFO ]: Abstraction has 125 states and 299 transitions. [2018-06-22 11:55:09,963 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:09,963 INFO ]: Start isEmpty. Operand 125 states and 299 transitions. [2018-06-22 11:55:09,968 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:09,968 INFO ]: Found error trace [2018-06-22 11:55:09,969 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:09,969 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:09,969 INFO ]: Analyzing trace with hash -889702705, now seen corresponding path program 1 times [2018-06-22 11:55:09,969 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:09,969 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:09,969 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:09,970 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:09,970 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:09,992 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:10,046 INFO ]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:55:10,046 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:10,046 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:10,046 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:10,046 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:10,046 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:10,046 INFO ]: Start difference. First operand 125 states and 299 transitions. Second operand 4 states. [2018-06-22 11:55:10,403 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:10,403 INFO ]: Finished difference Result 130 states and 320 transitions. [2018-06-22 11:55:10,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:10,403 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:55:10,404 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:10,407 INFO ]: With dead ends: 130 [2018-06-22 11:55:10,407 INFO ]: Without dead ends: 130 [2018-06-22 11:55:10,407 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:10,408 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-22 11:55:10,427 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-06-22 11:55:10,427 INFO ]: Start removeUnreachable. Operand 128 states. [2018-06-22 11:55:10,431 INFO ]: Finished removeUnreachable. Reduced from 128 states to 128 states and 318 transitions. [2018-06-22 11:55:10,431 INFO ]: Start accepts. Automaton has 128 states and 318 transitions. Word has length 21 [2018-06-22 11:55:10,431 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:10,431 INFO ]: Abstraction has 128 states and 318 transitions. [2018-06-22 11:55:10,431 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:10,431 INFO ]: Start isEmpty. Operand 128 states and 318 transitions. [2018-06-22 11:55:10,436 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:10,436 INFO ]: Found error trace [2018-06-22 11:55:10,436 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:10,436 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:10,436 INFO ]: Analyzing trace with hash 96039781, now seen corresponding path program 1 times [2018-06-22 11:55:10,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:10,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:10,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:10,437 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:10,437 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:10,446 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:10,540 INFO ]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:55:10,541 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:10,541 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:10,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:10,570 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:10,578 INFO ]: Computing forward predicates... [2018-06-22 11:55:10,617 INFO ]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:10,648 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:55:10,648 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 11:55:10,649 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:10,649 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:10,649 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:10,649 INFO ]: Start difference. First operand 128 states and 318 transitions. Second operand 4 states. [2018-06-22 11:55:11,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:11,112 INFO ]: Finished difference Result 127 states and 315 transitions. [2018-06-22 11:55:11,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:11,114 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 11:55:11,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:11,117 INFO ]: With dead ends: 127 [2018-06-22 11:55:11,117 INFO ]: Without dead ends: 126 [2018-06-22 11:55:11,118 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:11,118 INFO ]: Start minimizeSevpa. Operand 126 states. [2018-06-22 11:55:11,135 INFO ]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-06-22 11:55:11,135 INFO ]: Start removeUnreachable. Operand 126 states. [2018-06-22 11:55:11,138 INFO ]: Finished removeUnreachable. Reduced from 126 states to 126 states and 313 transitions. [2018-06-22 11:55:11,138 INFO ]: Start accepts. Automaton has 126 states and 313 transitions. Word has length 21 [2018-06-22 11:55:11,138 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:11,138 INFO ]: Abstraction has 126 states and 313 transitions. [2018-06-22 11:55:11,138 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:11,138 INFO ]: Start isEmpty. Operand 126 states and 313 transitions. [2018-06-22 11:55:11,143 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:11,143 INFO ]: Found error trace [2018-06-22 11:55:11,143 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:11,143 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:11,143 INFO ]: Analyzing trace with hash 1426168377, now seen corresponding path program 1 times [2018-06-22 11:55:11,143 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:11,143 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:11,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:11,144 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:11,144 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:11,150 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:11,215 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:11,215 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:11,215 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 11:55:11,215 INFO ]: Interpolant automaton has 3 states [2018-06-22 11:55:11,215 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 11:55:11,215 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 11:55:11,215 INFO ]: Start difference. First operand 126 states and 313 transitions. Second operand 3 states. [2018-06-22 11:55:11,401 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:11,401 INFO ]: Finished difference Result 130 states and 334 transitions. [2018-06-22 11:55:11,427 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 11:55:11,427 INFO ]: Start accepts. Automaton has 3 states. Word has length 21 [2018-06-22 11:55:11,427 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:11,430 INFO ]: With dead ends: 130 [2018-06-22 11:55:11,430 INFO ]: Without dead ends: 130 [2018-06-22 11:55:11,431 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-22 11:55:11,431 INFO ]: Start minimizeSevpa. Operand 130 states. [2018-06-22 11:55:11,459 INFO ]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-06-22 11:55:11,459 INFO ]: Start removeUnreachable. Operand 130 states. [2018-06-22 11:55:11,465 INFO ]: Finished removeUnreachable. Reduced from 130 states to 130 states and 334 transitions. [2018-06-22 11:55:11,465 INFO ]: Start accepts. Automaton has 130 states and 334 transitions. Word has length 21 [2018-06-22 11:55:11,465 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:11,465 INFO ]: Abstraction has 130 states and 334 transitions. [2018-06-22 11:55:11,465 INFO ]: Interpolant automaton has 3 states. [2018-06-22 11:55:11,465 INFO ]: Start isEmpty. Operand 130 states and 334 transitions. [2018-06-22 11:55:11,469 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:55:11,469 INFO ]: Found error trace [2018-06-22 11:55:11,470 INFO ]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:11,470 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:11,470 INFO ]: Analyzing trace with hash 230059929, now seen corresponding path program 1 times [2018-06-22 11:55:11,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:11,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:11,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:11,470 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:11,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:11,488 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:11,549 INFO ]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:55:11,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:11,549 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:11,559 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:11,589 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:11,591 INFO ]: Computing forward predicates... [2018-06-22 11:55:11,617 INFO ]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:55:11,640 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:55:11,640 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 11:55:11,641 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:11,641 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:11,641 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:11,641 INFO ]: Start difference. First operand 130 states and 334 transitions. Second operand 4 states. [2018-06-22 11:55:11,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:11,937 INFO ]: Finished difference Result 132 states and 340 transitions. [2018-06-22 11:55:11,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:11,938 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-22 11:55:11,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:11,942 INFO ]: With dead ends: 132 [2018-06-22 11:55:11,942 INFO ]: Without dead ends: 132 [2018-06-22 11:55:11,942 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:11,942 INFO ]: Start minimizeSevpa. Operand 132 states. [2018-06-22 11:55:11,968 INFO ]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-06-22 11:55:11,968 INFO ]: Start removeUnreachable. Operand 132 states. [2018-06-22 11:55:11,971 INFO ]: Finished removeUnreachable. Reduced from 132 states to 132 states and 340 transitions. [2018-06-22 11:55:11,972 INFO ]: Start accepts. Automaton has 132 states and 340 transitions. Word has length 29 [2018-06-22 11:55:11,972 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:11,972 INFO ]: Abstraction has 132 states and 340 transitions. [2018-06-22 11:55:11,972 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:11,972 INFO ]: Start isEmpty. Operand 132 states and 340 transitions. [2018-06-22 11:55:11,977 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:55:11,977 INFO ]: Found error trace [2018-06-22 11:55:11,977 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:11,977 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:11,978 INFO ]: Analyzing trace with hash -1909515577, now seen corresponding path program 1 times [2018-06-22 11:55:11,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:11,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:11,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:11,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:11,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:11,998 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:12,082 INFO ]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-22 11:55:12,082 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:12,082 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:12,097 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:12,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:12,142 INFO ]: Computing forward predicates... [2018-06-22 11:55:12,187 INFO ]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:55:12,211 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:55:12,211 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-06-22 11:55:12,211 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:55:12,212 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:55:12,212 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:55:12,212 INFO ]: Start difference. First operand 132 states and 340 transitions. Second operand 8 states. [2018-06-22 11:55:13,216 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:13,216 INFO ]: Finished difference Result 175 states and 562 transitions. [2018-06-22 11:55:13,216 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:55:13,216 INFO ]: Start accepts. Automaton has 8 states. Word has length 37 [2018-06-22 11:55:13,216 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:13,222 INFO ]: With dead ends: 175 [2018-06-22 11:55:13,222 INFO ]: Without dead ends: 166 [2018-06-22 11:55:13,222 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:55:13,223 INFO ]: Start minimizeSevpa. Operand 166 states. [2018-06-22 11:55:13,273 INFO ]: Finished minimizeSevpa. Reduced states from 166 to 154. [2018-06-22 11:55:13,273 INFO ]: Start removeUnreachable. Operand 154 states. [2018-06-22 11:55:13,275 INFO ]: Finished removeUnreachable. Reduced from 154 states to 154 states and 469 transitions. [2018-06-22 11:55:13,275 INFO ]: Start accepts. Automaton has 154 states and 469 transitions. Word has length 37 [2018-06-22 11:55:13,276 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:13,276 INFO ]: Abstraction has 154 states and 469 transitions. [2018-06-22 11:55:13,276 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:55:13,276 INFO ]: Start isEmpty. Operand 154 states and 469 transitions. [2018-06-22 11:55:13,281 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:55:13,281 INFO ]: Found error trace [2018-06-22 11:55:13,281 INFO ]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:13,281 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:13,284 INFO ]: Analyzing trace with hash -798603525, now seen corresponding path program 1 times [2018-06-22 11:55:13,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:13,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:13,284 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:13,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:13,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:13,294 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:13,388 INFO ]: Checked inductivity of 41 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:55:13,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:13,389 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:13,405 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:13,439 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:13,444 INFO ]: Computing forward predicates... [2018-06-22 11:55:13,620 INFO ]: Checked inductivity of 41 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:55:13,639 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:13,639 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:55:13,640 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:55:13,640 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:55:13,640 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:55:13,640 INFO ]: Start difference. First operand 154 states and 469 transitions. Second operand 10 states. [2018-06-22 11:55:14,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:14,663 INFO ]: Finished difference Result 236 states and 903 transitions. [2018-06-22 11:55:14,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:55:14,663 INFO ]: Start accepts. Automaton has 10 states. Word has length 37 [2018-06-22 11:55:14,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:14,673 INFO ]: With dead ends: 236 [2018-06-22 11:55:14,673 INFO ]: Without dead ends: 236 [2018-06-22 11:55:14,673 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:55:14,673 INFO ]: Start minimizeSevpa. Operand 236 states. [2018-06-22 11:55:14,722 INFO ]: Finished minimizeSevpa. Reduced states from 236 to 227. [2018-06-22 11:55:14,722 INFO ]: Start removeUnreachable. Operand 227 states. [2018-06-22 11:55:14,729 INFO ]: Finished removeUnreachable. Reduced from 227 states to 227 states and 855 transitions. [2018-06-22 11:55:14,729 INFO ]: Start accepts. Automaton has 227 states and 855 transitions. Word has length 37 [2018-06-22 11:55:14,730 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:14,730 INFO ]: Abstraction has 227 states and 855 transitions. [2018-06-22 11:55:14,730 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:55:14,730 INFO ]: Start isEmpty. Operand 227 states and 855 transitions. [2018-06-22 11:55:14,739 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:55:14,739 INFO ]: Found error trace [2018-06-22 11:55:14,739 INFO ]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:14,739 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:14,739 INFO ]: Analyzing trace with hash 53202123, now seen corresponding path program 1 times [2018-06-22 11:55:14,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:14,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:14,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:14,740 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:14,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:14,764 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:14,923 INFO ]: Checked inductivity of 44 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-22 11:55:14,923 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:14,923 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:14,924 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:14,924 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:14,924 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:14,924 INFO ]: Start difference. First operand 227 states and 855 transitions. Second operand 4 states. [2018-06-22 11:55:15,071 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:15,071 INFO ]: Finished difference Result 235 states and 874 transitions. [2018-06-22 11:55:15,074 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:15,074 INFO ]: Start accepts. Automaton has 4 states. Word has length 45 [2018-06-22 11:55:15,074 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:15,080 INFO ]: With dead ends: 235 [2018-06-22 11:55:15,080 INFO ]: Without dead ends: 235 [2018-06-22 11:55:15,080 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:15,081 INFO ]: Start minimizeSevpa. Operand 235 states. [2018-06-22 11:55:15,112 INFO ]: Finished minimizeSevpa. Reduced states from 235 to 231. [2018-06-22 11:55:15,112 INFO ]: Start removeUnreachable. Operand 231 states. [2018-06-22 11:55:15,117 INFO ]: Finished removeUnreachable. Reduced from 231 states to 231 states and 860 transitions. [2018-06-22 11:55:15,117 INFO ]: Start accepts. Automaton has 231 states and 860 transitions. Word has length 45 [2018-06-22 11:55:15,117 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:15,117 INFO ]: Abstraction has 231 states and 860 transitions. [2018-06-22 11:55:15,117 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:15,117 INFO ]: Start isEmpty. Operand 231 states and 860 transitions. [2018-06-22 11:55:15,125 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:55:15,125 INFO ]: Found error trace [2018-06-22 11:55:15,125 INFO ]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:15,125 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:15,125 INFO ]: Analyzing trace with hash 1296954016, now seen corresponding path program 1 times [2018-06-22 11:55:15,125 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:15,125 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:15,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:15,126 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:15,126 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:15,132 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:15,241 INFO ]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:55:15,241 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:15,241 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:15,247 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:15,264 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:15,266 INFO ]: Computing forward predicates... [2018-06-22 11:55:15,312 INFO ]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 11:55:15,334 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:15,334 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-06-22 11:55:15,334 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:55:15,334 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:55:15,334 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:55:15,334 INFO ]: Start difference. First operand 231 states and 860 transitions. Second operand 8 states. [2018-06-22 11:55:15,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:15,727 INFO ]: Finished difference Result 282 states and 1099 transitions. [2018-06-22 11:55:15,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:55:15,729 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 11:55:15,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:15,735 INFO ]: With dead ends: 282 [2018-06-22 11:55:15,735 INFO ]: Without dead ends: 272 [2018-06-22 11:55:15,735 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:55:15,735 INFO ]: Start minimizeSevpa. Operand 272 states. [2018-06-22 11:55:15,777 INFO ]: Finished minimizeSevpa. Reduced states from 272 to 268. [2018-06-22 11:55:15,777 INFO ]: Start removeUnreachable. Operand 268 states. [2018-06-22 11:55:15,782 INFO ]: Finished removeUnreachable. Reduced from 268 states to 268 states and 1038 transitions. [2018-06-22 11:55:15,782 INFO ]: Start accepts. Automaton has 268 states and 1038 transitions. Word has length 29 [2018-06-22 11:55:15,783 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:15,783 INFO ]: Abstraction has 268 states and 1038 transitions. [2018-06-22 11:55:15,783 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:55:15,783 INFO ]: Start isEmpty. Operand 268 states and 1038 transitions. [2018-06-22 11:55:15,790 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:55:15,790 INFO ]: Found error trace [2018-06-22 11:55:15,790 INFO ]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:15,790 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:15,790 INFO ]: Analyzing trace with hash 1126293178, now seen corresponding path program 2 times [2018-06-22 11:55:15,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:15,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:15,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:15,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:15,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:15,801 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:16,669 INFO ]: Checked inductivity of 31 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-22 11:55:16,670 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:16,670 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) [2018-06-22 11:55:16,686 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:16,738 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:55:16,738 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:16,741 INFO ]: Computing forward predicates... [2018-06-22 11:55:17,158 INFO ]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:55:17,183 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:55:17,184 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2018-06-22 11:55:17,184 INFO ]: Interpolant automaton has 15 states [2018-06-22 11:55:17,184 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-22 11:55:17,185 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:55:17,185 INFO ]: Start difference. First operand 268 states and 1038 transitions. Second operand 15 states. [2018-06-22 11:55:19,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:19,882 INFO ]: Finished difference Result 558 states and 2932 transitions. [2018-06-22 11:55:19,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-22 11:55:19,884 INFO ]: Start accepts. Automaton has 15 states. Word has length 41 [2018-06-22 11:55:19,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:19,900 INFO ]: With dead ends: 558 [2018-06-22 11:55:19,900 INFO ]: Without dead ends: 519 [2018-06-22 11:55:19,901 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:55:19,901 INFO ]: Start minimizeSevpa. Operand 519 states. [2018-06-22 11:55:20,059 INFO ]: Finished minimizeSevpa. Reduced states from 519 to 399. [2018-06-22 11:55:20,059 INFO ]: Start removeUnreachable. Operand 399 states. [2018-06-22 11:55:20,069 INFO ]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2102 transitions. [2018-06-22 11:55:20,069 INFO ]: Start accepts. Automaton has 399 states and 2102 transitions. Word has length 41 [2018-06-22 11:55:20,069 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:20,069 INFO ]: Abstraction has 399 states and 2102 transitions. [2018-06-22 11:55:20,069 INFO ]: Interpolant automaton has 15 states. [2018-06-22 11:55:20,069 INFO ]: Start isEmpty. Operand 399 states and 2102 transitions. [2018-06-22 11:55:20,082 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:55:20,082 INFO ]: Found error trace [2018-06-22 11:55:20,082 INFO ]: trace histogram [6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:20,082 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:20,083 INFO ]: Analyzing trace with hash 1879760292, now seen corresponding path program 1 times [2018-06-22 11:55:20,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:20,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:20,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:20,083 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:20,083 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:20,095 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:20,774 INFO ]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:55:20,774 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:20,775 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:20,781 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:20,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:20,811 INFO ]: Computing forward predicates... [2018-06-22 11:55:21,021 INFO ]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:55:21,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:21,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 11:55:21,040 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:55:21,041 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:55:21,041 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:55:21,041 INFO ]: Start difference. First operand 399 states and 2102 transitions. Second operand 11 states. [2018-06-22 11:55:21,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:21,549 INFO ]: Finished difference Result 555 states and 3066 transitions. [2018-06-22 11:55:21,550 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:55:21,550 INFO ]: Start accepts. Automaton has 11 states. Word has length 41 [2018-06-22 11:55:21,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:21,563 INFO ]: With dead ends: 555 [2018-06-22 11:55:21,563 INFO ]: Without dead ends: 533 [2018-06-22 11:55:21,563 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:55:21,563 INFO ]: Start minimizeSevpa. Operand 533 states. [2018-06-22 11:55:21,700 INFO ]: Finished minimizeSevpa. Reduced states from 533 to 427. [2018-06-22 11:55:21,700 INFO ]: Start removeUnreachable. Operand 427 states. [2018-06-22 11:55:21,714 INFO ]: Finished removeUnreachable. Reduced from 427 states to 427 states and 2317 transitions. [2018-06-22 11:55:21,714 INFO ]: Start accepts. Automaton has 427 states and 2317 transitions. Word has length 41 [2018-06-22 11:55:21,715 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:21,715 INFO ]: Abstraction has 427 states and 2317 transitions. [2018-06-22 11:55:21,715 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:55:21,716 INFO ]: Start isEmpty. Operand 427 states and 2317 transitions. [2018-06-22 11:55:21,733 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:55:21,733 INFO ]: Found error trace [2018-06-22 11:55:21,733 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:21,733 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:21,733 INFO ]: Analyzing trace with hash 1135547214, now seen corresponding path program 1 times [2018-06-22 11:55:21,733 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:21,733 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:21,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:21,734 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:21,734 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:21,746 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:21,987 INFO ]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:55:21,987 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:21,987 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) [2018-06-22 11:55:22,001 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:22,046 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:22,050 INFO ]: Computing forward predicates... [2018-06-22 11:55:22,130 INFO ]: Checked inductivity of 22 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:55:22,150 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:55:22,151 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2018-06-22 11:55:22,151 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:55:22,152 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:55:22,152 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:55:22,152 INFO ]: Start difference. First operand 427 states and 2317 transitions. Second operand 8 states. [2018-06-22 11:55:23,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:23,567 INFO ]: Finished difference Result 509 states and 2878 transitions. [2018-06-22 11:55:23,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:55:23,568 INFO ]: Start accepts. Automaton has 8 states. Word has length 49 [2018-06-22 11:55:23,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:23,586 INFO ]: With dead ends: 509 [2018-06-22 11:55:23,586 INFO ]: Without dead ends: 509 [2018-06-22 11:55:23,586 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:55:23,587 INFO ]: Start minimizeSevpa. Operand 509 states. [2018-06-22 11:55:23,718 INFO ]: Finished minimizeSevpa. Reduced states from 509 to 467. [2018-06-22 11:55:23,718 INFO ]: Start removeUnreachable. Operand 467 states. [2018-06-22 11:55:23,738 INFO ]: Finished removeUnreachable. Reduced from 467 states to 467 states and 2536 transitions. [2018-06-22 11:55:23,739 INFO ]: Start accepts. Automaton has 467 states and 2536 transitions. Word has length 49 [2018-06-22 11:55:23,739 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:23,739 INFO ]: Abstraction has 467 states and 2536 transitions. [2018-06-22 11:55:23,739 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:55:23,739 INFO ]: Start isEmpty. Operand 467 states and 2536 transitions. [2018-06-22 11:55:23,755 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:55:23,755 INFO ]: Found error trace [2018-06-22 11:55:23,755 INFO ]: trace histogram [6, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:23,756 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:23,756 INFO ]: Analyzing trace with hash -848612802, now seen corresponding path program 1 times [2018-06-22 11:55:23,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:23,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:23,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:23,756 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:23,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:23,772 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:24,016 INFO ]: Checked inductivity of 67 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:55:24,016 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:24,016 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:24,021 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:24,056 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:24,059 INFO ]: Computing forward predicates... [2018-06-22 11:55:24,139 INFO ]: Checked inductivity of 67 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-06-22 11:55:24,164 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:24,164 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-22 11:55:24,165 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:55:24,165 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:55:24,165 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:55:24,165 INFO ]: Start difference. First operand 467 states and 2536 transitions. Second operand 10 states. [2018-06-22 11:55:25,141 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:25,141 INFO ]: Finished difference Result 739 states and 4110 transitions. [2018-06-22 11:55:25,142 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-22 11:55:25,142 INFO ]: Start accepts. Automaton has 10 states. Word has length 49 [2018-06-22 11:55:25,142 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:25,154 INFO ]: With dead ends: 739 [2018-06-22 11:55:25,154 INFO ]: Without dead ends: 641 [2018-06-22 11:55:25,154 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-06-22 11:55:25,155 INFO ]: Start minimizeSevpa. Operand 641 states. [2018-06-22 11:55:25,311 INFO ]: Finished minimizeSevpa. Reduced states from 641 to 527. [2018-06-22 11:55:25,311 INFO ]: Start removeUnreachable. Operand 527 states. [2018-06-22 11:55:25,324 INFO ]: Finished removeUnreachable. Reduced from 527 states to 527 states and 2918 transitions. [2018-06-22 11:55:25,324 INFO ]: Start accepts. Automaton has 527 states and 2918 transitions. Word has length 49 [2018-06-22 11:55:25,324 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:25,324 INFO ]: Abstraction has 527 states and 2918 transitions. [2018-06-22 11:55:25,324 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:55:25,324 INFO ]: Start isEmpty. Operand 527 states and 2918 transitions. [2018-06-22 11:55:25,343 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:55:25,343 INFO ]: Found error trace [2018-06-22 11:55:25,343 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:25,343 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:25,344 INFO ]: Analyzing trace with hash -1284260855, now seen corresponding path program 1 times [2018-06-22 11:55:25,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:25,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:25,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:25,344 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:25,344 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:25,350 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:25,488 INFO ]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:55:25,488 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:25,488 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:25,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:25,539 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:25,541 INFO ]: Computing forward predicates... [2018-06-22 11:55:25,779 INFO ]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-22 11:55:25,803 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:55:25,803 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-22 11:55:25,803 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:55:25,803 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:55:25,803 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:55:25,804 INFO ]: Start difference. First operand 527 states and 2918 transitions. Second operand 6 states. [2018-06-22 11:55:25,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:25,922 INFO ]: Finished difference Result 531 states and 2892 transitions. [2018-06-22 11:55:25,923 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:25,923 INFO ]: Start accepts. Automaton has 6 states. Word has length 45 [2018-06-22 11:55:25,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:25,938 INFO ]: With dead ends: 531 [2018-06-22 11:55:25,938 INFO ]: Without dead ends: 531 [2018-06-22 11:55:25,938 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:55:25,938 INFO ]: Start minimizeSevpa. Operand 531 states. [2018-06-22 11:55:26,039 INFO ]: Finished minimizeSevpa. Reduced states from 531 to 527. [2018-06-22 11:55:26,039 INFO ]: Start removeUnreachable. Operand 527 states. [2018-06-22 11:55:26,051 INFO ]: Finished removeUnreachable. Reduced from 527 states to 527 states and 2888 transitions. [2018-06-22 11:55:26,052 INFO ]: Start accepts. Automaton has 527 states and 2888 transitions. Word has length 45 [2018-06-22 11:55:26,052 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:26,052 INFO ]: Abstraction has 527 states and 2888 transitions. [2018-06-22 11:55:26,052 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:55:26,052 INFO ]: Start isEmpty. Operand 527 states and 2888 transitions. [2018-06-22 11:55:26,068 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:55:26,069 INFO ]: Found error trace [2018-06-22 11:55:26,069 INFO ]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:26,069 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:26,069 INFO ]: Analyzing trace with hash -1414262746, now seen corresponding path program 1 times [2018-06-22 11:55:26,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:26,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:26,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:26,069 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:26,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:26,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:26,189 INFO ]: Checked inductivity of 41 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:55:26,190 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:26,190 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:26,197 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:26,215 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:26,217 INFO ]: Computing forward predicates... [2018-06-22 11:55:26,513 INFO ]: Checked inductivity of 41 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:55:26,545 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:26,545 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-22 11:55:26,545 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:55:26,545 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:55:26,545 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:55:26,546 INFO ]: Start difference. First operand 527 states and 2888 transitions. Second operand 10 states. [2018-06-22 11:55:28,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:28,244 INFO ]: Finished difference Result 562 states and 3106 transitions. [2018-06-22 11:55:28,245 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:55:28,245 INFO ]: Start accepts. Automaton has 10 states. Word has length 45 [2018-06-22 11:55:28,245 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:28,255 INFO ]: With dead ends: 562 [2018-06-22 11:55:28,255 INFO ]: Without dead ends: 562 [2018-06-22 11:55:28,256 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:55:28,256 INFO ]: Start minimizeSevpa. Operand 562 states. [2018-06-22 11:55:28,360 INFO ]: Finished minimizeSevpa. Reduced states from 562 to 533. [2018-06-22 11:55:28,360 INFO ]: Start removeUnreachable. Operand 533 states. [2018-06-22 11:55:28,373 INFO ]: Finished removeUnreachable. Reduced from 533 states to 533 states and 2931 transitions. [2018-06-22 11:55:28,373 INFO ]: Start accepts. Automaton has 533 states and 2931 transitions. Word has length 45 [2018-06-22 11:55:28,373 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:28,373 INFO ]: Abstraction has 533 states and 2931 transitions. [2018-06-22 11:55:28,373 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:55:28,373 INFO ]: Start isEmpty. Operand 533 states and 2931 transitions. [2018-06-22 11:55:28,393 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 11:55:28,393 INFO ]: Found error trace [2018-06-22 11:55:28,393 INFO ]: trace histogram [8, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:28,393 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:28,394 INFO ]: Analyzing trace with hash 450570930, now seen corresponding path program 1 times [2018-06-22 11:55:28,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:28,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:28,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:28,394 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:28,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:28,402 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:28,908 INFO ]: Checked inductivity of 121 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 11:55:28,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:28,908 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:28,922 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:28,964 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:28,967 INFO ]: Computing forward predicates... [2018-06-22 11:55:29,466 INFO ]: Checked inductivity of 121 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:55:29,488 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:29,488 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 14 [2018-06-22 11:55:29,488 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:55:29,488 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:55:29,488 INFO ]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:55:29,488 INFO ]: Start difference. First operand 533 states and 2931 transitions. Second operand 14 states. [2018-06-22 11:55:31,185 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:31,185 INFO ]: Finished difference Result 1048 states and 9481 transitions. [2018-06-22 11:55:31,185 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:55:31,185 INFO ]: Start accepts. Automaton has 14 states. Word has length 65 [2018-06-22 11:55:31,186 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:31,225 INFO ]: With dead ends: 1048 [2018-06-22 11:55:31,225 INFO ]: Without dead ends: 1037 [2018-06-22 11:55:31,226 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2018-06-22 11:55:31,226 INFO ]: Start minimizeSevpa. Operand 1037 states. [2018-06-22 11:55:31,730 INFO ]: Finished minimizeSevpa. Reduced states from 1037 to 674. [2018-06-22 11:55:31,730 INFO ]: Start removeUnreachable. Operand 674 states. [2018-06-22 11:55:31,748 INFO ]: Finished removeUnreachable. Reduced from 674 states to 674 states and 4584 transitions. [2018-06-22 11:55:31,748 INFO ]: Start accepts. Automaton has 674 states and 4584 transitions. Word has length 65 [2018-06-22 11:55:31,748 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:31,748 INFO ]: Abstraction has 674 states and 4584 transitions. [2018-06-22 11:55:31,748 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:55:31,748 INFO ]: Start isEmpty. Operand 674 states and 4584 transitions. [2018-06-22 11:55:31,761 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:55:31,761 INFO ]: Found error trace [2018-06-22 11:55:31,761 INFO ]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:31,762 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:31,762 INFO ]: Analyzing trace with hash 1930928399, now seen corresponding path program 1 times [2018-06-22 11:55:31,762 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:31,762 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:31,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:31,763 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:31,763 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:31,771 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:32,010 INFO ]: Checked inductivity of 37 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-06-22 11:55:32,010 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:32,010 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:32,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:32,036 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:32,038 INFO ]: Computing forward predicates... [2018-06-22 11:55:32,095 INFO ]: Checked inductivity of 37 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:55:32,115 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:32,115 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2018-06-22 11:55:32,115 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:55:32,115 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:55:32,115 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:55:32,116 INFO ]: Start difference. First operand 674 states and 4584 transitions. Second operand 10 states. [2018-06-22 11:55:33,055 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:33,055 INFO ]: Finished difference Result 992 states and 7686 transitions. [2018-06-22 11:55:33,055 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:55:33,055 INFO ]: Start accepts. Automaton has 10 states. Word has length 49 [2018-06-22 11:55:33,055 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:33,085 INFO ]: With dead ends: 992 [2018-06-22 11:55:33,085 INFO ]: Without dead ends: 958 [2018-06-22 11:55:33,085 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:55:33,085 INFO ]: Start minimizeSevpa. Operand 958 states. [2018-06-22 11:55:33,295 INFO ]: Finished minimizeSevpa. Reduced states from 958 to 812. [2018-06-22 11:55:33,295 INFO ]: Start removeUnreachable. Operand 812 states. [2018-06-22 11:55:33,322 INFO ]: Finished removeUnreachable. Reduced from 812 states to 812 states and 6269 transitions. [2018-06-22 11:55:33,322 INFO ]: Start accepts. Automaton has 812 states and 6269 transitions. Word has length 49 [2018-06-22 11:55:33,322 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:33,322 INFO ]: Abstraction has 812 states and 6269 transitions. [2018-06-22 11:55:33,322 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:55:33,322 INFO ]: Start isEmpty. Operand 812 states and 6269 transitions. [2018-06-22 11:55:33,339 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-22 11:55:33,339 INFO ]: Found error trace [2018-06-22 11:55:33,340 INFO ]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:33,342 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:33,342 INFO ]: Analyzing trace with hash 589318081, now seen corresponding path program 1 times [2018-06-22 11:55:33,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:33,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:33,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:33,342 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:33,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:33,356 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:33,701 WARN ]: Spent 218.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-06-22 11:55:33,771 INFO ]: Checked inductivity of 119 backedges. 10 proven. 28 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-06-22 11:55:33,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:33,771 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:33,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:33,827 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:33,830 INFO ]: Computing forward predicates... [2018-06-22 11:55:33,883 INFO ]: Checked inductivity of 119 backedges. 79 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:55:33,903 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:33,903 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-06-22 11:55:33,904 INFO ]: Interpolant automaton has 12 states [2018-06-22 11:55:33,904 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-22 11:55:33,904 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-22 11:55:33,904 INFO ]: Start difference. First operand 812 states and 6269 transitions. Second operand 12 states. [2018-06-22 11:55:35,608 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:35,608 INFO ]: Finished difference Result 1394 states and 14397 transitions. [2018-06-22 11:55:35,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-22 11:55:35,609 INFO ]: Start accepts. Automaton has 12 states. Word has length 77 [2018-06-22 11:55:35,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:35,686 INFO ]: With dead ends: 1394 [2018-06-22 11:55:35,686 INFO ]: Without dead ends: 1394 [2018-06-22 11:55:35,686 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:55:35,688 INFO ]: Start minimizeSevpa. Operand 1394 states. [2018-06-22 11:55:36,147 INFO ]: Finished minimizeSevpa. Reduced states from 1394 to 1330. [2018-06-22 11:55:36,147 INFO ]: Start removeUnreachable. Operand 1330 states. [2018-06-22 11:55:36,216 INFO ]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 13782 transitions. [2018-06-22 11:55:36,216 INFO ]: Start accepts. Automaton has 1330 states and 13782 transitions. Word has length 77 [2018-06-22 11:55:36,216 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:36,216 INFO ]: Abstraction has 1330 states and 13782 transitions. [2018-06-22 11:55:36,216 INFO ]: Interpolant automaton has 12 states. [2018-06-22 11:55:36,216 INFO ]: Start isEmpty. Operand 1330 states and 13782 transitions. [2018-06-22 11:55:36,235 INFO ]: Finished isEmpty. Found accepting run of length 86 [2018-06-22 11:55:36,235 INFO ]: Found error trace [2018-06-22 11:55:36,235 INFO ]: trace histogram [10, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:36,235 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:36,237 INFO ]: Analyzing trace with hash -1135593751, now seen corresponding path program 1 times [2018-06-22 11:55:36,237 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:36,237 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:36,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:36,238 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:36,238 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:36,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:36,437 WARN ]: Spent 132.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-06-22 11:55:36,482 INFO ]: Checked inductivity of 191 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-06-22 11:55:36,482 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:36,482 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:36,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:36,547 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:36,550 INFO ]: Computing forward predicates... [2018-06-22 11:55:36,599 INFO ]: Checked inductivity of 191 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-06-22 11:55:36,618 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:55:36,618 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2018-06-22 11:55:36,619 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:55:36,619 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:55:36,619 INFO ]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:55:36,619 INFO ]: Start difference. First operand 1330 states and 13782 transitions. Second operand 13 states. [2018-06-22 11:55:38,210 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:38,210 INFO ]: Finished difference Result 2233 states and 29650 transitions. [2018-06-22 11:55:38,210 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:55:38,210 INFO ]: Start accepts. Automaton has 13 states. Word has length 85 [2018-06-22 11:55:38,210 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:38,352 INFO ]: With dead ends: 2233 [2018-06-22 11:55:38,352 INFO ]: Without dead ends: 2233 [2018-06-22 11:55:38,352 INFO ]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-06-22 11:55:38,354 INFO ]: Start minimizeSevpa. Operand 2233 states. [2018-06-22 11:55:39,825 INFO ]: Finished minimizeSevpa. Reduced states from 2233 to 2028. [2018-06-22 11:55:39,825 INFO ]: Start removeUnreachable. Operand 2028 states. [2018-06-22 11:55:39,941 INFO ]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 26811 transitions. [2018-06-22 11:55:39,941 INFO ]: Start accepts. Automaton has 2028 states and 26811 transitions. Word has length 85 [2018-06-22 11:55:39,942 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:39,942 INFO ]: Abstraction has 2028 states and 26811 transitions. [2018-06-22 11:55:39,942 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:55:39,942 INFO ]: Start isEmpty. Operand 2028 states and 26811 transitions. [2018-06-22 11:55:39,977 INFO ]: Finished isEmpty. Found accepting run of length 138 [2018-06-22 11:55:39,977 INFO ]: Found error trace [2018-06-22 11:55:39,977 INFO ]: trace histogram [10, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:39,977 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:39,977 INFO ]: Analyzing trace with hash 87705453, now seen corresponding path program 1 times [2018-06-22 11:55:39,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:39,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:39,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:39,978 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:39,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:39,993 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:40,074 INFO ]: Checked inductivity of 342 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-06-22 11:55:40,074 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:40,074 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:40,081 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:40,140 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:40,144 INFO ]: Computing forward predicates... [2018-06-22 11:55:40,195 INFO ]: Checked inductivity of 342 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-06-22 11:55:40,214 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:40,214 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-06-22 11:55:40,215 INFO ]: Interpolant automaton has 10 states [2018-06-22 11:55:40,215 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-22 11:55:40,215 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-22 11:55:40,215 INFO ]: Start difference. First operand 2028 states and 26811 transitions. Second operand 10 states. [2018-06-22 11:55:41,364 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:41,364 INFO ]: Finished difference Result 2186 states and 30739 transitions. [2018-06-22 11:55:41,366 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:55:41,366 INFO ]: Start accepts. Automaton has 10 states. Word has length 137 [2018-06-22 11:55:41,366 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:41,587 INFO ]: With dead ends: 2186 [2018-06-22 11:55:41,587 INFO ]: Without dead ends: 2177 [2018-06-22 11:55:41,588 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:55:41,589 INFO ]: Start minimizeSevpa. Operand 2177 states. [2018-06-22 11:55:42,915 INFO ]: Finished minimizeSevpa. Reduced states from 2177 to 2081. [2018-06-22 11:55:42,915 INFO ]: Start removeUnreachable. Operand 2081 states. [2018-06-22 11:55:43,046 INFO ]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 28387 transitions. [2018-06-22 11:55:43,046 INFO ]: Start accepts. Automaton has 2081 states and 28387 transitions. Word has length 137 [2018-06-22 11:55:43,046 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:43,046 INFO ]: Abstraction has 2081 states and 28387 transitions. [2018-06-22 11:55:43,047 INFO ]: Interpolant automaton has 10 states. [2018-06-22 11:55:43,047 INFO ]: Start isEmpty. Operand 2081 states and 28387 transitions. [2018-06-22 11:55:43,072 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:55:43,072 INFO ]: Found error trace [2018-06-22 11:55:43,072 INFO ]: trace histogram [6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:43,072 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:43,072 INFO ]: Analyzing trace with hash 17563479, now seen corresponding path program 1 times [2018-06-22 11:55:43,072 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:43,072 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:43,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:43,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:43,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:43,080 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:43,278 INFO ]: Checked inductivity of 70 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:55:43,278 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:43,278 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:43,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:43,311 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:43,313 INFO ]: Computing forward predicates... [2018-06-22 11:55:43,372 INFO ]: Checked inductivity of 70 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 11:55:43,398 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:43,398 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-06-22 11:55:43,399 INFO ]: Interpolant automaton has 16 states [2018-06-22 11:55:43,399 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 11:55:43,399 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:55:43,399 INFO ]: Start difference. First operand 2081 states and 28387 transitions. Second operand 16 states. [2018-06-22 11:55:46,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:46,675 INFO ]: Finished difference Result 2879 states and 42076 transitions. [2018-06-22 11:55:46,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-22 11:55:46,675 INFO ]: Start accepts. Automaton has 16 states. Word has length 53 [2018-06-22 11:55:46,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:46,902 INFO ]: With dead ends: 2879 [2018-06-22 11:55:46,902 INFO ]: Without dead ends: 2793 [2018-06-22 11:55:46,902 INFO ]: 0 DeclaredPredicates, 115 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2018-06-22 11:55:46,903 INFO ]: Start minimizeSevpa. Operand 2793 states. [2018-06-22 11:55:48,456 INFO ]: Finished minimizeSevpa. Reduced states from 2793 to 2276. [2018-06-22 11:55:48,456 INFO ]: Start removeUnreachable. Operand 2276 states. [2018-06-22 11:55:48,586 INFO ]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 34072 transitions. [2018-06-22 11:55:48,586 INFO ]: Start accepts. Automaton has 2276 states and 34072 transitions. Word has length 53 [2018-06-22 11:55:48,586 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:48,586 INFO ]: Abstraction has 2276 states and 34072 transitions. [2018-06-22 11:55:48,586 INFO ]: Interpolant automaton has 16 states. [2018-06-22 11:55:48,586 INFO ]: Start isEmpty. Operand 2276 states and 34072 transitions. [2018-06-22 11:55:48,612 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:55:48,612 INFO ]: Found error trace [2018-06-22 11:55:48,612 INFO ]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:48,612 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:48,613 INFO ]: Analyzing trace with hash 1111813111, now seen corresponding path program 1 times [2018-06-22 11:55:48,613 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:48,613 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:48,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:48,614 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:48,614 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:48,622 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:48,675 INFO ]: Checked inductivity of 46 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:55:48,675 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:48,675 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:48,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:48,920 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:48,922 INFO ]: Computing forward predicates... [2018-06-22 11:55:48,937 INFO ]: Checked inductivity of 46 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:55:48,958 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:55:48,958 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-06-22 11:55:48,958 INFO ]: Interpolant automaton has 6 states [2018-06-22 11:55:48,958 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 11:55:48,958 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:55:48,958 INFO ]: Start difference. First operand 2276 states and 34072 transitions. Second operand 6 states. [2018-06-22 11:55:49,407 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:49,407 INFO ]: Finished difference Result 2482 states and 42947 transitions. [2018-06-22 11:55:49,407 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:55:49,407 INFO ]: Start accepts. Automaton has 6 states. Word has length 57 [2018-06-22 11:55:49,408 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:49,695 INFO ]: With dead ends: 2482 [2018-06-22 11:55:49,695 INFO ]: Without dead ends: 2462 [2018-06-22 11:55:49,696 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:55:49,697 INFO ]: Start minimizeSevpa. Operand 2462 states. [2018-06-22 11:55:51,616 INFO ]: Finished minimizeSevpa. Reduced states from 2462 to 2304. [2018-06-22 11:55:51,616 INFO ]: Start removeUnreachable. Operand 2304 states. [2018-06-22 11:55:51,768 INFO ]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 36403 transitions. [2018-06-22 11:55:51,768 INFO ]: Start accepts. Automaton has 2304 states and 36403 transitions. Word has length 57 [2018-06-22 11:55:51,769 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:51,769 INFO ]: Abstraction has 2304 states and 36403 transitions. [2018-06-22 11:55:51,769 INFO ]: Interpolant automaton has 6 states. [2018-06-22 11:55:51,769 INFO ]: Start isEmpty. Operand 2304 states and 36403 transitions. [2018-06-22 11:55:51,798 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:55:51,798 INFO ]: Found error trace [2018-06-22 11:55:51,798 INFO ]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:51,798 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:51,798 INFO ]: Analyzing trace with hash 99317157, now seen corresponding path program 1 times [2018-06-22 11:55:51,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:51,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:51,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:51,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:51,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:51,808 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:51,944 INFO ]: Checked inductivity of 37 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 11:55:51,944 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:51,944 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:51,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:51,969 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:51,971 INFO ]: Computing forward predicates... [2018-06-22 11:55:52,024 INFO ]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 11:55:52,043 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:55:52,043 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2018-06-22 11:55:52,043 INFO ]: Interpolant automaton has 14 states [2018-06-22 11:55:52,043 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 11:55:52,043 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-22 11:55:52,043 INFO ]: Start difference. First operand 2304 states and 36403 transitions. Second operand 14 states. [2018-06-22 11:55:53,727 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:53,727 INFO ]: Finished difference Result 2710 states and 41907 transitions. [2018-06-22 11:55:53,727 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 11:55:53,728 INFO ]: Start accepts. Automaton has 14 states. Word has length 49 [2018-06-22 11:55:53,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:54,189 INFO ]: With dead ends: 2710 [2018-06-22 11:55:54,189 INFO ]: Without dead ends: 2706 [2018-06-22 11:55:54,189 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-06-22 11:55:54,191 INFO ]: Start minimizeSevpa. Operand 2706 states. [2018-06-22 11:55:56,673 INFO ]: Finished minimizeSevpa. Reduced states from 2706 to 2298. [2018-06-22 11:55:56,673 INFO ]: Start removeUnreachable. Operand 2298 states. [2018-06-22 11:55:56,834 INFO ]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 38240 transitions. [2018-06-22 11:55:56,834 INFO ]: Start accepts. Automaton has 2298 states and 38240 transitions. Word has length 49 [2018-06-22 11:55:56,834 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:56,834 INFO ]: Abstraction has 2298 states and 38240 transitions. [2018-06-22 11:55:56,834 INFO ]: Interpolant automaton has 14 states. [2018-06-22 11:55:56,834 INFO ]: Start isEmpty. Operand 2298 states and 38240 transitions. [2018-06-22 11:55:56,857 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:55:56,857 INFO ]: Found error trace [2018-06-22 11:55:56,858 INFO ]: trace histogram [6, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:56,858 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:56,858 INFO ]: Analyzing trace with hash -1374675697, now seen corresponding path program 1 times [2018-06-22 11:55:56,858 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:56,858 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:56,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:56,859 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:56,859 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:56,863 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:56,914 INFO ]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:55:56,914 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:56,914 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:56,919 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:56,939 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:56,941 INFO ]: Computing forward predicates... [2018-06-22 11:55:56,983 INFO ]: Checked inductivity of 56 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-22 11:55:57,018 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:57,018 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-22 11:55:57,018 INFO ]: Interpolant automaton has 11 states [2018-06-22 11:55:57,018 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 11:55:57,018 INFO ]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-06-22 11:55:57,018 INFO ]: Start difference. First operand 2298 states and 38240 transitions. Second operand 11 states. [2018-06-22 11:55:57,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:57,791 INFO ]: Finished difference Result 2496 states and 41653 transitions. [2018-06-22 11:55:57,792 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:55:57,792 INFO ]: Start accepts. Automaton has 11 states. Word has length 49 [2018-06-22 11:55:57,792 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:58,011 INFO ]: With dead ends: 2496 [2018-06-22 11:55:58,011 INFO ]: Without dead ends: 2496 [2018-06-22 11:55:58,011 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-06-22 11:55:58,012 INFO ]: Start minimizeSevpa. Operand 2496 states. [2018-06-22 11:56:00,396 INFO ]: Finished minimizeSevpa. Reduced states from 2496 to 2298. [2018-06-22 11:56:00,396 INFO ]: Start removeUnreachable. Operand 2298 states. [2018-06-22 11:56:00,545 INFO ]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 38240 transitions. [2018-06-22 11:56:00,545 INFO ]: Start accepts. Automaton has 2298 states and 38240 transitions. Word has length 49 [2018-06-22 11:56:00,545 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:00,545 INFO ]: Abstraction has 2298 states and 38240 transitions. [2018-06-22 11:56:00,545 INFO ]: Interpolant automaton has 11 states. [2018-06-22 11:56:00,545 INFO ]: Start isEmpty. Operand 2298 states and 38240 transitions. [2018-06-22 11:56:00,568 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:56:00,568 INFO ]: Found error trace [2018-06-22 11:56:00,568 INFO ]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:00,568 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:00,569 INFO ]: Analyzing trace with hash 1009875383, now seen corresponding path program 1 times [2018-06-22 11:56:00,569 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:00,569 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:00,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:00,569 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:00,569 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:00,573 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:00,590 INFO ]: Checked inductivity of 76 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-06-22 11:56:00,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:00,590 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:00,596 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:00,617 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:00,619 INFO ]: Computing forward predicates... [2018-06-22 11:56:00,623 INFO ]: Checked inductivity of 76 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-06-22 11:56:00,804 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 11:56:00,804 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 11:56:00,804 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:56:00,804 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:56:00,804 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:00,804 INFO ]: Start difference. First operand 2298 states and 38240 transitions. Second operand 4 states. [2018-06-22 11:56:01,060 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:56:01,060 INFO ]: Finished difference Result 2362 states and 38340 transitions. [2018-06-22 11:56:01,060 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:56:01,060 INFO ]: Start accepts. Automaton has 4 states. Word has length 57 [2018-06-22 11:56:01,060 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:56:01,332 INFO ]: With dead ends: 2362 [2018-06-22 11:56:01,332 INFO ]: Without dead ends: 2362 [2018-06-22 11:56:01,333 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:56:01,334 INFO ]: Start minimizeSevpa. Operand 2362 states. [2018-06-22 11:56:03,729 INFO ]: Finished minimizeSevpa. Reduced states from 2362 to 2298. [2018-06-22 11:56:03,729 INFO ]: Start removeUnreachable. Operand 2298 states. [2018-06-22 11:56:03,881 INFO ]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 38051 transitions. [2018-06-22 11:56:03,881 INFO ]: Start accepts. Automaton has 2298 states and 38051 transitions. Word has length 57 [2018-06-22 11:56:03,881 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:56:03,881 INFO ]: Abstraction has 2298 states and 38051 transitions. [2018-06-22 11:56:03,881 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:56:03,881 INFO ]: Start isEmpty. Operand 2298 states and 38051 transitions. [2018-06-22 11:56:03,904 INFO ]: Finished isEmpty. Found accepting run of length 62 [2018-06-22 11:56:03,904 INFO ]: Found error trace [2018-06-22 11:56:03,904 INFO ]: trace histogram [5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:56:03,904 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:56:03,904 INFO ]: Analyzing trace with hash 1933430180, now seen corresponding path program 1 times [2018-06-22 11:56:03,904 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:56:03,904 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:56:03,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:03,904 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:03,904 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:56:03,917 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:04,218 INFO ]: Checked inductivity of 61 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:56:04,218 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:56:04,218 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:56:04,224 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:56:04,250 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:56:04,251 INFO ]: Computing forward predicates... [2018-06-22 11:56:04,626 INFO ]: Checked inductivity of 61 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-06-22 11:56:04,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:56:04,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-06-22 11:56:04,645 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:56:04,645 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:56:04,645 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:56:04,646 INFO ]: Start difference. First operand 2298 states and 38051 transitions. Second operand 17 states. Received shutdown request... [2018-06-22 11:56:04,925 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-22 11:56:04,925 WARN ]: Verification canceled [2018-06-22 11:56:04,929 WARN ]: Timeout [2018-06-22 11:56:04,929 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:56:04 BoogieIcfgContainer [2018-06-22 11:56:04,929 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:56:04,929 INFO ]: Toolchain (without parser) took 58242.39 ms. Allocated memory was 303.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 251.4 MB in the beginning and 630.5 MB in the end (delta: -379.1 MB). Peak memory consumption was 808.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:56:04,930 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:56:04,930 INFO ]: ChcToBoogie took 65.41 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:56:04,931 INFO ]: Boogie Preprocessor took 79.38 ms. Allocated memory is still 303.0 MB. Free memory was 249.4 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:56:04,931 INFO ]: RCFGBuilder took 1064.75 ms. Allocated memory is still 303.0 MB. Free memory was 247.5 MB in the beginning and 215.5 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:56:04,931 INFO ]: TraceAbstraction took 57021.77 ms. Allocated memory was 303.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 215.5 MB in the beginning and 630.5 MB in the end (delta: -415.1 MB). Peak memory consumption was 773.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:56:04,934 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 303.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.41 ms. Allocated memory is still 303.0 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 79.38 ms. Allocated memory is still 303.0 MB. Free memory was 249.4 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1064.75 ms. Allocated memory is still 303.0 MB. Free memory was 247.5 MB in the beginning and 215.5 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57021.77 ms. Allocated memory was 303.0 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 215.5 MB in the beginning and 630.5 MB in the end (delta: -415.1 MB). Peak memory consumption was 773.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was constructing difference of abstraction (2298states) and interpolant automaton (currently 21 states, 17 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 104 locations, 1 error locations. TIMEOUT Result, 56.9s OverallTime, 28 OverallIterations, 10 TraceHistogramMax, 28.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5408 SDtfs, 421 SDslu, 26880 SDs, 0 SdLazy, 26747 SolverSat, 2585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 1247 SyntacticMatches, 3 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2304occurred in iteration=24, 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: 17.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 2667 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 2442 NumberOfCodeBlocks, 2442 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2392 ConstructedInterpolants, 0 QuantifiedInterpolants, 213184 SizeOfPredicates, 56 NumberOfNonLiveVariables, 5299 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 50 InterpolantComputations, 16 PerfectInterpolantSequences, 2636/3053 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/faulty__ackermann!.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-56-04-944.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__ackermann!.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-56-04-944.csv Completed graceful shutdown