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/rec__inlining.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 12:16:55,952 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 12:16:55,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 12:16:55,970 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 12:16:55,971 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 12:16:55,972 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 12:16:55,973 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 12:16:55,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 12:16:55,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 12:16:55,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 12:16:55,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 12:16:55,981 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 12:16:55,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 12:16:55,983 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 12:16:55,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 12:16:55,987 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 12:16:55,989 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 12:16:56,003 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 12:16:56,004 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 12:16:56,005 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 12:16:56,006 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 12:16:56,008 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 12:16:56,008 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 12:16:56,008 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 12:16:56,009 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 12:16:56,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 12:16:56,015 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 12:16:56,015 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 12:16:56,016 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 12:16:56,017 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 12:16:56,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 12:16:56,018 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 12:16:56,018 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 12:16:56,019 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 12:16:56,019 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 12:16:56,019 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 12:16:56,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 12:16:56,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 12:16:56,044 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 12:16:56,044 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 12:16:56,045 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 12:16:56,045 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 12:16:56,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 12:16:56,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 12:16:56,046 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 12:16:56,046 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 12:16:56,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 12:16:56,047 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 12:16:56,047 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 12:16:56,047 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 12:16:56,047 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 12:16:56,047 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 12:16:56,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 12:16:56,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 12:16:56,048 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 12:16:56,049 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 12:16:56,049 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 12:16:56,100 INFO ]: Repository-Root is: /tmp [2018-06-22 12:16:56,114 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 12:16:56,120 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 12:16:56,121 INFO ]: Initializing SmtParser... [2018-06-22 12:16:56,121 INFO ]: SmtParser initialized [2018-06-22 12:16:56,122 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 [2018-06-22 12:16:56,123 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 12:16:56,215 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3e5a9e9d [2018-06-22 12:16:56,438 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/rec__inlining.smt2 [2018-06-22 12:16:56,445 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 12:16:56,455 INFO ]: Walking toolchain with 4 elements. [2018-06-22 12:16:56,455 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 12:16:56,455 INFO ]: Initializing ChcToBoogie... [2018-06-22 12:16:56,455 INFO ]: ChcToBoogie initialized [2018-06-22 12:16:56,458 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:16:56" (1/1) ... [2018-06-22 12:16:56,504 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56 Unit [2018-06-22 12:16:56,505 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 12:16:56,508 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 12:16:56,508 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 12:16:56,508 INFO ]: Boogie Preprocessor initialized [2018-06-22 12:16:56,533 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56" (1/1) ... [2018-06-22 12:16:56,533 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56" (1/1) ... [2018-06-22 12:16:56,543 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56" (1/1) ... [2018-06-22 12:16:56,543 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56" (1/1) ... [2018-06-22 12:16:56,547 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56" (1/1) ... [2018-06-22 12:16:56,551 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56" (1/1) ... [2018-06-22 12:16:56,552 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56" (1/1) ... [2018-06-22 12:16:56,554 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 12:16:56,554 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 12:16:56,554 INFO ]: Initializing RCFGBuilder... [2018-06-22 12:16:56,554 INFO ]: RCFGBuilder initialized [2018-06-22 12:16:56,555 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 12:16:56,567 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 12:16:56,567 INFO ]: Found specification of procedure False [2018-06-22 12:16:56,567 INFO ]: Found implementation of procedure False [2018-06-22 12:16:56,567 INFO ]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration [2018-06-22 12:16:56,567 INFO ]: Found specification of procedure INV_REC_f__1 [2018-06-22 12:16:56,567 INFO ]: Found implementation of procedure INV_REC_f__1 [2018-06-22 12:16:56,568 INFO ]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration [2018-06-22 12:16:56,568 INFO ]: Found specification of procedure INV_REC_f__1_PRE [2018-06-22 12:16:56,568 INFO ]: Found implementation of procedure INV_REC_f__1_PRE [2018-06-22 12:16:56,568 INFO ]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration [2018-06-22 12:16:56,568 INFO ]: Found specification of procedure INV_REC_f^f_PRE [2018-06-22 12:16:56,568 INFO ]: Found implementation of procedure INV_REC_f^f_PRE [2018-06-22 12:16:56,568 INFO ]: Specification and implementation of procedure INV_REC_f^f given in one single declaration [2018-06-22 12:16:56,568 INFO ]: Found specification of procedure INV_REC_f^f [2018-06-22 12:16:56,568 INFO ]: Found implementation of procedure INV_REC_f^f [2018-06-22 12:16:56,568 INFO ]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration [2018-06-22 12:16:56,568 INFO ]: Found specification of procedure INV_REC_f__2 [2018-06-22 12:16:56,568 INFO ]: Found implementation of procedure INV_REC_f__2 [2018-06-22 12:16:56,568 INFO ]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration [2018-06-22 12:16:56,568 INFO ]: Found specification of procedure INV_REC_f__2_PRE [2018-06-22 12:16:56,568 INFO ]: Found implementation of procedure INV_REC_f__2_PRE [2018-06-22 12:16:56,568 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 12:16:56,568 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 12:16:56,568 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 12:16:56,973 INFO ]: Using library mode [2018-06-22 12:16:56,974 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:16:56 BoogieIcfgContainer [2018-06-22 12:16:56,974 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 12:16:56,975 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 12:16:56,975 INFO ]: Initializing TraceAbstraction... [2018-06-22 12:16:56,978 INFO ]: TraceAbstraction initialized [2018-06-22 12:16:56,981 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 12:16:56" (1/3) ... [2018-06-22 12:16:56,982 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634fa0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 12:16:56, skipping insertion in model container [2018-06-22 12:16:56,982 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 12:16:56" (2/3) ... [2018-06-22 12:16:56,982 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634fa0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 12:16:56, skipping insertion in model container [2018-06-22 12:16:56,982 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 12:16:56" (3/3) ... [2018-06-22 12:16:56,985 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 12:16:56,995 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 12:16:57,008 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 12:16:57,060 INFO ]: Using default assertion order modulation [2018-06-22 12:16:57,061 INFO ]: Interprodecural is true [2018-06-22 12:16:57,061 INFO ]: Hoare is false [2018-06-22 12:16:57,061 INFO ]: Compute interpolants for FPandBP [2018-06-22 12:16:57,061 INFO ]: Backedges is TWOTRACK [2018-06-22 12:16:57,061 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 12:16:57,061 INFO ]: Difference is false [2018-06-22 12:16:57,061 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 12:16:57,061 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 12:16:57,081 INFO ]: Start isEmpty. Operand 47 states. [2018-06-22 12:16:57,102 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-22 12:16:57,102 INFO ]: Found error trace [2018-06-22 12:16:57,103 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-22 12:16:57,103 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:57,107 INFO ]: Analyzing trace with hash 129915238, now seen corresponding path program 1 times [2018-06-22 12:16:57,108 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:57,108 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:57,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:57,141 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:57,141 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:57,153 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:57,174 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:16:57,176 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:57,176 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 12:16:57,178 INFO ]: Interpolant automaton has 2 states [2018-06-22 12:16:57,188 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 12:16:57,189 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 12:16:57,190 INFO ]: Start difference. First operand 47 states. Second operand 2 states. [2018-06-22 12:16:57,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:57,214 INFO ]: Finished difference Result 44 states and 67 transitions. [2018-06-22 12:16:57,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 12:16:57,215 INFO ]: Start accepts. Automaton has 2 states. Word has length 5 [2018-06-22 12:16:57,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:57,232 INFO ]: With dead ends: 44 [2018-06-22 12:16:57,232 INFO ]: Without dead ends: 44 [2018-06-22 12:16:57,234 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 12:16:57,248 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-22 12:16:57,272 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-22 12:16:57,274 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 12:16:57,277 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2018-06-22 12:16:57,278 INFO ]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 5 [2018-06-22 12:16:57,278 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:57,278 INFO ]: Abstraction has 44 states and 67 transitions. [2018-06-22 12:16:57,278 INFO ]: Interpolant automaton has 2 states. [2018-06-22 12:16:57,278 INFO ]: Start isEmpty. Operand 44 states and 67 transitions. [2018-06-22 12:16:57,280 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:16:57,280 INFO ]: Found error trace [2018-06-22 12:16:57,281 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:57,281 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:57,281 INFO ]: Analyzing trace with hash 1070658682, now seen corresponding path program 1 times [2018-06-22 12:16:57,281 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:57,281 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:57,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:57,282 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:57,282 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:57,329 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:57,533 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:16:57,533 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:57,533 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:16:57,536 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:16:57,536 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:16:57,536 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:16:57,536 INFO ]: Start difference. First operand 44 states and 67 transitions. Second operand 4 states. [2018-06-22 12:16:57,607 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:57,607 INFO ]: Finished difference Result 48 states and 72 transitions. [2018-06-22 12:16:57,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:16:57,608 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:16:57,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:57,610 INFO ]: With dead ends: 48 [2018-06-22 12:16:57,610 INFO ]: Without dead ends: 48 [2018-06-22 12:16:57,611 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 12:16:57,611 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-22 12:16:57,625 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-06-22 12:16:57,625 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 12:16:57,627 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2018-06-22 12:16:57,627 INFO ]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 13 [2018-06-22 12:16:57,627 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:57,627 INFO ]: Abstraction has 46 states and 70 transitions. [2018-06-22 12:16:57,627 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:16:57,627 INFO ]: Start isEmpty. Operand 46 states and 70 transitions. [2018-06-22 12:16:57,629 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 12:16:57,629 INFO ]: Found error trace [2018-06-22 12:16:57,629 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:57,629 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:57,629 INFO ]: Analyzing trace with hash -1444982271, now seen corresponding path program 1 times [2018-06-22 12:16:57,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:57,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:57,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:57,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:57,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:57,640 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:57,740 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:16:57,740 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:57,740 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:16:57,741 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:16:57,741 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:16:57,741 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:16:57,741 INFO ]: Start difference. First operand 46 states and 70 transitions. Second operand 4 states. [2018-06-22 12:16:58,015 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:58,016 INFO ]: Finished difference Result 50 states and 79 transitions. [2018-06-22 12:16:58,016 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:16:58,016 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 12:16:58,016 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:58,018 INFO ]: With dead ends: 50 [2018-06-22 12:16:58,018 INFO ]: Without dead ends: 50 [2018-06-22 12:16:58,019 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 12:16:58,019 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 12:16:58,029 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-06-22 12:16:58,029 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 12:16:58,031 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 76 transitions. [2018-06-22 12:16:58,031 INFO ]: Start accepts. Automaton has 48 states and 76 transitions. Word has length 13 [2018-06-22 12:16:58,032 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:58,032 INFO ]: Abstraction has 48 states and 76 transitions. [2018-06-22 12:16:58,032 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:16:58,032 INFO ]: Start isEmpty. Operand 48 states and 76 transitions. [2018-06-22 12:16:58,034 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 12:16:58,034 INFO ]: Found error trace [2018-06-22 12:16:58,034 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:16:58,034 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:58,035 INFO ]: Analyzing trace with hash 1623732163, now seen corresponding path program 1 times [2018-06-22 12:16:58,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:58,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:58,035 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:58,036 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:58,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:58,049 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:58,128 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 12:16:58,128 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:16:58,128 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 12:16:58,135 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:58,164 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:58,171 INFO ]: Computing forward predicates... [2018-06-22 12:16:58,219 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 12:16:58,239 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:16:58,239 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2018-06-22 12:16:58,239 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:16:58,239 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:16:58,239 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:16:58,240 INFO ]: Start difference. First operand 48 states and 76 transitions. Second operand 7 states. [2018-06-22 12:16:58,672 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:58,672 INFO ]: Finished difference Result 54 states and 86 transitions. [2018-06-22 12:16:58,672 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:16:58,672 INFO ]: Start accepts. Automaton has 7 states. Word has length 17 [2018-06-22 12:16:58,672 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:58,674 INFO ]: With dead ends: 54 [2018-06-22 12:16:58,674 INFO ]: Without dead ends: 54 [2018-06-22 12:16:58,674 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-06-22 12:16:58,674 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 12:16:58,684 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-06-22 12:16:58,684 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 12:16:58,686 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 84 transitions. [2018-06-22 12:16:58,686 INFO ]: Start accepts. Automaton has 52 states and 84 transitions. Word has length 17 [2018-06-22 12:16:58,686 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:58,686 INFO ]: Abstraction has 52 states and 84 transitions. [2018-06-22 12:16:58,686 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:16:58,686 INFO ]: Start isEmpty. Operand 52 states and 84 transitions. [2018-06-22 12:16:58,688 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:16:58,688 INFO ]: Found error trace [2018-06-22 12:16:58,688 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 12:16:58,689 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:16:58,689 INFO ]: Analyzing trace with hash 1494469536, now seen corresponding path program 1 times [2018-06-22 12:16:58,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:16:58,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:16:58,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:58,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:16:58,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:16:58,719 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:16:58,940 WARN ]: Spent 139.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 16 [2018-06-22 12:16:59,564 WARN ]: Spent 563.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 18 [2018-06-22 12:16:59,734 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 12:16:59,734 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:16:59,734 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:16:59,734 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:16:59,735 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:16:59,735 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:16:59,735 INFO ]: Start difference. First operand 52 states and 84 transitions. Second operand 7 states. [2018-06-22 12:16:59,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:16:59,964 INFO ]: Finished difference Result 59 states and 94 transitions. [2018-06-22 12:16:59,985 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:16:59,985 INFO ]: Start accepts. Automaton has 7 states. Word has length 21 [2018-06-22 12:16:59,985 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:16:59,986 INFO ]: With dead ends: 59 [2018-06-22 12:16:59,987 INFO ]: Without dead ends: 59 [2018-06-22 12:16:59,987 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:16:59,987 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-22 12:16:59,997 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 53. [2018-06-22 12:16:59,997 INFO ]: Start removeUnreachable. Operand 53 states. [2018-06-22 12:16:59,999 INFO ]: Finished removeUnreachable. Reduced from 53 states to 53 states and 88 transitions. [2018-06-22 12:16:59,999 INFO ]: Start accepts. Automaton has 53 states and 88 transitions. Word has length 21 [2018-06-22 12:16:59,999 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:16:59,999 INFO ]: Abstraction has 53 states and 88 transitions. [2018-06-22 12:16:59,999 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:16:59,999 INFO ]: Start isEmpty. Operand 53 states and 88 transitions. [2018-06-22 12:17:00,001 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 12:17:00,001 INFO ]: Found error trace [2018-06-22 12:17:00,001 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:00,001 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:00,002 INFO ]: Analyzing trace with hash -855676319, now seen corresponding path program 1 times [2018-06-22 12:17:00,002 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:00,002 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:00,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:00,002 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:00,002 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:00,009 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:00,037 INFO ]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:00,037 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:00,037 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:17:00,037 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:17:00,037 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:17:00,037 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:17:00,037 INFO ]: Start difference. First operand 53 states and 88 transitions. Second operand 4 states. [2018-06-22 12:17:00,089 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:00,089 INFO ]: Finished difference Result 53 states and 87 transitions. [2018-06-22 12:17:00,089 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:17:00,089 INFO ]: Start accepts. Automaton has 4 states. Word has length 21 [2018-06-22 12:17:00,090 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:00,091 INFO ]: With dead ends: 53 [2018-06-22 12:17:00,091 INFO ]: Without dead ends: 52 [2018-06-22 12:17:00,091 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 12:17:00,091 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-22 12:17:00,100 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-06-22 12:17:00,100 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-22 12:17:00,102 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2018-06-22 12:17:00,102 INFO ]: Start accepts. Automaton has 52 states and 85 transitions. Word has length 21 [2018-06-22 12:17:00,102 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:00,102 INFO ]: Abstraction has 52 states and 85 transitions. [2018-06-22 12:17:00,102 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:17:00,102 INFO ]: Start isEmpty. Operand 52 states and 85 transitions. [2018-06-22 12:17:00,104 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:17:00,104 INFO ]: Found error trace [2018-06-22 12:17:00,104 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:00,104 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:00,104 INFO ]: Analyzing trace with hash -1686198314, now seen corresponding path program 1 times [2018-06-22 12:17:00,104 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:00,104 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:00,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:00,106 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:00,106 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:00,139 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:00,314 INFO ]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-06-22 12:17:00,314 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:00,314 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 12:17:00,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:00,349 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:00,353 INFO ]: Computing forward predicates... [2018-06-22 12:17:00,401 INFO ]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 12:17:00,420 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:00,420 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 12:17:00,420 INFO ]: Interpolant automaton has 8 states [2018-06-22 12:17:00,421 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 12:17:00,421 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:17:00,421 INFO ]: Start difference. First operand 52 states and 85 transitions. Second operand 8 states. [2018-06-22 12:17:00,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:00,628 INFO ]: Finished difference Result 63 states and 102 transitions. [2018-06-22 12:17:00,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 12:17:00,628 INFO ]: Start accepts. Automaton has 8 states. Word has length 29 [2018-06-22 12:17:00,629 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:00,630 INFO ]: With dead ends: 63 [2018-06-22 12:17:00,630 INFO ]: Without dead ends: 63 [2018-06-22 12:17:00,630 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:17:00,630 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-22 12:17:00,641 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 57. [2018-06-22 12:17:00,641 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-22 12:17:00,643 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-06-22 12:17:00,643 INFO ]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 29 [2018-06-22 12:17:00,643 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:00,643 INFO ]: Abstraction has 57 states and 92 transitions. [2018-06-22 12:17:00,643 INFO ]: Interpolant automaton has 8 states. [2018-06-22 12:17:00,643 INFO ]: Start isEmpty. Operand 57 states and 92 transitions. [2018-06-22 12:17:00,645 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:17:00,645 INFO ]: Found error trace [2018-06-22 12:17:00,645 INFO ]: trace histogram [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 12:17:00,645 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:00,645 INFO ]: Analyzing trace with hash -1942022607, now seen corresponding path program 1 times [2018-06-22 12:17:00,645 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:00,645 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:00,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:00,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:00,646 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:00,657 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:00,760 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 12:17:00,760 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:00,760 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 12:17:00,767 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:00,783 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:00,785 INFO ]: Computing forward predicates... [2018-06-22 12:17:00,812 INFO ]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:00,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:00,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-06-22 12:17:00,831 INFO ]: Interpolant automaton has 9 states [2018-06-22 12:17:00,831 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 12:17:00,831 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-22 12:17:00,832 INFO ]: Start difference. First operand 57 states and 92 transitions. Second operand 9 states. [2018-06-22 12:17:01,102 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:01,102 INFO ]: Finished difference Result 65 states and 104 transitions. [2018-06-22 12:17:01,102 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 12:17:01,103 INFO ]: Start accepts. Automaton has 9 states. Word has length 29 [2018-06-22 12:17:01,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:01,104 INFO ]: With dead ends: 65 [2018-06-22 12:17:01,104 INFO ]: Without dead ends: 65 [2018-06-22 12:17:01,104 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:17:01,104 INFO ]: Start minimizeSevpa. Operand 65 states. [2018-06-22 12:17:01,113 INFO ]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-06-22 12:17:01,113 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 12:17:01,115 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 94 transitions. [2018-06-22 12:17:01,115 INFO ]: Start accepts. Automaton has 59 states and 94 transitions. Word has length 29 [2018-06-22 12:17:01,115 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:01,115 INFO ]: Abstraction has 59 states and 94 transitions. [2018-06-22 12:17:01,115 INFO ]: Interpolant automaton has 9 states. [2018-06-22 12:17:01,115 INFO ]: Start isEmpty. Operand 59 states and 94 transitions. [2018-06-22 12:17:01,116 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 12:17:01,116 INFO ]: Found error trace [2018-06-22 12:17:01,117 INFO ]: trace histogram [7, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:01,117 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:01,117 INFO ]: Analyzing trace with hash 176369771, now seen corresponding path program 2 times [2018-06-22 12:17:01,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:01,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:01,117 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:01,117 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:01,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:01,133 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:01,208 INFO ]: Checked inductivity of 80 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-06-22 12:17:01,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:01,208 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 12:17:01,225 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:17:01,251 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:17:01,251 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:01,254 INFO ]: Computing forward predicates... [2018-06-22 12:17:01,332 INFO ]: Checked inductivity of 80 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 12:17:01,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:01,351 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-06-22 12:17:01,351 INFO ]: Interpolant automaton has 11 states [2018-06-22 12:17:01,352 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 12:17:01,352 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:17:01,352 INFO ]: Start difference. First operand 59 states and 94 transitions. Second operand 11 states. [2018-06-22 12:17:01,621 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:01,621 INFO ]: Finished difference Result 75 states and 124 transitions. [2018-06-22 12:17:01,622 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 12:17:01,622 INFO ]: Start accepts. Automaton has 11 states. Word has length 45 [2018-06-22 12:17:01,622 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:01,623 INFO ]: With dead ends: 75 [2018-06-22 12:17:01,623 INFO ]: Without dead ends: 55 [2018-06-22 12:17:01,623 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-06-22 12:17:01,624 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-22 12:17:01,630 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 44. [2018-06-22 12:17:01,630 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-22 12:17:01,631 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2018-06-22 12:17:01,631 INFO ]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 45 [2018-06-22 12:17:01,631 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:01,632 INFO ]: Abstraction has 44 states and 65 transitions. [2018-06-22 12:17:01,632 INFO ]: Interpolant automaton has 11 states. [2018-06-22 12:17:01,632 INFO ]: Start isEmpty. Operand 44 states and 65 transitions. [2018-06-22 12:17:01,632 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 12:17:01,632 INFO ]: Found error trace [2018-06-22 12:17:01,632 INFO ]: trace histogram [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 12:17:01,633 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:01,633 INFO ]: Analyzing trace with hash 703065671, now seen corresponding path program 1 times [2018-06-22 12:17:01,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:01,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:01,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:01,633 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:17:01,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:01,641 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:01,697 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-22 12:17:01,697 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:01,697 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 12:17:01,697 INFO ]: Interpolant automaton has 4 states [2018-06-22 12:17:01,697 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 12:17:01,697 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 12:17:01,698 INFO ]: Start difference. First operand 44 states and 65 transitions. Second operand 4 states. [2018-06-22 12:17:01,735 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:01,735 INFO ]: Finished difference Result 46 states and 68 transitions. [2018-06-22 12:17:01,735 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 12:17:01,735 INFO ]: Start accepts. Automaton has 4 states. Word has length 29 [2018-06-22 12:17:01,735 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:01,736 INFO ]: With dead ends: 46 [2018-06-22 12:17:01,736 INFO ]: Without dead ends: 46 [2018-06-22 12:17:01,736 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 12:17:01,736 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-22 12:17:01,740 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-06-22 12:17:01,741 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 12:17:01,741 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2018-06-22 12:17:01,741 INFO ]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 29 [2018-06-22 12:17:01,742 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:01,742 INFO ]: Abstraction has 46 states and 68 transitions. [2018-06-22 12:17:01,742 INFO ]: Interpolant automaton has 4 states. [2018-06-22 12:17:01,742 INFO ]: Start isEmpty. Operand 46 states and 68 transitions. [2018-06-22 12:17:01,743 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 12:17:01,743 INFO ]: Found error trace [2018-06-22 12:17:01,743 INFO ]: trace histogram [3, 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 12:17:01,743 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:01,743 INFO ]: Analyzing trace with hash 1488731408, now seen corresponding path program 1 times [2018-06-22 12:17:01,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:01,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:01,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:01,744 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:01,744 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:01,752 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:01,799 INFO ]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:01,799 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:01,799 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 12:17:01,799 INFO ]: Interpolant automaton has 6 states [2018-06-22 12:17:01,799 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 12:17:01,799 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-22 12:17:01,799 INFO ]: Start difference. First operand 46 states and 68 transitions. Second operand 6 states. [2018-06-22 12:17:01,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:01,851 INFO ]: Finished difference Result 50 states and 75 transitions. [2018-06-22 12:17:01,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 12:17:01,851 INFO ]: Start accepts. Automaton has 6 states. Word has length 33 [2018-06-22 12:17:01,851 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:01,852 INFO ]: With dead ends: 50 [2018-06-22 12:17:01,852 INFO ]: Without dead ends: 50 [2018-06-22 12:17:01,852 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:17:01,852 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-22 12:17:01,857 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-06-22 12:17:01,857 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-22 12:17:01,858 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2018-06-22 12:17:01,858 INFO ]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 33 [2018-06-22 12:17:01,858 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:01,858 INFO ]: Abstraction has 46 states and 68 transitions. [2018-06-22 12:17:01,858 INFO ]: Interpolant automaton has 6 states. [2018-06-22 12:17:01,858 INFO ]: Start isEmpty. Operand 46 states and 68 transitions. [2018-06-22 12:17:01,859 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 12:17:01,859 INFO ]: Found error trace [2018-06-22 12:17:01,859 INFO ]: trace histogram [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, 1, 1] [2018-06-22 12:17:01,859 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:01,859 INFO ]: Analyzing trace with hash -1468393646, now seen corresponding path program 1 times [2018-06-22 12:17:01,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:01,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:01,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:01,860 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:01,860 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:01,869 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:01,936 INFO ]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 12:17:01,936 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:01,936 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 12:17:01,943 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:01,967 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:01,969 INFO ]: Computing forward predicates... [2018-06-22 12:17:01,990 INFO ]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-22 12:17:02,009 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:17:02,009 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2018-06-22 12:17:02,009 INFO ]: Interpolant automaton has 9 states [2018-06-22 12:17:02,009 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 12:17:02,009 INFO ]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-06-22 12:17:02,010 INFO ]: Start difference. First operand 46 states and 68 transitions. Second operand 9 states. [2018-06-22 12:17:02,179 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:02,179 INFO ]: Finished difference Result 54 states and 82 transitions. [2018-06-22 12:17:02,179 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 12:17:02,179 INFO ]: Start accepts. Automaton has 9 states. Word has length 37 [2018-06-22 12:17:02,179 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:02,180 INFO ]: With dead ends: 54 [2018-06-22 12:17:02,180 INFO ]: Without dead ends: 54 [2018-06-22 12:17:02,180 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-06-22 12:17:02,180 INFO ]: Start minimizeSevpa. Operand 54 states. [2018-06-22 12:17:02,186 INFO ]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-06-22 12:17:02,186 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-22 12:17:02,187 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2018-06-22 12:17:02,187 INFO ]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 37 [2018-06-22 12:17:02,187 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:02,187 INFO ]: Abstraction has 48 states and 72 transitions. [2018-06-22 12:17:02,187 INFO ]: Interpolant automaton has 9 states. [2018-06-22 12:17:02,187 INFO ]: Start isEmpty. Operand 48 states and 72 transitions. [2018-06-22 12:17:02,189 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 12:17:02,189 INFO ]: Found error trace [2018-06-22 12:17:02,189 INFO ]: trace histogram [3, 3, 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 12:17:02,189 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:02,189 INFO ]: Analyzing trace with hash 1491289620, now seen corresponding path program 1 times [2018-06-22 12:17:02,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:02,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:02,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:02,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:02,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:02,209 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:02,610 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-06-22 12:17:02,700 INFO ]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 12:17:02,700 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:02,700 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:17:02,706 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:02,724 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:02,727 INFO ]: Computing forward predicates... [2018-06-22 12:17:02,983 INFO ]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-06-22 12:17:03,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:03,002 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-22 12:17:03,002 INFO ]: Interpolant automaton has 16 states [2018-06-22 12:17:03,002 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 12:17:03,002 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-22 12:17:03,002 INFO ]: Start difference. First operand 48 states and 72 transitions. Second operand 16 states. [2018-06-22 12:17:03,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:03,453 INFO ]: Finished difference Result 61 states and 95 transitions. [2018-06-22 12:17:03,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 12:17:03,453 INFO ]: Start accepts. Automaton has 16 states. Word has length 41 [2018-06-22 12:17:03,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:03,454 INFO ]: With dead ends: 61 [2018-06-22 12:17:03,454 INFO ]: Without dead ends: 61 [2018-06-22 12:17:03,455 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-06-22 12:17:03,455 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 12:17:03,464 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-06-22 12:17:03,464 INFO ]: Start removeUnreachable. Operand 54 states. [2018-06-22 12:17:03,465 INFO ]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2018-06-22 12:17:03,465 INFO ]: Start accepts. Automaton has 54 states and 84 transitions. Word has length 41 [2018-06-22 12:17:03,465 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:03,465 INFO ]: Abstraction has 54 states and 84 transitions. [2018-06-22 12:17:03,465 INFO ]: Interpolant automaton has 16 states. [2018-06-22 12:17:03,465 INFO ]: Start isEmpty. Operand 54 states and 84 transitions. [2018-06-22 12:17:03,467 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 12:17:03,467 INFO ]: Found error trace [2018-06-22 12:17:03,467 INFO ]: trace histogram [4, 3, 3, 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 12:17:03,467 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:03,467 INFO ]: Analyzing trace with hash 431712037, now seen corresponding path program 1 times [2018-06-22 12:17:03,467 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:03,467 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:03,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:03,468 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:03,468 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:03,481 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:03,835 INFO ]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 12:17:03,835 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:03,835 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) [2018-06-22 12:17:03,851 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 12:17:03,884 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:03,888 INFO ]: Computing forward predicates... [2018-06-22 12:17:04,158 INFO ]: Checked inductivity of 33 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 12:17:04,177 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 12:17:04,177 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-06-22 12:17:04,178 INFO ]: Interpolant automaton has 8 states [2018-06-22 12:17:04,178 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 12:17:04,178 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:17:04,178 INFO ]: Start difference. First operand 54 states and 84 transitions. Second operand 8 states. [2018-06-22 12:17:04,272 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:04,272 INFO ]: Finished difference Result 58 states and 88 transitions. [2018-06-22 12:17:04,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:17:04,272 INFO ]: Start accepts. Automaton has 8 states. Word has length 49 [2018-06-22 12:17:04,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:04,273 INFO ]: With dead ends: 58 [2018-06-22 12:17:04,273 INFO ]: Without dead ends: 56 [2018-06-22 12:17:04,273 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-22 12:17:04,273 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-22 12:17:04,277 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-06-22 12:17:04,277 INFO ]: Start removeUnreachable. Operand 56 states. [2018-06-22 12:17:04,278 INFO ]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2018-06-22 12:17:04,278 INFO ]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 49 [2018-06-22 12:17:04,279 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:04,279 INFO ]: Abstraction has 56 states and 86 transitions. [2018-06-22 12:17:04,279 INFO ]: Interpolant automaton has 8 states. [2018-06-22 12:17:04,279 INFO ]: Start isEmpty. Operand 56 states and 86 transitions. [2018-06-22 12:17:04,280 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 12:17:04,280 INFO ]: Found error trace [2018-06-22 12:17:04,280 INFO ]: trace histogram [5, 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] [2018-06-22 12:17:04,280 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:04,280 INFO ]: Analyzing trace with hash -1173629730, now seen corresponding path program 1 times [2018-06-22 12:17:04,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:04,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:04,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:04,281 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:04,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:04,296 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:04,478 WARN ]: Spent 110.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2018-06-22 12:17:04,870 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 7 [2018-06-22 12:17:05,005 INFO ]: Checked inductivity of 40 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 12:17:05,005 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:05,030 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 12:17:05,042 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 12:17:05,077 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:05,080 INFO ]: Computing forward predicates... [2018-06-22 12:17:05,547 INFO ]: Checked inductivity of 40 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 12:17:05,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:05,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-06-22 12:17:05,566 INFO ]: Interpolant automaton has 18 states [2018-06-22 12:17:05,566 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-22 12:17:05,566 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-22 12:17:05,567 INFO ]: Start difference. First operand 56 states and 86 transitions. Second operand 18 states. [2018-06-22 12:17:06,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:06,033 INFO ]: Finished difference Result 73 states and 107 transitions. [2018-06-22 12:17:06,034 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 12:17:06,034 INFO ]: Start accepts. Automaton has 18 states. Word has length 49 [2018-06-22 12:17:06,034 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:06,034 INFO ]: With dead ends: 73 [2018-06-22 12:17:06,034 INFO ]: Without dead ends: 61 [2018-06-22 12:17:06,035 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2018-06-22 12:17:06,035 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-22 12:17:06,040 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 55. [2018-06-22 12:17:06,040 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-22 12:17:06,042 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2018-06-22 12:17:06,042 INFO ]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 49 [2018-06-22 12:17:06,043 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:06,043 INFO ]: Abstraction has 55 states and 82 transitions. [2018-06-22 12:17:06,043 INFO ]: Interpolant automaton has 18 states. [2018-06-22 12:17:06,043 INFO ]: Start isEmpty. Operand 55 states and 82 transitions. [2018-06-22 12:17:06,043 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 12:17:06,043 INFO ]: Found error trace [2018-06-22 12:17:06,043 INFO ]: trace histogram [7, 4, 3, 3, 3, 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] [2018-06-22 12:17:06,044 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:06,044 INFO ]: Analyzing trace with hash -936233718, now seen corresponding path program 1 times [2018-06-22 12:17:06,044 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:06,044 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:06,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:06,044 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:06,044 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:06,057 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:06,165 INFO ]: Checked inductivity of 77 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 12:17:06,165 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:06,165 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 12:17:06,172 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:06,191 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:06,194 INFO ]: Computing forward predicates... [2018-06-22 12:17:06,255 INFO ]: Checked inductivity of 77 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-22 12:17:06,274 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:06,274 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2018-06-22 12:17:06,274 INFO ]: Interpolant automaton has 11 states [2018-06-22 12:17:06,274 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-22 12:17:06,274 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-22 12:17:06,275 INFO ]: Start difference. First operand 55 states and 82 transitions. Second operand 11 states. [2018-06-22 12:17:06,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:06,447 INFO ]: Finished difference Result 69 states and 103 transitions. [2018-06-22 12:17:06,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 12:17:06,447 INFO ]: Start accepts. Automaton has 11 states. Word has length 53 [2018-06-22 12:17:06,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:06,448 INFO ]: With dead ends: 69 [2018-06-22 12:17:06,448 INFO ]: Without dead ends: 67 [2018-06-22 12:17:06,448 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:17:06,448 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 12:17:06,453 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 59. [2018-06-22 12:17:06,453 INFO ]: Start removeUnreachable. Operand 59 states. [2018-06-22 12:17:06,454 INFO ]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-06-22 12:17:06,454 INFO ]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 53 [2018-06-22 12:17:06,454 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:06,455 INFO ]: Abstraction has 59 states and 89 transitions. [2018-06-22 12:17:06,455 INFO ]: Interpolant automaton has 11 states. [2018-06-22 12:17:06,455 INFO ]: Start isEmpty. Operand 59 states and 89 transitions. [2018-06-22 12:17:06,456 INFO ]: Finished isEmpty. Found accepting run of length 74 [2018-06-22 12:17:06,456 INFO ]: Found error trace [2018-06-22 12:17:06,456 INFO ]: trace histogram [11, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:06,456 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:06,456 INFO ]: Analyzing trace with hash 725785313, now seen corresponding path program 2 times [2018-06-22 12:17:06,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:06,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:06,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:06,456 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:06,456 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:06,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:06,546 INFO ]: Checked inductivity of 204 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-06-22 12:17:06,546 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:06,546 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 12:17:06,557 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:17:06,585 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:17:06,585 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:06,588 INFO ]: Computing forward predicates... [2018-06-22 12:17:06,731 INFO ]: Checked inductivity of 204 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-06-22 12:17:06,762 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:06,762 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-06-22 12:17:06,763 INFO ]: Interpolant automaton has 14 states [2018-06-22 12:17:06,763 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-22 12:17:06,763 INFO ]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-06-22 12:17:06,763 INFO ]: Start difference. First operand 59 states and 89 transitions. Second operand 14 states. [2018-06-22 12:17:07,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:07,014 INFO ]: Finished difference Result 77 states and 117 transitions. [2018-06-22 12:17:07,014 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 12:17:07,014 INFO ]: Start accepts. Automaton has 14 states. Word has length 73 [2018-06-22 12:17:07,014 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:07,015 INFO ]: With dead ends: 77 [2018-06-22 12:17:07,015 INFO ]: Without dead ends: 75 [2018-06-22 12:17:07,015 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-06-22 12:17:07,015 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-22 12:17:07,020 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-06-22 12:17:07,020 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 12:17:07,021 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 99 transitions. [2018-06-22 12:17:07,021 INFO ]: Start accepts. Automaton has 65 states and 99 transitions. Word has length 73 [2018-06-22 12:17:07,021 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:07,021 INFO ]: Abstraction has 65 states and 99 transitions. [2018-06-22 12:17:07,021 INFO ]: Interpolant automaton has 14 states. [2018-06-22 12:17:07,021 INFO ]: Start isEmpty. Operand 65 states and 99 transitions. [2018-06-22 12:17:07,022 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 12:17:07,022 INFO ]: Found error trace [2018-06-22 12:17:07,022 INFO ]: trace histogram [5, 4, 3, 3, 2, 2, 2, 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] [2018-06-22 12:17:07,022 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:07,022 INFO ]: Analyzing trace with hash -2061425409, now seen corresponding path program 2 times [2018-06-22 12:17:07,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:07,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:07,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:07,023 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:17:07,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:07,030 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:07,130 INFO ]: Checked inductivity of 61 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 12:17:07,130 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 12:17:07,130 INFO ]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-06-22 12:17:07,131 INFO ]: Interpolant automaton has 7 states [2018-06-22 12:17:07,131 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-22 12:17:07,131 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-22 12:17:07,131 INFO ]: Start difference. First operand 65 states and 99 transitions. Second operand 7 states. [2018-06-22 12:17:07,178 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:07,178 INFO ]: Finished difference Result 67 states and 101 transitions. [2018-06-22 12:17:07,178 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 12:17:07,178 INFO ]: Start accepts. Automaton has 7 states. Word has length 57 [2018-06-22 12:17:07,178 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:07,179 INFO ]: With dead ends: 67 [2018-06-22 12:17:07,179 INFO ]: Without dead ends: 67 [2018-06-22 12:17:07,179 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-22 12:17:07,179 INFO ]: Start minimizeSevpa. Operand 67 states. [2018-06-22 12:17:07,184 INFO ]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-06-22 12:17:07,184 INFO ]: Start removeUnreachable. Operand 65 states. [2018-06-22 12:17:07,185 INFO ]: Finished removeUnreachable. Reduced from 65 states to 65 states and 98 transitions. [2018-06-22 12:17:07,185 INFO ]: Start accepts. Automaton has 65 states and 98 transitions. Word has length 57 [2018-06-22 12:17:07,185 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:07,185 INFO ]: Abstraction has 65 states and 98 transitions. [2018-06-22 12:17:07,185 INFO ]: Interpolant automaton has 7 states. [2018-06-22 12:17:07,185 INFO ]: Start isEmpty. Operand 65 states and 98 transitions. [2018-06-22 12:17:07,186 INFO ]: Finished isEmpty. Found accepting run of length 90 [2018-06-22 12:17:07,186 INFO ]: Found error trace [2018-06-22 12:17:07,186 INFO ]: trace histogram [14, 9, 9, 9, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 12:17:07,186 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:07,187 INFO ]: Analyzing trace with hash 1834239414, now seen corresponding path program 1 times [2018-06-22 12:17:07,187 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:07,187 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:07,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:07,187 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:17:07,187 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:07,201 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:07,419 INFO ]: Checked inductivity of 351 backedges. 82 proven. 5 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-06-22 12:17:07,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:07,419 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 12:17:07,428 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:07,465 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:07,469 INFO ]: Computing forward predicates... [2018-06-22 12:17:07,628 INFO ]: Checked inductivity of 351 backedges. 53 proven. 78 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-06-22 12:17:07,649 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:07,649 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-06-22 12:17:07,649 INFO ]: Interpolant automaton has 16 states [2018-06-22 12:17:07,649 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-22 12:17:07,649 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-22 12:17:07,650 INFO ]: Start difference. First operand 65 states and 98 transitions. Second operand 16 states. [2018-06-22 12:17:08,592 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:08,593 INFO ]: Finished difference Result 85 states and 136 transitions. [2018-06-22 12:17:08,593 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 12:17:08,593 INFO ]: Start accepts. Automaton has 16 states. Word has length 89 [2018-06-22 12:17:08,593 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:08,594 INFO ]: With dead ends: 85 [2018-06-22 12:17:08,594 INFO ]: Without dead ends: 79 [2018-06-22 12:17:08,594 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-06-22 12:17:08,594 INFO ]: Start minimizeSevpa. Operand 79 states. [2018-06-22 12:17:08,602 INFO ]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-06-22 12:17:08,603 INFO ]: Start removeUnreachable. Operand 73 states. [2018-06-22 12:17:08,603 INFO ]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2018-06-22 12:17:08,603 INFO ]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 89 [2018-06-22 12:17:08,604 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:08,604 INFO ]: Abstraction has 73 states and 106 transitions. [2018-06-22 12:17:08,604 INFO ]: Interpolant automaton has 16 states. [2018-06-22 12:17:08,604 INFO ]: Start isEmpty. Operand 73 states and 106 transitions. [2018-06-22 12:17:08,605 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-22 12:17:08,605 INFO ]: Found error trace [2018-06-22 12:17:08,605 INFO ]: trace histogram [6, 4, 4, 3, 2, 2, 2, 2, 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, 1, 1, 1] [2018-06-22 12:17:08,605 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:08,605 INFO ]: Analyzing trace with hash -1355845552, now seen corresponding path program 2 times [2018-06-22 12:17:08,605 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:08,605 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:08,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:08,606 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 12:17:08,606 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:08,616 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:08,771 INFO ]: Checked inductivity of 79 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-22 12:17:08,771 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:08,771 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 12:17:08,777 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 12:17:08,797 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 12:17:08,797 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:08,799 INFO ]: Computing forward predicates... [2018-06-22 12:17:08,838 INFO ]: Checked inductivity of 79 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-22 12:17:08,857 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:08,857 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-06-22 12:17:08,858 INFO ]: Interpolant automaton has 13 states [2018-06-22 12:17:08,858 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 12:17:08,858 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-22 12:17:08,858 INFO ]: Start difference. First operand 73 states and 106 transitions. Second operand 13 states. [2018-06-22 12:17:09,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:09,010 INFO ]: Finished difference Result 83 states and 123 transitions. [2018-06-22 12:17:09,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 12:17:09,010 INFO ]: Start accepts. Automaton has 13 states. Word has length 65 [2018-06-22 12:17:09,011 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:09,011 INFO ]: With dead ends: 83 [2018-06-22 12:17:09,011 INFO ]: Without dead ends: 83 [2018-06-22 12:17:09,012 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-06-22 12:17:09,012 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-22 12:17:09,016 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 75. [2018-06-22 12:17:09,016 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-22 12:17:09,017 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2018-06-22 12:17:09,017 INFO ]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 65 [2018-06-22 12:17:09,018 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:09,018 INFO ]: Abstraction has 75 states and 109 transitions. [2018-06-22 12:17:09,018 INFO ]: Interpolant automaton has 13 states. [2018-06-22 12:17:09,018 INFO ]: Start isEmpty. Operand 75 states and 109 transitions. [2018-06-22 12:17:09,019 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-22 12:17:09,019 INFO ]: Found error trace [2018-06-22 12:17:09,019 INFO ]: trace histogram [7, 4, 4, 3, 3, 3, 3, 2, 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, 1, 1, 1] [2018-06-22 12:17:09,019 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 12:17:09,019 INFO ]: Analyzing trace with hash 165448594, now seen corresponding path program 3 times [2018-06-22 12:17:09,019 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 12:17:09,019 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 12:17:09,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:09,019 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 12:17:09,019 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 12:17:09,036 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:09,349 WARN ]: Spent 240.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-06-22 12:17:09,974 INFO ]: Checked inductivity of 99 backedges. 18 proven. 41 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-06-22 12:17:09,974 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 12:17:09,974 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 12:17:09,981 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 12:17:10,002 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-22 12:17:10,002 INFO ]: Conjunction of SSA is unsat [2018-06-22 12:17:10,006 INFO ]: Computing forward predicates... [2018-06-22 12:17:10,619 INFO ]: Checked inductivity of 99 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-06-22 12:17:10,639 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 12:17:10,639 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2018-06-22 12:17:10,639 INFO ]: Interpolant automaton has 34 states [2018-06-22 12:17:10,640 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-22 12:17:10,640 INFO ]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2018-06-22 12:17:10,640 INFO ]: Start difference. First operand 75 states and 109 transitions. Second operand 34 states. [2018-06-22 12:17:12,344 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 12:17:12,345 INFO ]: Finished difference Result 111 states and 186 transitions. [2018-06-22 12:17:12,345 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-22 12:17:12,345 INFO ]: Start accepts. Automaton has 34 states. Word has length 69 [2018-06-22 12:17:12,345 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 12:17:12,345 INFO ]: With dead ends: 111 [2018-06-22 12:17:12,345 INFO ]: Without dead ends: 0 [2018-06-22 12:17:12,346 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=244, Invalid=2726, Unknown=0, NotChecked=0, Total=2970 [2018-06-22 12:17:12,346 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 12:17:12,346 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 12:17:12,346 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 12:17:12,346 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 12:17:12,346 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-06-22 12:17:12,346 INFO ]: Finished accepts. word is rejected. [2018-06-22 12:17:12,346 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 12:17:12,346 INFO ]: Interpolant automaton has 34 states. [2018-06-22 12:17:12,346 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 12:17:12,346 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 12:17:12,445 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 12:17:12 BoogieIcfgContainer [2018-06-22 12:17:12,445 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 12:17:12,446 INFO ]: Toolchain (without parser) took 16000.18 ms. Allocated memory was 309.3 MB in the beginning and 576.7 MB in the end (delta: 267.4 MB). Free memory was 263.7 MB in the beginning and 555.9 MB in the end (delta: -292.2 MB). Peak memory consumption was 101.1 MB. Max. memory is 3.6 GB. [2018-06-22 12:17:12,446 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 12:17:12,447 INFO ]: ChcToBoogie took 52.01 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:17:12,447 INFO ]: Boogie Preprocessor took 46.02 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:17:12,447 INFO ]: RCFGBuilder took 419.76 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:17:12,448 INFO ]: TraceAbstraction took 15470.02 ms. Allocated memory was 309.3 MB in the beginning and 576.7 MB in the end (delta: 267.4 MB). Free memory was 247.7 MB in the beginning and 555.9 MB in the end (delta: -308.3 MB). Peak memory consumption was 85.0 MB. Max. memory is 3.6 GB. [2018-06-22 12:17:12,450 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 52.01 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.02 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 419.76 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 247.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 15470.02 ms. Allocated memory was 309.3 MB in the beginning and 576.7 MB in the end (delta: 267.4 MB). Free memory was 247.7 MB in the beginning and 555.9 MB in the end (delta: -308.3 MB). Peak memory consumption was 85.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 47 locations, 1 error locations. SAFE Result, 15.3s OverallTime, 21 OverallIterations, 14 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1028 SDtfs, 160 SDslu, 4771 SDs, 0 SdLazy, 3387 SolverSat, 378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 869 GetRequests, 622 SyntacticMatches, 6 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 92 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 1482 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1448 ConstructedInterpolants, 0 QuantifiedInterpolants, 225444 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2226 ConjunctsInSsa, 222 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 1894/2145 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_12-17-12-458.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec__inlining.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_12-17-12-458.csv Received shutdown request...